PAT 1039. Course List for Student (25)

1039. Course List for Student (25)

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

本题如果使用c++的map直接map<string, vector<int> >最后一个测试点会超时。我们发现题目中说学生的名字的格式是非常严格的,我们可以采用hash的方法将名字直接对应到一个索引上,这个时间为O(1),这样就可以过了。
 1 #include <cstdio>
 2 #include <vector>
 3 #include <string>
 4 #include <algorithm>
 5
 6 using namespace std;
 7
 8 int HashFunction(char* name)
 9 {
10     return (name[0] - ‘A‘) * 26 * 26 * 10 + 11         (name[1] - ‘A‘) * 26 * 10 + 12         (name[2] - ‘A‘) * 10 + 13         (name[3] - ‘0‘);
14 }
15
16 vector<int> courseList[26*26*26*10];
17
18 int main()
19 {
20     int queryNum, courseNum;
21     scanf("%d%d", &queryNum, &courseNum);
22     for (int i = 0; i < courseNum; i++)
23     {
24         int courseIndex, stuNum;
25         scanf("%d%d", &courseIndex, &stuNum);
26         for (int j = 0; j < stuNum; j++)
27         {
28             char s[5];
29             scanf("%s", s);
30             int index = HashFunction(s);
31             courseList[index].push_back(courseIndex);
32         }
33     }
34
35     for (int i = 0; i < queryNum; i++)
36     {
37         char name[5];
38         scanf("%s", name);
39         int index = HashFunction(name);
40         if (courseList[index].empty())
41             printf("%s 0", name);
42         else
43         {
44             vector<int> vec = courseList[index];
45             sort(vec.begin(), vec.end());
46             printf("%s %d ", name, vec.size());
47             for (int j = 0; j < vec.size(); j++)
48             {
49                 printf("%d", vec[j]);
50                 if (j < vec.size() - 1)
51                     printf(" ");
52             }
53         }
54         if (i < queryNum - 1)
55             printf("\n");
56     }
57 }
时间: 2024-10-11 04:00:41

PAT 1039. Course List for Student (25)的相关文章

PAT Advanced 1039 Course List for Student (25分) (STL)

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

PAT (Advanced Level) 1039. Course List for Student (25)

map会超时,二分吧... #include<iostream> #include<cstring> #include<cmath> #include<algorithm> #include<cstdio> #include<map> #include<queue> #include<string> #include<vector> using namespace std; int n,m; int

PAT甲题题解-1039. Course List for Student (25)-建立映射+vector

博主欢迎转载,但请给出本文链接,我尊重你,你尊重我,谢谢~http://www.cnblogs.com/chenxiwenruo/p/6789157.html特别不喜欢那些随便转载别人的原创文章又不给出链接的所以不准偷偷复制博主的博客噢~~ 题意:给出要查询的n个学生,k个课程接下来对于k门课,给出其id和学生数量,以及对应的学生名字租后给出n个查询的学生名字,让你输出其选的课程数量和对应的课程id,id从小到大排序. 题目简单,然而建立映射的想法不错~~推荐一开始发生段错误,才发现n的范围只是

PAT:1039. Course List for Student (25) 部分正确(最后一个大数据错误)

#include<stdio.h> #include<string.h> #include<vector> #include<algorithm> using namespace std; const int MAX=40010; const int H=26*26*26*10+10; int n,k; //n个人,k门课 vector<int> HAR[H]; int getID(char str[]) //获取名字对应的哈希ID { int

【PAT甲级】1039 Course List for Student (25 分)(vector嵌套于map,段错误原因未知)

题意: 输入两个正整数N和K(N<=40000,K<=2500),分别为学生和课程的数量.接下来输入K门课的信息,先输入每门课的ID再输入有多少学生选了这门课,接下来输入学生们的ID.最后N次询问,输入学生的ID输出该学生选了多少们课,输出所选课程的数量,按照递增序输出课程的ID. trick: 第5个数据点出现段错误,把原本以map存学生对应ID再映射vector存储该学生所选课程改成vector嵌套在map内,就没有段错误的问题出现,疑似映射过程中指针漂移??? 代码: #define H

1039. Course List for Student (25)

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

PAT 1007 Course List for Student (25)

题目描述 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. 输入描述: Each input file contains o

A1039. Course List for Student (25)

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

PAT 甲级 1083 List Grades (25 分)

1083 List Grades (25 分) Given a list of N student records with name, ID and grade. You are supposed to sort the records with respect to the grade in non-increasing order, and output those student records of which the grades are in a given interval. I