1039. Course List for Student (25)
来源:互联网 发布:windows bat日期加减 编辑:程序博客网 时间:2024/05/16 17:23
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 54 7BOB5 DON2 FRA8 JAY9 KAT3 LOR6 ZOE11 4ANN0 BOB5 JAY9 LOR62 7ANN0 BOB5 FRA8 JAY9 JOE4 KAT3 LOR63 1BOB55 9AMY7 ANN0 BOB5 DON2 FRA8 JAY9 KAT3 LOR6 ZOE1ZOE1 ANN0 BOB5 JOE4 JAY9 FRA8 DON2 AMY7 KAT3 LOR6 NON9Sample Output:
ZOE1 2 4 5ANN0 3 1 2 5BOB5 5 1 2 3 4 5JOE4 1 2JAY9 4 1 2 4 5FRA8 3 2 4 5DON2 2 4 5AMY7 1 5KAT3 3 2 4 5LOR6 4 1 2 4 5NON9 0
#include<iostream>#include<map>#include<algorithm>#include<vector>#include<cstdio>using namespace std;vector <int > v[26*26*26*11];int cnt=1;int n,k;int course,person;char name[10];int toint(char s[]){ int sum=0; for(int i=0;i<3;i++) sum=sum*26+s[i]-'A'; sum=sum*10+s[3]-'0'; return sum;}int main(){ scanf("%d %d",&n,&k); for (int i=0;i<k;i++) { scanf("%d %d",&course,&person); for(int j=0;j<person;j++) { scanf("%s",name); v[toint(name)].push_back(course); } } for (int i=0;i<n;i++) { scanf("%s",name); int tt=toint(name); sort(v[tt].begin(),v[tt].end()); cout<<name<<" "<<v[tt].size(); for (int i=0;i<v[tt].size();i++) printf(" %d",v[tt][i]); cout<<endl; } return 0;}
- 1039. Course List for Student (25)
- 1039. Course List for Student (25)-PAT
- 1039. Course List for Student (25)
- 1039. Course List for Student (25)
- 1039. Course List for Student (25)
- PAT 1039. Course List for Student (25)
- 1039. Course List for Student (25)
- 1039. Course List for Student (25)
- 1039. Course List for Student (25)
- 1039. Course List for Student (25)
- PAT 1039. Course List for Student (25)
- 1039. Course List for Student (25)
- 1039. Course List for Student (25)
- 1039. Course List for Student (25)
- 1039. Course List for Student (25)
- PAT 1039. Course List for Student (25)
- 1039. Course List for Student (25)
- PAT 1039. Course List for Student (25)
- 怎样让 表中的数据 <a href='aa'>Game</a> 原本的显示在网页中
- Linux"和$()的区别以及调研 eval命令
- 近十年量化交易领域最重要的十本参考书推荐!重要!
- python-数据库
- Android Wi-Fi 设置wifi Only 11a、b、g、n 扫描(以QCOM为平台)
- 1039. Course List for Student (25)
- g++ 64位版
- 深入浅出Tensorflow(一):深度学习及TensorFlow简介
- 使用UDP方式 与iOS端App通讯
- 找到不重复字母在一个字符串第一次出现的索引 三种方法
- 在linux服务器下使用maven(持续更新)
- BZOJ 1854-游戏(并查集)
- 进度条动画(纯css)
- TCP协议