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 (≤40,000), the number of students who look for their course lists, and K (≤2,500), 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
分析: 考虑到极限情况下内存很可能不够,因此将姓名通过字符串哈希算法映射成一个整数,由于只有3位大写英文字母,最大的数也就1万多,整型足够。
/*
为每个学生维护一个set,存储其选修的课程号
总的数据结构为map<int, set<int> > map的key为学生姓名的hash值,value为选秀课程号
*/
#include <cstdio>
#include <map>
#include <set>
using namespace std;
/*
将题目中姓名通过hash映射成一个整数
*/
int strHash(char in[])
{
int hashcode = 0;
for(int i = 0; i < 3; i++)
hashcode = hashcode * 26 + (in[i] - 'A');
hashcode = hashcode * 10 + (in[3] - '0');
return hashcode;
}
int main()
{
int n; //需要查询的学生数
int k; //课程总数
map<int, set<int> > data; //学生->选修课程
scanf("%d%d", &n, &k);
for(int i = 0; i < k; i++)
{
int index; // 课程编号
int num; //选秀该课程的学生数
char stu[5];
scanf("%d%d", &index, &num);
for(int j = 0; j < num; j++)
{
scanf("%s", stu);
int code = strHash(stu); //得到学生姓名的hash值
data[code].insert(index);
}
}
// 输入待查询的学生的名字
for(int i = 0; i < n; i++)
{
char stu[5];
scanf("%s", stu);
int code = strHash(stu);
printf("%s", stu); //输出学生姓名
if(data.find(code) == data.end())
printf(" 0");
else
{
printf(" %d", data[code].size());
auto it = data[code].begin();
while(it != data[code].end())
{
printf(" %d", *it);
it++;
}
}
printf("\n");
}
return 0;
}