1047 Student List for Course

1047 Student List for Course (25 point(s))

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

此题属于常规题。最开始的思路是用一个结构体存储每个学生的信息，包括姓名和所选课程，其中所选课程用一个bool mark[]来记录。果不其然，case#3会出现内存超限MLE。

上述思路无非是保存一个学生-课程表，最大情况下是40000*2500，修改思路是将数组二维表改为双重vector<vector<int> >v(n+1)，其中vector<i>对应的是第i门课程的学生序号表。输出的时候，对于每一门课程，根据序号所对应的姓名，对v[i]中的序号进行排序（这点最开始没有想到）。

MLE总结：1. 对于稀疏矩阵，采用vector替代二维数组（如本题）。

参考链接：https://www.jianshu.com/p/28e3c22b64b6

#include<iostream>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
char name[40010][5];
bool cmp(int a,int b){//NEW 根据序号对应的姓名字符串，对序号进行排序 
    if(strcmp(name[a],name[b])<0) return true;
    else return false;
}
int main(){
    int n,k;
    scanf("%d %d",&n,&k);
    vector<vector<int> > v(n+1);
    for(int i=0;i<n;i++){
        scanf("%s",name[i]);                
        int cnt;
        scanf("%d",&cnt);
        for(int j=0;j<cnt;j++){
            int k;
            scanf("%d",&k);
            v[k].push_back(i);
        }
    }
    for(int i=1;i<=k;i++){
        printf("%d %d\n",i,(int)v[i].size());
        sort(v[i].begin(),v[i].end(),cmp);//对记录选课学生序号的vector排序 
		for(int j=0;j<v[i].size();j++) {
            printf("%s\n",name[v[i][j]]);
        }
    }
    return 0;
}