1047. Student List for Course (25)
来源:互联网 发布:淘宝买家秀卖家秀搞笑 编辑:程序博客网 时间:2024/05/23 13:58
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<cstdio>#include<cstring>#include<algorithm>#include<vector>using namespace std;const int maxn=40010;const int maxk=2510;char name[maxn][10];//name[i]表示编号为i学生(i=0,1,2,3....) vector<int> registeredStu[maxk];//registeredStu[i]代表对于课程i,所注册的学生编号组成的可变长数组 bool cmp(int a,int b){//排序时,用字符串的下表代替字符串本身进行排序 return strcmp(name[a],name[b])<0;}int main(){ int n,k; scanf("%d %d",&n,&k); for(int i=0;i<n;i++){ int num; scanf("%s %d",name[i],&num); for(int j=0;j<num;j++){ int c_id; scanf("%d",&c_id); registeredStu[c_id].push_back(i); } } for(int c_id=1;c_id<=k;c_id++){ sort(registeredStu[c_id].begin(),registeredStu[c_id].end(),cmp); int size=registeredStu[c_id].size(); printf("%d %d\n",c_id,size); for(int j=0;j<size;j++){ int id=registeredStu[c_id][j]; printf("%s\n",name[id]); } } return 0;}
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)-PAT
- 1047. Student List for Course (25)
- 【PAT】1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- PAT 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- PAT 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- Collection,List,Set和Map用法和区别
- 创意网页收藏
- Java多线程-生产者和消费者
- 一定时间内连续点击只有最后一次点击进行ajax提交
- 自定义view实战笔记--饼图demo
- 1047. Student List for Course (25)
- Android LinearLayout布局
- 认真点,带你全面了解xutils3
- VirtualBox 突然启动报错的解决办法
- android 使用WebView获得加载网页的html代码
- Hibernate相对于Mybatis的缺陷
- Nodejs心跳包(一)简易监控 --学习笔记
- 【CSS3】右上角倾斜文字
- sql分页查询