1039 Course List for Student (25 分) unorder_set数组会超时

1039 Course List for Student (25 分)

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 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

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

最开始使用unordered_set，另外别用hash_set不支持string，并且已经被unordered_set代替了，每个课程一个set<string> 保存所选课程的学生名字， 结果最后一个测试点超时。我猜测是每个同学都需要对所有的set进行一次find，所以会很耗时。最后AC是使用unordered_map<一个学生姓名，该学生选择课程的列表>，

#include <iostream>
#include <algorithm>
#include <vector>
#include <hash_set>
#include <set>
#include <queue>
#include <unordered_map>
#include <climits>
#include <hash_map>
#include <cstdlib>
#include <unordered_set>

using namespace std;



int main()
{
    int n,k;
    scanf("%d %d",&n,&k);

    unordered_map<string,vector<int>> mapp;
    for(int i=0; i<k; i++)
    {
        int index,stuNum;
        scanf("%d %d",&index,&stuNum);

        for(int m=0; m<stuNum; m++)
        {
            string name;
            name.resize(4);
            scanf("%s",&name[0]);
            mapp[name].push_back(index);
            //mapp[index].insert(name);
        }
    }
    for(int i=0; i<n; i++)
    {
        string name;
        name.resize(4);
        scanf("%s",&name[0]);
        printf("%s",name.c_str());

        if(mapp[name].size()==0)
            printf(" 0");

        else
        {
            sort(mapp[name].begin(),mapp[name].end());
            printf(" %d",mapp[name].size());

            for(int i=0; i<mapp[name].size(); i++)
            {
                printf(" %d",mapp[name][i]);

            }
        }
        printf("\n");
    }
    return 0;
}