1047 Student List for Course (25 分)

1047 Student List for Course (25 分)

Zhejiang University has 40,000 students and provides 2,500 courses. Now given the registered course list of each student, you are supposed to output the student name lists of all the courses.
Input Specification:

Each input file contains one test case. For each case, the first line contains 2 numbers: N (≤40,000), the total number of students, and K (≤2,500), the total number of courses. Then N lines follow, each contains a student’s name (3 capital English letters plus a one-digit number), a positive number C (≤20) which is the number of courses that this student has registered, and then followed by C course numbers. For the sake of simplicity, the courses are numbered from 1 to K.
Output Specification:

For each test case, print the student name lists of all the courses in increasing order of the course numbers. For each course, first print in one line the course number and the number of registered students, separated by a space. Then output the students’ names in alphabetical order. Each name occupies a line.

Sample Input:

10 5
ZOE1 2 4 5
ANN0 3 5 2 1
BOB5 5 3 4 2 1 5
JOE4 1 2
JAY9 4 1 2 5 4
FRA8 3 4 2 5
DON2 2 4 5
AMY7 1 5
KAT3 3 5 4 2
LOR6 4 2 4 1 5

Sample Output:

1 4
ANN0
BOB5
JAY9
LOR6
2 7
ANN0
BOB5
FRA8
JAY9
JOE4
KAT3
LOR6
3 1
BOB5
4 7
BOB5
DON2
FRA8
JAY9
KAT3
LOR6
ZOE1
5 9
AMY7
ANN0
BOB5
DON2
FRA8
JAY9
KAT3
LOR6
ZOE1

解题思路

1. 一开始还想着先将字符串哈希成int，再把int转换成字符串。。结果是没写出来放弃了
2. 确实没想到vector<string>可以直接过~
3. 注意最后的cout会超时，用printf输出能解决这个问题
   printf("%s\n",c[i][j].c_str());
4. 注意题目条件：课程从1~K编号，故无需使用map等映射，直接使用vector遍历即可
5. 此题和1039是同类题，由此想到1039题能否用map<string,set<int> >实现，而超时的部分只是由cin/cout引起的呢？经过测试验证，超时仍是string类型的构造花费时间过长造成的，因此1039题必须使用哈希才能避免超时。而此题可以使用vector和string，但不能用cout输出。

code

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

vector<string> c[2505];

int main()
{
    int n,k,id,m;
    string name;
    scanf("%d%d",&n,&k);
    for(int i = 0; i < n; ++i){
        cin >> name >> m;
        for(int j = 0; j < m; ++j){
            scanf("%d",&id);
            c[id].push_back(name);//编号为id的课程有name选了
        }
    }
    for(int i = 1; i <= k; ++i){//课从1编号，且编号一定是1~K
        printf("%d %d\n",i,c[i].size());
        sort(c[i].begin(),c[i].end());
        for(int j = 0; j < c[i].size(); ++j){
            //cout << c[i][j] << endl;//超时
            printf("%s\n",c[i][j].c_str());
        }
    }
    return 0;
}