PAT 1039. Course List for Student (25)

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
using namespace std;

vector<int> student[26*26*26*10];//40000*2500内存会超限

//将名子hash对应一个数
int hashx(char a[5])
{
return (a[0]-'A')*26*26*10 + (a[1] - 'A')*26*10 + (a[2] - 'A')*10 + (a[3] - '0');
}

int main()
{
int n,k;
while(scanf("%d%d",&n,&k) != EOF)
{
for(int i = 0; i < k; i++)
{
int c,num;
scanf("%d%d",&c,&num);
for(int j = 0; j < num; j++)
{
char name[5];
scanf("%s",name);
student[hashx(name)].push_back(c);
}
}
for(int i = 0; i < n; i++)
{
char name[5];
scanf("%s",name);
int x = hashx(name);
int len = student[x].size();
if(len > 0)
{
sort(student[x].begin(),student[x].end());
printf("%s %d",name,len);
for(int j = 0; j < len; j++)
printf(" %d",student[x][j]);
printf("\n");
}else
printf("%s %d\n",name,0);
}
}
return 0;
}