A1039.Course List for Student
来源:互联网 发布:javascript定义数组 编辑:程序博客网 时间:2024/06/09 18:15
Zhejiang University has 40000 students and provides 2500 courses. Now given the student name lists of all the courses, you are supposed to output the registered course list for each student who comes for a query.
Input Specification:
Each input file contains one test case. For each case, the first line contains 2 positive integers: N (<=40000), the number of students who look for their course lists, and K (<=2500), the total number of courses. Then the student name lists are given for the courses (numbered from 1 to K) in the following format: for each course i, first the course index i and the number of registered students Ni (<= 200) are given in a line. Then in the next line, Ni student names are given. A student name consists of 3 capital English letters plus a one-digit number. Finally the last line contains the N names of students who come for a query. All the names and numbers in a line are separated by a space.
Output Specification:
For each test case, print your results in N lines. Each line corresponds to one student, in the following format: first print the student’s name, then the total number of registered courses of that student, and finally the indices of the courses in increasing order. The query results must be printed in the same order as input. All the data in a line must be separated by a space, with no extra space at the end of the line.
Sample Input:
11 5
4 7
BOB5 DON2 FRA8 JAY9 KAT3 LOR6 ZOE1
1 4
ANN0 BOB5 JAY9 LOR6
2 7
ANN0 BOB5 FRA8 JAY9 JOE4 KAT3 LOR6
3 1
BOB5
5 9
AMY7 ANN0 BOB5 DON2 FRA8 JAY9 KAT3 LOR6 ZOE1
ZOE1 ANN0 BOB5 JOE4 JAY9 FRA8 DON2 AMY7 KAT3 LOR6 NON9
Sample Output:
ZOE1 2 4 5
ANN0 3 1 2 5
BOB5 5 1 2 3 4 5
JOE4 1 2
JAY9 4 1 2 4 5
FRA8 3 2 4 5
DON2 2 4 5
AMY7 1 5
KAT3 3 2 4 5
LOR6 4 1 2 4 5
NON9 0
Code:
#include "cstdio"#include "algorithm"#include "vector"using namespace std;const int N = 40010;const int M = 36 * 36 * 36 * 10 + 10;vector<int> selectCourse[M];int getID(char name[]){ int id = 0; for(int i = 0; i < 3; i++) { id = id * 36 + (name[i] - 'A'); } id = id * 10 + (name[3] - '0'); return id;}int main(){ int stuNum,CourseNum; char name[5]; scanf("%d%d",&stuNum,&CourseNum); for(int i = 0; i < CourseNum; i++) { int course,k,id; scanf("%d%d",&course,&k); for(int j = 0; j < k; j++) { scanf("%s",name); id = getID(name); selectCourse[id].push_back(course); } } for(int i = 0; i < stuNum; i++) { scanf("%s",name); int id = getID(name); sort(selectCourse[id].begin(),selectCourse[id].end()); printf("%s %d",name,selectCourse[id].size()); for(int j = 0; j < selectCourse[id].size(); j ++) { printf(" %d",selectCourse[id][j]); } printf("\n"); } return 0;}
- A1039.Course List for Student
- PAT-A1039. Course List for Student (25)
- pat-a1039. Course List for Student (25)
- PAT A1039. Course List for Student (25)
- PAT A1039 course list for student (25)
- Course List for Student
- Student List for Course
- 1047. Student List for Course
- 1039. Course List for Student
- PAT_1039: Course List for Student
- 1039. Course List for Student
- 1047. Student List for Course
- 1039. Course List for Student
- 1047. Student List for Course
- 1039.Course List for Student
- 1047.Student List for Course
- pat1047 Student List for Course
- pat1039 Course List for Student
- 利用静态内部类实现的单例模式
- Bundle源码解析
- 《Where to Focus: Query Adaptive Matching for Instance Retrieval Using Convolutional Feature Maps》阅读笔
- java解析json格式请求的url中参数
- Effictive Scala(2)
- A1039.Course List for Student
- IPV6地址和报文结构详解
- python学习笔记4
- Firefox浏览器的安装及插件使用
- #python学习笔记# del
- MySQL入门
- obs源码编译
- Android启动过程以及各个镜像的关系
- java中equals方法的用法以及==的用法