1047 Student List for Course

三块不一样的石头

于 2022-11-12 20:33:00 发布

阅读量123

点赞数

分类专栏： PAT (Advanced Level) Practice 文章标签：算法 c++

本文链接：https://blog.csdn.net/daybreak_alonely/article/details/127825000

版权

PAT (Advanced Level) Practice 专栏收录该内容

59 篇文章 1 订阅

订阅专栏

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

题目大意

给你N个学生的姓名，以及该学生有选报的课程编号

求每个课程所报学生的数量，并将所报学生姓名，按字符串大小升序输出

思路

这题我直接用string好像超时了，那就用数字映射字符串就行了

C/C++

#include<bits/stdc++.h>
using namespace std;
char name[40001][5];
vector<int> course[2501];
int N,M,K,num;
bool cmp(int x,int y){
    return strcmp(name[x],name[y]) < 0;
}
int main()
{
    cin >> N >> M;
    for(int z=0;z<N;z++){
        scanf("%s",&name[z]);
        cin >> K;
        while (K--){
            cin >> num;
            course[num].push_back(z);
        }
    }

    for(int z=1;z<=M;z++){
        sort(course[z].begin(),course[z].end(),cmp);
        printf("%d %d\n",z,course[z].size());
        for(int x:course[z]) printf("%s\n",name[x]);
    }

    return 0;
}