PAT A 甲级 1039 Course List for Student (25分)

1039 Course List for Student (25分)

吐槽

PAT编程常识：所有运行时间紧张的题目都要多提交几次碰碰随机数据的运气。

思路

显然这道题最大问题的就是运行时间非常紧张。最大2500*200条数据要对应到40000个人上，这是无论如何改进都不可能逃脱的操作，使用遍历去完成这件事（不管是在输入时还是中间处理还是输出时）明显是会超时的。

也就是说——只能在存储方式上下功夫，从而解决“遍历”的O(n)。

基于这种思路，我想到了这种办法：题设学生姓名是三个大写字母一个数字的组合，从这点入手的话，很自然的想到可以把数据直接储存到一个形如priority_queue<int, vector<int>, greater<int>>* st[26][26][26][10]的队列数组中。这样对学生姓名的搜索就会变成直接对应，运算量级降到O(k*ni)。
这也就是后面的代码1。多次提交之后发现每次都能通过，可以算是比较好的解法了。

还有一种思路是使用高效的排序存储与查找来保存数据，从而使得用时从“遍历”操作的O(n)下降到……O(logn)或者别的什么。实际上直接使用map数据类型即可。STL内部使用的排序和查找无疑是极度高效而可靠的。
当然，这种方式的用时下降的没有上一种那么多（上一种直接把O(n)降到O(1)了），所以需要多次提交去凑随机数据才能通过测点……不过考试的话写起来会非常的简单快速。map是真的易用。

代码1（使用队列数组）

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<map>

using namespace std;

int main()
{
	priority_queue<int, vector<int>, greater<int>>* st[26][26][26][10];
	int n, k;
	cin >> n >> k;
	int i, ii, iii, iiii, id, num;
	string temps;
	for (i = 0; i < 26; i++)
	{
		for (ii = 0; ii < 26; ii++)
		{
			for (iii = 0; iii < 26; iii++)
			{
				for (iiii = 0; iiii < 10; iiii++)
				{
					st[i][ii][iii][iiii] = new priority_queue<int, vector<int>, greater<int>>;
				}
			}
		}
	}
	for (i = 0; i < k; i++)
	{
		cin >> id >> num;
		for (ii = 0; ii < num; ii++)
		{
			cin >> temps;
			st[temps[0] - 'A'][temps[1] - 'A'][temps[2] - 'A'][temps[3] - '0']->push(id);
		}
	}
	queue<string> student;
	string name;
	for (i = 0; i < n; i++)
	{
		cin >> name;
		student.push(name);
	}
	for (i = 0; i < n; i++)
	{
		name = student.front();
		cout << name << " " << st[name[0] - 'A'][name[1] - 'A'][name[2] - 'A'][name[3] - '0']->size();
		while (!st[name[0] - 'A'][name[1] - 'A'][name[2] - 'A'][name[3] - '0']->empty())
		{
			cout << " " << st[name[0] - 'A'][name[1] - 'A'][name[2] - 'A'][name[3] - '0']->top();
			st[name[0] - 'A'][name[1] - 'A'][name[2] - 'A'][name[3] - '0']->pop();
		}
		student.pop();
		cout << endl;
	}
	return 0;
}

代码2（使用map）（概率通过概率超时）

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<map>

using namespace std;

int main()
{
	map<string, priority_queue<int, vector<int>, greater<int>>> st;
	int n, k;
	cin >> n >> k;
	int i, ii, id, num;
	string temps;
	for (i = 0; i < k; i++)
	{
		cin >> id >> num;
		for (ii = 0; ii < num; ii++)
		{
			cin >> temps;
			st[temps].push(id);
		}
	}
	queue<string> student;
	for (i = 0; i < n; i++)
	{
		cin >> temps;
		student.push(temps);
	}
	for (i = 0; i < n; i++)
	{
		temps = student.front();
		cout << temps << " " << st[temps].size();
		while (!st[temps].empty())
		{
			cout << " " << st[temps].top();
			st[temps].pop();
		}
		cout << endl;
		student.pop();
	}
	return 0;
}

题目

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