算法笔记-问题 B: Student List for Course (25)

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了算法笔记-问题 B: Student List for Course (25)，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1976字，纯文字阅读大概需要3分钟。

内容图文

问题 B: Student List for Course (25)

题目描述

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.

样例输入 Copy

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

样例输出 Copy

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 <bits/stdc++.h>

using namespace std;

int main(){
    int k, n;
    scanf("%d %d", &k, &n);
    vector<vector<string> >selectStudent(n+1);
    vector<string> List;
    for(int i=0; i<=k; i++){
        string record;
        getline(cin, record);
        string temp = record.substr(0, 4);
        for(int j=record.length()-1; j>5; j--){
            if(record[j]>='0'&&record[j]<='9')
                selectStudent[record[j]-'0'].push_back(temp);
        }
        cin.clear();
        cin.sync();
    }
    for(int i=1; i<=n; i++){
        printf("%d %d\n", i, selectStudent[i].size());
        sort(selectStudent[i].begin(), selectStudent[i].end());
        for(int j=0; j<selectStudent[i].size(); j++){
            printf("%s\n", selectStudent[i][j].c_str());
        }
    }
    return 0;
}

 

内容总结

以上是互联网集市为您收集整理的算法笔记-问题 B: Student List for Course (25)全部内容，希望文章能够帮你解决算法笔记-问题 B: Student List for Course (25)所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端

---