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

1047 Student List for Course (25分)

吐槽

初见：哎呀小老弟？你看起来有点眼熟啊？是不是有个兄弟叫1039啊？你好像看起来还不如他嘛？
写完：嗯，果然不如嘛。
提交：测点3超时？
稍作修改后提交：测点3内存超限？？？？？
小老弟你不对劲啊！

思路

讲真题目思路没啥好说的，重点在于鬼畜的用时和内存。
我一开始用的自增队列保存一个课程中的学生名字，超时后觉得可以在对学生名字一次性排序（用了会自动这么做的map结构）再放进课程的普通队列中，排序的次数就会减少很多。
然而还是超时。我就开始感到迷惑了。
然后我发现，我把输出部分删掉一句时间就够了。所以我想改用vector不用pop了也许就可以了。
然后内存超限了。

多次试验后我发现，罪魁祸首是我的cout。
曾经在教程中看到过“cout开销比printf大很多”，于是我改用了printf（并解决了一下printf不能直接输出string的问题），然后……
就过了。
嗯。……

顺带提一嘴，我还把输入时的cin改掉了。然后发现VS会强迫我用scanf_s否则不给编译，但PTA上g++编译器只认scanf不认scanf_s……emmmm。虽然改一下就行，但就感觉很迷惑。

代码

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

using namespace std;

int main()
{
	int n, k, i, c, ii, temp;
	cin >> n >> k;
	vector<queue<string>> course(k + 1);
	string name;
	map<string, queue<int>> st;
	for (i = 0; i < n; i++)
	{
		cin >> name >> c;
		for (ii = 0; ii < c; ii++)
		{
			scanf("%d", &temp);
			st[name].push(temp);
		}
	}

	map<string, queue<int>>::iterator it;
	for (it = st.begin(); it != st.end(); it++)
	{
		while (!it->second.empty())
		{
			temp = it->second.front();
			course[temp].push(it->first);
			it->second.pop();
		}
	}

	for (i = 1; i <= k; i++)
	{
		cout << i << " " << course[i].size() << endl;
		while (!course[i].empty())
		{
			printf("%s\n", course[i].front().c_str());
			course[i].pop();
		}
	}

	return 0;
}

题目

Zhejiang University has 40,000 students and provides 2,500 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 (≤40,000), the total number of students, and K (≤2,500), 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