Student List for Course (25)
题目描述
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.
输入
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.
输出
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.
样例输入
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
样例输出
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
思路:看输出输出,很容易想到,每次保存 选择相同课程的同学的名字。也就是,把选1课程的同学的名字保存在一起。
这里关键一点,就是用一个二维的数组,第一维保存课程,int型,第二维保存名字 字符串型;但是,基本类型没有字符串型,所以我们选择构造一个结构体,结构体里面放字符串;
#include<iostream>
#include<cstdio>
using namespace std;
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<cstdlib>
struct student
{
char nname [10];
};
vector<student> stu[2505]; //关键部分
bool cmp (student a,student b)
{
return strcmp(a.nname,b.nname)<0;
}
int main()
{
int N,K;
scanf("%d%d",&N,&K);
while(N--)
{
int n;
struct student stuu;
scanf("%s%d",stuu.nname,&n);
while(n--)
{
int mm;
scanf("%d",&mm);
stu[mm].push_back(stuu);
}
}
for(int m=1;m<=K;m++)
{
printf("%d %d\n",m,stu[m].size() );
sort(stu[m].begin() ,stu[m].end(),cmp);
for(int i=0;i<stu[m].size() ;i++)
printf("%s\n",stu[m][i].nname);
}
return 0;
}