PAT甲级1047. Student List for Course (25)
来源:互联网 发布:一键复制淘宝店铺 编辑:程序博客网 时间:2024/05/07 04:52
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
#include <vector>#include <cstring> #include <algorithm>#include <cstdio>using namespace std;char name[40001][5];bool compare(int x,int y){ return strcmp(name[x],name[y])<0;}int main(){ int N,K; scanf("%d%d",&N,&K); vector<vector<int> > List(K+1); for(int i=0;i<N;i++){ int C; scanf("%s%d",name[i],&C); for(int j=0;j<C;j++){ int course; scanf("%d",&course); List[course].push_back(i); } } for(int i=1;i<=K;i++){ sort(List[i].begin(),List[i].end(),compare); printf("%d %d\n",i,List[i].size()); for(int j=0;j<List[i].size();j++){ printf("%s\n",name[List[i][j]]); } } return 0;}
- 1047. Student List for Course (25)-PAT甲级真题
- 【PAT甲级】1047. Student List for Course (25)
- 1047. Student List for Course (25)PAT甲级
- PAT甲级练习1047. Student List for Course (25)
- PAT甲级1047. Student List for Course (25)
- PAT 甲级 1047. Student List for Course (25)
- PAT甲级 1047. Student List for Course (25)
- 1039. Course List for Student (25)-PAT甲级真题
- 【PAT甲级】1039. Course List for Student (25)
- 1039. Course List for Student (25)PAT甲级
- PAT甲级练习1039. Course List for Student (25)
- PAT甲级1039. Course List for Student (25)
- PAT 甲级 1039. Course List for Student (25)
- 1039. Course List for Student (25)-PAT甲级真题
- 1047. Student List for Course (25)-PAT
- 【PAT】1047. Student List for Course (25)
- PAT 1047. Student List for Course (25)
- PAT 1047. Student List for Course (25)
- Unity3D之Android加密DLL与破解DLL
- New Year Permutation
- PHP常用文件操作
- bitmap 变圆角
- Java I/O流与序列化
- PAT甲级1047. Student List for Course (25)
- C++之“栈”
- Javascript 小功能收集
- Oracle数据库的冷备份与恢复
- 这一年
- CSS3 Word-wrap、word-break、white-space
- 制作竖直导航菜单
- Android之ViewPager笔记(一)
- leetcode D1 Hamming Distance