1047. Student List for Course (25)

最新推荐文章于 2022-02-16 14:52:49 发布

原创最新推荐文章于 2022-02-16 14:52:49 发布 · 206 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#pat甲级 #1047

C/C++ 同时被 3 个专栏收录

421 篇文章

订阅专栏

389 篇文章

订阅专栏

pat甲级

140 篇文章

订阅专栏

本文介绍了一个简单的课程注册系统的实现过程，该系统能够处理大量学生和课程的数据，通过输入学生的选课信息，输出每门课程的学生名单。使用C++语言进行编程，并特别注意了输入输出的效率问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 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

注意点：

使用c++的输入输出的话，一定要关同步，std::ios::sync_with_stdio(false); 不然最后一个测试点跑不过

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstring>
#include <string>

using namespace std;
const int MaxN = 2510;

bool cmp(string a, string b)
{
    return a < b;
}

int main()
{
#ifdef _DEBUG
    freopen("data.txt", "r+", stdin);
#endif // _DEBUG

    int N, K, C, tmp;
    vector<string> course[MaxN];
    string name;

    std::ios::sync_with_stdio(false);
    while (cin >> N >> K)
    {
        while (N--)
        {
            cin >> name >> C;
            for (int i = 0; i < C; ++i)
            {
                cin >> tmp;
                course[tmp].push_back(name);
            }
        }

        for (int i = 1; i <= K; ++i)
        {
            printf("%d %d\n", i, course[i].size());
            sort(course[i].begin(), course[i].end(), cmp);
            for (vector<string>::iterator it = course[i].begin(); it != course[i].end(); ++it)
                printf("%s\n", (*it).c_str());
        }
    }
    return 0;
}