A1039 Course List for Student （25 分）

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
int getid(char a[])//不用这个变换会ac不了，晴神宝典给的这个方法确实很巧妙
{
	int k=0;
	for (int i = 0; i < 3; i++)
	{
		k = k * 26 + a[i] - 'A';
	}
	k = k * 10 + a[3] - '0';
	return k;
}
const int m = 26 * 26 * 26 * 10 + 1;//所有组合的最大值
vector<int> scourse[m];//相当于一个变长的二维数组

int main()
{
	int n, m;//查询人数，课程数
	scanf("%d %d", &n, &m);
	for (int i = 0; i < m; i++)
	{
		int course, cnum;
		scanf("%d %d", &course, &cnum);
		char str[8];
		for (int j = 0; j < cnum; j++)
		{
			scanf("%s", str);
			int id = getid(str);
			scourse[id].push_back(course);
		}
	}
	char strq[8];
	for (int i = 0; i < n; i++)
	{
		scanf("%s", strq);
		int id = getid(strq);
		sort(scourse[id].begin(), scourse[id].end());
		printf("%s %d", strq,scourse[id].size());
		for (int j = 0; j < scourse[id].size(); j++)
		{
			printf(" %d", scourse[id][j]);
		}
		printf("\n");
	}
	return 0;
}