1047. Student List for Course

Student List for Course

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:

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 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

题意

第一行给出学生数目N和课程数目K，接下去N行依次给出学生姓名、选课数量、具体课程编号，要求按顺序列出每个课程的编号、选课人数以及学生具体名单，名单按字母表顺序排列。

思路

PAT1039的逆问题，同样开散列，利用vector来完成，关键是将名字转化成整数，以及将整数还原为名字这两步，同时不要忘了最后要对学生姓名进行排序。

代码实现

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int maxn = 2501;
vector<int> course[maxn];       // 课程信息存储散列表

int hashNum(char name[])        // 将名字映射成唯一的整数
{
	int ans = 0;
	for (int i = 0; i < 3; i++)
		ans = ans * 26 + name[i] - 'A';
	ans = ans * 10 + name[3] - '0';
	return ans;
}

void printChar(int n)           // 将整数还原为名字并打印
{
	char name[5];
	name[3] = n % 10 + '0';
	n /= 10;
	for (int i = 2; i >= 0; i--)
	{
		name[i] = n % 26 + 'A';
		n /= 26;
	}
	name[4] = '\0';
	puts(name);
}

int main()
{
	int n, k;
	int id, num;
	int temp;           // 存储名字映射后的整数
	char name[5];
	vector<int>::iterator it;
	
	scanf("%d %d", &n, &k);
	for (int i = 0; i < n; i++)
	{
		scanf("%s %d", name, &num);
		temp = hashNum(name);
		for (int j = 0; j < num; j++)
		{
			scanf("%d", &id);
			course[id].push_back(temp);
		}
	}
	
	for (int i = 1; i <= k; i++)
	{
		sort(course[i].begin(),course[i].end());        // 名字的升序排列，即为映射后唯一整数的升序排列
		printf("%d %d\n", i, course[i].size());
		for (it = course[i].begin(); it != course[i].end(); it++)
			printChar(*it);
	}
	
	return 0;
}

直接用set来代替vector和sort进行自动排序是不可取的，因为在最后一个点会超时。