1047 Student List for Course(25 分)
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
分析: 该题很简单,但是我一开始始用map<int,vector<string>> mp; 其中sting导致了最后一个case超时,导致只得了21分。
所以总结,因为name是固定4个字符内容,所以以后碰到这种固定长度的,要使用char数组来代替。但是 map<int,vector<char *>> mp 来存储的话要注意一个细节,一定要动态申请内存来存储name,不然会导致最后vector只有一个字符串.另外字符串的比较通过strcmp(a,b) < 0 来即可!!!
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<map>
#include<string.h>
using namespace std;
int cmp(char *a,char *b){
return strcmp(a,b) < 0;//通过strcmp来比较
}
int main(){
int n,k;
scanf("%d %d",&n,&k);
map<int,vector<char *>> mp;
int num,course;
for(int i=0;i<n;i++)
{
char *name = new char[5];//一定要动态申请内存,不然因为是同一个数组,最终vector中只会有一个字符串
scanf("%s %d",name,&num);
for(int j=0;j<num;j++)
{
scanf("%d",&course);
mp[course].push_back(name);
}
}
for(int i=1;i<=k;i++){
printf("%d %d\n",i,mp[i].size());
sort(mp[i].begin(),mp[i].end(),cmp);
for(auto it:mp[i])
printf("%s\n",it);
}
return 0;
}