1047 Student List for Course (25 分)

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

题目大意:给出学生总数和课程总数,输入是学生姓名+报名课程编号(从1开始);要求输出课程编号,课程报名总人数和学生姓名。

//感觉不难,在牛客网上通过了,但是在PAT上测试点1没通过,得了22分,以下:

#include <iostream>
#include <map>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n,m,k;
cin>>n>>m;
map<int,vector<string>> mp;
string name;
for(int i=;i<n;i++){
cin>>name>>k;
int temp;
for(int j=;j<k;j++){
cin>>temp;
mp[temp].push_back(name);//可以直接这样放进去的。
}
}
for(auto it=mp.begin();it!=mp.end();it++){
vector<string> name=it->second;
cout<<it->first<<" "<<name.size()<<"\n";
sort(name.begin(),name.end());
for(int i=;i<name.size();i++){
cout<<name[i]<<'\n';
}
}
return ;
}

//真的不知道是哪里出错了,就先这样吧,不是超时的问题,搜索中发现,以前的运行时间限制分别是200s,400s,现在已经到了1s,所以使用String也是没问题的。

//知道了,是对于没人选的课,应该输出课程编号和0,但是我什么都没输出:

因为我是用map做的啊,它根本映射不到,所以所以这种做法是错误的,牛客网上的用也太水了吧。

#include <iostream>
#include <map>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n,m,k;
cin>>n>>m;
map<int,vector<string>> mp;
string name;
for(int i=;i<n;i++){
cin>>name>>k;
int temp;
for(int j=;j<k;j++){
cin>>temp;
mp[temp].push_back(name);//可以直接这样放进去的。
}
}
//来个检测
for(int i=;i<=m;i++){
if(mp.count(i)==){
vector<string> vt;
mp[i]=vt;//让它等于一个空向量
}
} for(auto it=mp.begin();it!=mp.end();it++){
vector<string> name=it->second;
cout<<it->first<<" "<<name.size()<<"\n";
sort(name.begin(),name.end());
for(int i=;i<name.size();i++){
cout<<name[i]<<'\n';
}
}
return ;
}

//加了个检测,AC了,但总感觉这样很。。。不要Face。。

PAT 1047 Student List for Course[一般]的更多相关文章

  1. PAT 1047. Student List for Course

    Zhejiang University has 40000 students and provides 2500 courses. Now given the registered course li ...

  2. PAT 解题报告 1047. Student List for Course (25)

    1047. Student List for Course (25) Zhejiang University has 40000 students and provides 2500 courses. ...

  3. PAT 甲级 1047 Student List for Course (25 分)(cout超时,string scanf printf注意点,字符串哈希反哈希)

    1047 Student List for Course (25 分)   Zhejiang University has 40,000 students and provides 2,500 cou ...

  4. 1047 Student List for Course ——PAT甲级真题

    1047 Student List for Course Zhejiang University has 40,000 students and provides 2,500 courses. Now ...

  5. 浙大 pat 1047题解

    1047. Student List for Course (25) 时间限制 400 ms 内存限制 64000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Y ...

  6. PAT 甲级 1047 Student List for Course

    https://pintia.cn/problem-sets/994805342720868352/problems/994805433955368960 Zhejiang University ha ...

  7. PAT (Advanced Level) 1047. Student List for Course (25)

    简单题. #include<iostream> #include<cstring> #include<cmath> #include<algorithm> ...

  8. PAT甲级题解-1047. Student List for Course (25)-排序

    一开始是建立了course[2501][40001]数组,存储每节课的学生编号然后for循环两层输出,但这样复杂度为O(2500*40000),也很明显导致最后时间超时后来发现最多40000学生,每个 ...

  9. 【PAT甲级】1047 Student List for Course (25 分)

    题意: 输入两个正整数N和K(N<=40000,K<=2500),接下来输入N行,每行包括一个学生的名字和所选课程的门数,接着输入每门所选课程的序号.输出每门课程有多少学生选择并按字典序输 ...

随机推荐

  1. openssl之BIO系列之18---接受(accept)类型BIO

    接受(accept)类型BIO ---依据openssl doc\crypto\bio_s_accept.pod翻译和自己的理解写成 (作者:DragonKing, Mail: wzhah@263.n ...

  2. PHP——做服务

    xml的写法和特点 <?xml version='1.0' encoding='utf-8'?><Info><code>c001</code><n ...

  3. 架构探险——第三章(搭建轻量级Java Web框架)

    解决的问题 servlet的数量会随业务功能的扩展而不断增加,我们有必要减少servlet的数量,交给controller处理,它负责调用service的相关方法,并将返回值放入request或res ...

  4. CAP定理(原则)以及BASE理论

    CAP定理(原则)以及BASE理论 CAP定理(原则)概念 CAP原则又称CAP定理,指的是在一个分布式系统中, Consistency(一致性). Availability(可用性).Partiti ...

  5. Tuning 05 Sizing other SGA Structure

    Redo Log Buffer Content The Oracle server processes copy redo entries from the user’s memory space t ...

  6. Reducing the Dimensionality of Data with Neural Networks

    ****************内容加密中********************

  7. Hibernate中:不看数据库,不看XML文件,不看查询语句,怎么样能知道表结构?

    Hibernate中:不看数据库,不看XML文件,不看查询语句,怎么样能知道表结构? 解答:可以看与XML文件对应的域模型.

  8. SQLServerException:通过端口 1433 连接到主机 localhost 的 TCP/IP 连接失败。

    一.问题描述: 1.连接数据库时抛出的异常: com.microsoft.sqlserver.jdbc.SQLServerException: 通过端口 1433 连接到主机 localhost 的 ...

  9. php程序员网址大全

    网址:http://www.tnten.com/ 常用网址 慕课网 知乎 GitHub CSDN社区 博客园 51CTO 开源中国 IT之家 简明魔法 编程论坛 InfoQ 实验楼 Unix技术网 中 ...

  10. db2 sql

    import from empty.del of replace into table_name