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 N~i~ (<= 200) are given in a line. Then in the next line, N~i~ 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
解答:刚开始,我使用map<string, set<int>>的数据结构来存储数据,但是运行时间超时,不得不简化,使用比较简单的vector<vector<int> > 来存储数据。对于姓名,可以用哈希映射成整数,对应于vector的下标。这样就可以用空间换时间了,降低了时间开销。
#include<iostream>
#include<map>
#include<vector>
#include<set>
#include<string>
#include<algorithm>
using namespace std;
int HashName(char stuName[]);
const int maxNum = 26 * 26 * 26 * 10 + 1;
int main()
{
vector<vector<int> > students(maxNum);
int stuNum, couNum;
cin >> stuNum >> couNum;
for(int i = 0; i < couNum; ++i)
{
int courseN, studentN;
char stuName[5];
cin >> courseN >> studentN;
for(int j = 0; j < studentN; ++j)
{
scanf("%s", stuName);
students[HashName(stuName)].push_back(courseN);
}
}
//输入查询的学生姓名
for(int i = 0; i < stuNum; ++i)
{
char name[5];
scanf("%s", name);
if( students[HashName(name)].size() == 0 )
{
printf("%s 0\n", name);
}
else
{
printf("%s %d", name, students[HashName(name)].size());
sort(students[HashName(name)].begin(), students[HashName(name)].end());
for(vector<int>::iterator iter = students[HashName(name)].begin(); iter != students[HashName(name)].end(); ++iter)
{
printf(" %d", *iter);
}
printf("\n");
}
}
return 0;
}
int HashName(char stuName[])
{
return ( (stuName[0] - 'A') * 26 * 26 * 10
+ (stuName[1] - 'A') * 26 * 10
+ (stuName[2] - 'A') * 10
+ (stuName[3] - '0') );
}