-
Notifications
You must be signed in to change notification settings - Fork 0
/
1039.cpp
50 lines (47 loc) · 1.16 KB
/
1039.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
//const int N = 40004;
const int K = 2501;
const int M = 26*26*26*10;
//bool hash[M][K];
int str2num(char*str){
return (str[0]-'A')*26*26*10+(str[1]-'A')*26*10+(str[2]-'A')*10+(str[3]-'0');
}
int main(){
int n,k;
scanf("%d%d",&n,&k);
vector<vector<int>> stu(M+1);
for(int i=0;i<k;i++){
int cid,num;
scanf("%d%d",&cid,&num);
for(int j=0;j<num;j++){
char tstr[5];
scanf("%s",tstr);
//hash[str2num(tstr)][cid]=1;
stu[str2num(tstr)].push_back(cid);
}
}
for(int i=0;i<n;i++){
char tstr[5];
scanf("%s",tstr);
//printf("%s ",tstr);
int cnt=0;
int tnum=str2num(tstr);
vector<int>::iterator iter_vec;
//for(iter_vec=stu[str2num(tstr)].begin();iter_vec!=stu[str2num(tstr)].end();iter_vec++)
// if(stu[str2num(tstr)].size()!=0)
// cnt++;
printf("%s %d",tstr,stu[str2num(tstr)].size());
sort(stu[str2num(tstr)].begin(),stu[str2num(tstr)].end());
for(iter_vec=stu[str2num(tstr)].begin();iter_vec!=stu[str2num(tstr)].end();iter_vec++)
printf(" %d",*iter_vec);
printf("\n");
}
system("PAUSE");
return 0;
}