1047. Student List for Course (25)

Zhejiang University has 40000 students and provides 2500 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 (<=40000), the total number of students, and K (<=2500), 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 5ZOE1 2 4 5ANN0 3 5 2 1BOB5 5 3 4 2 1 5JOE4 1 2JAY9 4 1 2 5 4FRA8 3 4 2 5DON2 2 4 5AMY7 1 5KAT3 3 5 4 2LOR6 4 2 4 1 5

Sample Output:

1 4ANN0BOB5JAY9LOR62 7ANN0BOB5FRA8JAY9JOE4KAT3LOR63 1BOB54 7BOB5DON2FRA8JAY9KAT3LOR6ZOE15 9AMY7ANN0BOB5DON2FRA8JAY9KAT3LOR6ZOE1

http://pat.zju.edu.cn/contests/pat-a-practise/1047

题意
根据每名学生填报的课程，按顺序输出每门课程的学生名单。其中学生总量为 N(<=40000)，课程总量为 K(<=2500)。学生姓名为 3 个大写英文字符加一个数字。
分析
倒排索引的模拟。可以针对学生姓名做 hash 方式的优化。
#include<iostream>#include<vector>#include<string.h>#include<algorithm>typedef struct Student {char name[20];}Student;std::vector<Student> sVec;bool cmp(int s1, int s2){return strcmp(sVec[s1].name, sVec[s2].name) < 0;}int main(){int s, c;while(scanf("%d%d",&s,&c)!=EOF){std::vector<std::vector<int>> cVec(c);sVec.resize(s);//input for(int i = 0; i < s; ++i){int k;scanf("%s %d",sVec[i].name, &k);while(k--){int cid;scanf("%d",&cid);cVec[cid-1].push_back(i);}}//sort and outputfor(int i = 0; i < (int)cVec.size(); ++i){printf("%d %d\n",i+1, (int)cVec[i].size());std::sort(cVec[i].begin(), cVec[i].end(), cmp);for(int j = 0; j < (int)cVec[i].size(); ++j){printf("%s\n",sVec[cVec[i][j]].name);}}}return 0;}