pat1039 Course List for Student

#include<cstdio>#include<iostream>#include<algorithm>#include<vector>#include<queue>#include<string>#include<cstring>#include<cmath>#include<map>#include<stack>#define ll long longusing namespace std;const int mx = 26*26*26*10;vector<int>v[26*26*26*10];int main(){int n,m,i,j,k,id,cnt;char name[5];while(scanf("%d%d",&n,&m)!=EOF){cnt = 0;for(i = 1;i<=m;i++){scanf("%d%d",&id,&k);for(j = 1;j<=k;j++){scanf("%s",name);int ss = (name[0]-'A')*26*26*10+(name[1]-'A')*26*10+(name[2]-'A')*10+name[3]-'0';v[ss].push_back(id);}}for(i = 0;i<mx;i++)if(v[i].size())sort(v[i].begin(),v[i].end());for(i = 1;i<=n;i++){scanf("%s",name);printf("%s ",name);int x = (name[0]-'A')*26*26*10+(name[1]-'A')*26*10+(name[2]-'A')*10+name[3]-'0';printf("%d",v[x].size());for(j = 0;j<v[x].size();j++)printf(" %d",v[x][j]);printf("\n");}}    return 0;}