PAT 1047 Student List for Course [vector]-优快云博客

本文链接：https://blog.youkuaiyun.com/Time504/article/details/86980908

本篇博客详细解析了PAT1039课程列表题目的算法实现，通过使用C++，介绍了如何根据学生注册课程信息，输出所有课程的学生名单。文章包括输入输出规格说明，示例代码和解析。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

------------------------------------这是题目和解题的分割线------------------------------------

和这道题差不多，PAT 1039 Course List for Student，一个要求根据学生输出课程，一个要求根据课程输出学生。

这道题名字的顺序是固定的，所以可以不用哈希转换，记录下坐标即可。

#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>

using namespace std;

//用于坐标和姓名的转换 
char sName[40005][10];

bool cmp(int a,int b)
{
	return strcmp(sName[a],sName[b])<0;
}

int main()
{
	vector<int> course[2510];
	int sNum,cNum,i,x;	
	scanf("%d%d",&sNum,&cNum);
	for(i=0;i<sNum;i++)
	{
		scanf("%s%d",&sName[i],&x);
		int co;
		while(x--)
		{
			scanf("%d",&co);
			//存储名字下标即可 
			course[co].push_back(i);
		}
	}
	for(i=1;i<=cNum;i++)
	{
		//排序，course里存的是下标，需要cmp转换成字符串再比较 
		sort(course[i].begin(),course[i].end(),cmp);
		printf("%d %d\n",i,course[i].size());
		for(int j=0;j<course[i].size();j++)
			printf("%s\n",sName[course[i][j]]);
	}
	return 0;
}