【PAT甲级】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

题意：给定每个学生注册的课程列表，输出所有课程列表的学生列表。

思路：遍历所有课程，以课程号为下标，对学生名进行排序

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <sstream>
#include <algorithm>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define mem(a,n) memset(a,n,sizeof(a))
#define lowbit(i) ((i)&(-i))
typedef long long ll;
typedef unsigned long long ull;
const ll INF=0x3f3f3f3f;
const int N = 4e4+5;

string name[N];
vector<int>vec[2505];
bool cmp(int a,int b) {
    return name[a]<name[b];
}
int main() {
    int n,k;
    int courses,course_i;
    scanf("%d%d",&n,&k);
    for(int i=0; i<n; i++) {
        cin>>name[i];
        scanf("%d",&courses);
        for(int j=0; j<courses; j++) {
            scanf("%d",&course_i);
            vec[course_i].push_back(i);
        }
    }
    for(course_i=1; course_i<=k; course_i++) {
        printf("%d %d\n",course_i,vec[course_i].size());
        sort(vec[course_i].begin(),vec[course_i].end(),cmp);
        for(vector<int>::iterator it=vec[course_i].begin(); it!=vec[course_i].end(); it++) {
            printf("%s\n",name[*it].c_str());
        }
    }
    return 0;
}