PAT 1047. Student List for Course (25)
2015-08-19 14:34
375 查看
1047. Student List for Course (25)
时间限制400 ms
内存限制
64000 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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
这道题和1039是一样的,只是形式上有点不一样而已。要注意的是不能用string,小心运行超时。由于题目把人名规范过,因此只要哈希一下就可以了。这道题就不放代码了,改编一下1039的代码即可。
相关文章推荐
- HDU-1863 畅通工程(最小生成树[Prim])
- 数据库读写分离和垂直分库、水平分表
- 九度OJ 题目1066:字符串排序
- POJ -3414-Pots
- 指针的各种形式
- Android 模拟器AVD,设置电池状态
- lsof简介
- 实现几个连续输入的textfield
- 常用正则表达式
- PostgreSQL使用技巧
- iOS开发UI篇—CAlayer(自定义layer)
- 自定义UITableViewCell勾选框的保持
- [转]异常:android.os.NetworkOnMainThreadException
- CSS布局之水平垂直居中
- 拥抱生命……
- 在Hyper-V中使用USB设备的方法(简略)
- 九度OJ 题目1065:输出梯形
- 人体所需的7大营养素
- HDU 4322 Candy (最大费用最大流)经典
- Android Log图文详解(Log.v,Log.d,Log.i,Log.w,Log.e)