PAT 1047 Student List for Course[一般]
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[一般]的更多相关文章
- PAT 1047. Student List for Course
Zhejiang University has 40000 students and provides 2500 courses. Now given the registered course li ...
- PAT 解题报告 1047. Student List for Course (25)
1047. Student List for Course (25) Zhejiang University has 40000 students and provides 2500 courses. ...
- 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 ...
- 1047 Student List for Course ——PAT甲级真题
1047 Student List for Course Zhejiang University has 40,000 students and provides 2,500 courses. Now ...
- 浙大 pat 1047题解
1047. Student List for Course (25) 时间限制 400 ms 内存限制 64000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Y ...
- PAT 甲级 1047 Student List for Course
https://pintia.cn/problem-sets/994805342720868352/problems/994805433955368960 Zhejiang University ha ...
- PAT (Advanced Level) 1047. Student List for Course (25)
简单题. #include<iostream> #include<cstring> #include<cmath> #include<algorithm> ...
- PAT甲级题解-1047. Student List for Course (25)-排序
一开始是建立了course[2501][40001]数组,存储每节课的学生编号然后for循环两层输出,但这样复杂度为O(2500*40000),也很明显导致最后时间超时后来发现最多40000学生,每个 ...
- 【PAT甲级】1047 Student List for Course (25 分)
题意: 输入两个正整数N和K(N<=40000,K<=2500),接下来输入N行,每行包括一个学生的名字和所选课程的门数,接着输入每门所选课程的序号.输出每门课程有多少学生选择并按字典序输 ...
随机推荐
- android怎样写一个自己定义的dialog能够在Title的位置弹出来
先上效果图: Title的Layout为: <RelativeLayout xmlns:android="http://schemas.android.com/apk/res/andr ...
- 球队以及得分计算的SQL语句
首先题目是这样的: 球队表teams 比赛表matches 赢了得3分,平局的得1分,输了得0分. 思路: 一个球队的成绩分为两部分,作为主队的得分和作为客队的得分: 计算出一次比赛中具体得了多少分, ...
- [转]用了docker是否还有必要使用openstack?
从一项颠覆性的技术成果转化并衍生出一整套社区体系,Docker在发展速度上打破了一个又一个历史纪录.然而,Docker项目在采纳与普及方面表现出惊人态势的同时,也给我们带来了一系列疑问与困惑. 在今天 ...
- [复习] JAVA 遍历目录 (递归调用和非递归)
JAVA 遍历文件夹下的所有文件(递归调用和非递归调用) 1.不使用递归的方法调用. public void traverseFolder1(String path) { int fileNum = ...
- 参考 generate-parentheses
分析: 关键:当前位置左括号不少于右括号 图是什么? 节点:目前位置左括号和右括号数(x,y)(x>=y) 边:从(x,y)到(x+1,y)和(x,y+1) ...
- C# Dictionary学习
http://www.cnblogs.com/gdjlc/archive/2010/01/22/2086922.html http://wenku.baidu.com/link?url=TOgeedl ...
- Hourrank 21 Tree Isomorphism 树hash
https://www.hackerrank.com/contests/hourrank-21/challenges/tree-isomorphism 题目大意: 给出一棵树, 求有多少本质不同的子树 ...
- ie tbody table 兼容方法
IE6-IE9中tbody的innerHTML不能赋值,重现代码如下 Js代码 ? 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 2 ...
- (转)Unity笔记之编辑器(CurveField、DoubleField、EnumMaskField、EnumPopup) ... ...
1. CurveField创建的是一个类型为AnimationCurve的曲线变量,看代码: [code]csharpcode: using UnityEngine; using System.Col ...
- java关键字及含义
http://blog.csdn.net/hfmbook/article/details/7634385