6117 Problem B Student List for Course (25)

最新推荐文章于 2020-07-05 16:49:45 发布

原创最新推荐文章于 2020-07-05 16:49:45 发布 · 313 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#codeup #6117

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

421 篇文章

订阅专栏

389 篇文章

订阅专栏

codeup

144 篇文章

订阅专栏

本文介绍了一个C++程序，用于处理浙江大学学生课程注册信息，并按课程编号输出每门课程的学生名单。程序读取学生的姓名、注册课程数量及课程编号，然后整理并输出各课程的学生列表。

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

问题 B: Student List for Course (25)
时间限制: 1 Sec 内存限制: 64 MB
献花: 32 解决: 25
[献花][花圈][TK题库]
题目描述
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.
输入
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.
输出
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.
样例输入
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
样例输出
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

#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;
    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;
}
/**************************************************************
    Problem: 6117
    User: Sharwen
    Language: C++
    Result: 升仙
    Time:1 ms
    Memory:1720 kb
****************************************************************/