PAT-1047 Student List for Course (25)

题目要求

Zhejiang University has 40000 students and provides 2500 courses. Now given the registered course list of each student, you are supposed to output the student name lists of all the courses.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 numbers: N (<=40000), the total number of students, and K (<=2500), the total number of courses. Then N lines follow, each contains a student’s name (3 capital English letters plus a one-digit number), a positive number C (<=20) which is the number of courses that this student has registered, and then followed by C course numbers. For the sake of simplicity, the courses are numbered from 1 to K.

Output Specification:

For each test case, print the student name lists of all the courses in increasing order of the course numbers. For each course, first print in one line the course number and the number of registered students, separated by a space. Then output the students’ names in alphabetical order. Each name occupies a line.

Sample Input:

1
2
3
4
5
6
7
8
9
10
11
10 5
ZOE1 2 4 5
ANN0 3 5 2 1
BOB5 5 3 4 2 1 5
JOE4 1 2
JAY9 4 1 2 5 4
FRA8 3 4 2 5
DON2 2 4 5
AMY7 1 5
KAT3 3 5 4 2
LOR6 4 2 4 1 5

Sample Output:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
1 4
ANN0
BOB5
JAY9
LOR6
2 7
ANN0
BOB5
FRA8
JAY9
JOE4
KAT3
LOR6
3 1
BOB5
4 7
BOB5
DON2
FRA8
JAY9
KAT3
LOR6
ZOE1
5 9
AMY7
ANN0
BOB5
DON2
FRA8
JAY9
KAT3
LOR6
ZOE1

解题思路

此题与之前的1039非常类似。首先要对学生的名称进行哈希,得到相应的整数,然后在每个课程对应的vector下面,存储学生姓名的哈希值。同时,在一个数组里,以哈希值为Index存储学生的姓名。

最后在输出的时候,首先对哈希值进行一遍排序,然后将存储的学生姓名输出即可。

代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
char names[26 * 26 * 26 * 10 + 10][5];
vector<int> c[2510];
int getHash(char *a)
{
return (a[0] - 'A') * 26 * 26 * 10 +
(a[1] - 'A') * 26 * 10 +
(a[2] - 'A') * 10 +
(a[3] - '0');
}
int main()
{
int n, k;
char buf[5];
int course;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++)
{
int a;
scanf("%s%d", buf, &a);
int hash = getHash(buf);
strcpy(names[hash], buf);
for (int j = 0; j < a; j++)
{
scanf("%d", &course);
c[course].push_back(hash);
}
}
for (int i = 1; i <= k; i++)
{
int len = c[i].size();
printf("%d %d\n", i, len);
sort(c[i].begin(), c[i].end());
for (int j = 0; j < len; j++)
{
printf("%s\n", names[c[i][j]]);
}
}
system("pause");
return 0;
}