PAT 甲级 1039 Course List for Student
发布日期:2021-07-01 03:09:06 浏览次数:3 分类:技术文章

本文共 2322 字,大约阅读时间需要 7 分钟。

1039 Course List for Student (25 point(s))

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 (≤40,000), the number of students who look for their course lists, and K (≤2,500), 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 N​i​​ (≤200) are given in a line. Then in the next line, N​i​​ 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 NON9

Sample 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

经验总结:

这一题.....最主要的就是,一定不能用map<string, vector<int> >这种STL映射,但根本原因不在于此,而在于,不能用cin 和cout 进行IO,否则最后一个测试点无法通过,不过使用map<int ,int> 可以,当然,直接将学生姓名一一映射为整数然后利用一位数组的方法更快一些~

AC代码 

#include 
#include
#include
#include
#include
#include
#include
using namespace std;const int maxn=26*26*26*10+1;vector
stu[maxn];int compute(char a[]){ int id=0; for(int i=0;i<3;++i) id=id*26+(a[i]-'A'); id=id*10+(a[3]-'0'); return id;}int main(){ int n,m,no,x; scanf("%d %d",&m,&n); char name[6]; for(int i=0;i

 

转载地址:https://meteorrain.blog.csdn.net/article/details/86660339 如侵犯您的版权,请留言回复原文章的地址,我们会给您删除此文章,给您带来不便请您谅解!

上一篇:PAT 甲级 1040 Longest Symmetric String
下一篇:PAT 甲级 1038 Recover the Smallest Number

发表评论

最新留言

路过按个爪印,很不错,赞一个!
[***.219.124.196]2024年04月17日 05时27分27秒