当前位置: 代码迷 >> 综合 >> PAT甲级-1047 Student List for Course (25分)
  详细解决方案

PAT甲级-1047 Student List for Course (25分)

热度:110   发布时间:2023-09-26 23:26:19.0

点击链接PAT甲级-AC全解汇总

题目:
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

题意:
按照学生:课程号输入,按照课程号:学生输出

一开始用的set,因为每次插入都会排序所以会超时,用vector,最后再排序就不会超时了。为了不超时还用了printf

我的代码:

#include<bits/stdc++.h>
using namespace std;int main(){
    int N,K;cin>>N>>K;vector<string>course_stu[K+1];for(int i=0;i<N;i++){
    string name;int n;cin>>name>>n;for(int j=0;j<n;j++){
    int course;cin>>course;course_stu[course].push_back(name);}}for(int i=1;i<=K;i++){
    printf("%d %d\n",i,course_stu[i].size());sort(course_stu[i].begin(),course_stu[i].end());for(auto it:course_stu[i])printf("%s\n",it.c_str());}return 0;
}
  相关解决方案