PAT甲级 1039
来源:互联网 发布:telnet连接到80端口 编辑:程序博客网 时间:2024/05/22 12:52
Course List for Student
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
- 疑问
- 将char name[4]改成char name[5],不会出现
Stack around the variable 'name' was corrupted.
的错误。无法理解,这里我也没有访问name[4],以及scanf长度超过4的字符串。
- 将char name[4]改成char name[5],不会出现
#include<iostream>#include<stdio.h>#include<vector>#include<algorithm>using namespace std;const int maxn=26*26*26*10+1;vector<int> v[maxn],query;void input_data(int n,int k){ int idx,num; int i,j; char name[5]; for(i=0;i<k;i++){ scanf("%d %d",&idx,&num); for(j=0;j<num;j++){ scanf("%s",name); v[(name[0]-'A')*26*26*10+(name[1]-'A')*26*10+(name[2]-'A')*10+name[3]-'0'].push_back(idx); } } for(i=0;i<n;i++){ scanf("%s",name); query.push_back((name[0]-'A')*26*26*10+(name[1]-'A')*26*10+(name[2]-'A')*10+name[3]-'0'); }}void output_data(int n){ for(auto it=query.begin();it!=query.end();it++){ printf("%c%c%c%d %d",(*it)/26/26/10+'A',(*it)/26/10%26+'A',(*it)/10%26+'A',(*it)%10,v[*it].size()); sort(v[*it].begin(),v[*it].end()); for(auto sit=v[*it].begin();sit!=v[*it].end();++sit){ printf(" %d",*sit); } printf("\n"); }}int main(){ freopen("./in","r",stdin); int N,K; scanf("%d %d",&N,&K); input_data(N,K); output_data(N);}
- PAT(甲级)1039
- 浙大PAT甲级 1039
- PAT甲级1039
- PAT甲级 1039
- PAT 甲级
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT(甲级)1003
- PAT(甲级)1004
- PAT(甲级)1005
- PAT(甲级)1006
- PAT(甲级)1007
- PAT(甲级)1008
- PAT(甲级)1009
- PAT(甲级)1010
- PAT(甲级)1011
- PAT(甲级)1012
- PAT(甲级)1013
- vue中的懒加载和按需加载
- OpenCV Python 图像的载入、显示和保存
- 复杂链表的构成与复制
- HDU-1241-Oil Deposits
- Java基础之自增(++)和自减(--)运算符
- PAT甲级 1039
- 机器学习实战【2】(决策树ID3算法)
- DSP的C/C++语言程序设计
- Android中字符串的拆分split方法
- Educational Codeforces Round 25
- 深入Java集合学习系列:HashMap的实现原理
- python 常用函数
- java的substring()
- E