1047. Student List for Course (25)

来源:互联网 发布:家谱制作软件 编辑:程序博客网 时间:2024/05/11 15:43

1047. Student List for Course (25)

时间限制
400 ms
内存限制
64000 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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
没什么好说的,主要是这道题用cin,cout会超时
#include <iostream>#include <vector>#include <cstring>#include <iterator>#include <algorithm>using namespace std;bool cmp(char *a, char *b){return strcmp(a,b) < 0;}int main(){vector<vector<char*>> all;int m,k,count, temp;char name[40001][5];scanf("%d %d",&m,&k);all.resize(2501);for(int i=0;i<m;i++){scanf("%s %d",name[i], &count);while(count--){scanf("%d",&temp);all[temp].push_back(name[i]);}}for(int i=1;i<=k;i++){printf("%d %d\n",i,all[i].size());sort(all[i].begin(),all[i].end(),cmp);for(vector<char*>::iterator it= all[i].begin();it != all[i].end(); it++){printf("%s\n",*it);}}return 0;}


0 0