Zhejiang University has 40000 students and provides 2500 courses. Now given the student name lists of all the courses, you are supposed to output the registered course list for each student who comes for a query.
Input Specification:
Each input file contains one test case. For each case, the first line contains 2 positive integers: N (<=40000), the number of students who look for their course lists, and K (<=2500), the total number of courses. Then the student name lists are given for the courses (numbered from 1 to K) in the following format: for each course i, first the course index i and the number of registered students Ni (<= 200) are given in a line. Then in the next line, Ni student names are given. A student name consists of 3 capital English letters plus a one-digit number. Finally the last line contains the N names of students who come for a query. All the names and numbers in a line are separated by a space.
Output Specification:
For each test case, print your results in N lines. Each line corresponds to one student, in the following format: first print the student's name, then the total number of registered courses of that student, and finally the indices of the courses in increasing order. The query results must be printed in the same order as input. All the data in a line must be separated by a space, with no extra space at the end of the line.
Sample Input:
11 5
4 7
BOB5 DON2 FRA8 JAY9 KAT3 LOR6 ZOE1
1 4
ANN0 BOB5 JAY9 LOR6
2 7
ANN0 BOB5 FRA8 JAY9 JOE4 KAT3 LOR6
3 1
BOB5
5 9
AMY7 ANN0 BOB5 DON2 FRA8 JAY9 KAT3 LOR6 ZOE1
ZOE1 ANN0 BOB5 JOE4 JAY9 FRA8 DON2 AMY7 KAT3 LOR6 NON9
Sample Output:
ZOE1 2 4 5
ANN0 3 1 2 5
BOB5 5 1 2 3 4 5
JOE4 1 2
JAY9 4 1 2 4 5
FRA8 3 2 4 5
DON2 2 4 5
AMY7 1 5
KAT3 3 2 4 5
LOR6 4 1 2 4 5
NON9 0
分析
这道题蛮好玩的，一开始然后用map,set妄图跳过hash，几行代码写完了，自信的提交，最后一个点超时，然后规规矩矩的用hash散列，有可能是我的散列函数设计的太垃圾了，依旧超时；后来就好奇看了一位大神的，结果也是散列，但她开了很大的空间，以空间换取了时间，省去了许多探测的时间，从她的代码中学到了很多；
#include<iostream>
#include<set>
using namespace std;
const int maxn=26*26*26*10+10;
int getid(char *name){
int sum=0;
for(int i=0;i<3;i++)
sum=sum*26+(name[i]-'A');
sum=sum*10+(name[3]-'0');
return sum;
}
set<int> data[maxn];
int main(){
int n,k,course,num;
scanf("%d %d",&n,&k);
char name[4];
for(int i=0;i<k;i++){
scanf("%d %d",&course,&num);
for(int j=0;j<num;j++){
scanf("%s",name);
int t=getid(name);
data[t].insert(course);
}
}
for(int i=0;i<n;i++){
scanf("%s",name);
int t=getid(name);
printf("%s %d",name,data[t].size());
for(auto it=data[t].begin();it!=data[t].end();it++)
printf(" %d",*it);
printf("\n");
}
return 0;
}