1039. course list for student (25)-pat

1039. course list for student (25) Time Limit 200 ms memory limit 32000 kb code length limit 16000 B discriminant program standard author Chen, Yue

Zhejiang University has 40000 students and provides 2500 courses. now given the Student name lists of all the courses, you are supposed to output the registered course list for each student who comes for a query.

Input specification:

Each input file contains one test case. for each case, the first line contains 2 positive integers: n (<= 40000), the number of students who look for their course lists, and K (<= 2500 ), the total number of courses. then the Student name lists are given for
Courses (numbered from 1 to k) in the following format: for each courseI, First the course IndexIAnd the number of registered students n_{I(<= 200) are given in a line. Then in the next line, nIStudent
Names are given. A student name consists of 3 capital English letters plus a one-digit number. finally the last line contains the N names of students who come for a query. all the names and numbers in a line are separated by a space.}

Output specification:

For each test case, print your results in n lines. each line corresponds to one student, in the following format: first print the student's name, then the total number of registered courses of that student, and finally the indices of the courses in increasing
Order. The query results must be printed in the same order as input. All the data in a line must be separated by a space, with no extra space at the end of the line.

Sample input:

11 54 7BOB5 DON2 FRA8 JAY9 KAT3 LOR6 ZOE11 4ANN0 BOB5 JAY9 LOR62 7ANN0 BOB5 FRA8 JAY9 JOE4 KAT3 LOR63 1BOB55 9AMY7 ANN0 BOB5 DON2 FRA8 JAY9 KAT3 LOR6 ZOE1ZOE1 ANN0 BOB5 JOE4 JAY9 FRA8 DON2 AMY7 KAT3 LOR6 NON9

Sample output:

ZOE1 2 4 5ANN0 3 1 2 5BOB5 5 1 2 3 4 5JOE4 1 2JAY9 4 1 2 4 5FRA8 3 2 4 5DON2 2 4 5AMY7 1 5KAT3 3 2 4 5LOR6 4 1 2 4 5NON9 0

Recommendation index :※※

Source: http://pat.zju.edu.cn/contests/pat-a-practise/1039

This question first comes to mind the use of map (the last case is passed, timeout, instead of hash_map, which is not supported by the compiler ...), Later, I went to the @ sunbaigui blog, used Hash for the name, directly uploaded the vector, and passed.

#include<iostream>#include<vector>#include<algorithm>#include<stdio.h>#include<stdlib.h>#include<string.h>using namespace std;const int N=26*26*26*10;bool compare(int a,int b){return a<b;}int hash_name(char *name){return (name[0]-'A')*26*26*10+(name[1]-'A')*26*10+(name[2]-'A')*10+(name[3]-'0');}int main(){int n,k;scanf("%d%d",&n,&k);int i,j;vector< vector<int> > stu(N+1);for(i=0;i<k;i++){int course,stu_num;scanf("%d%d",&course,&stu_num);for(j=0;j<stu_num;j++){char str[5];scanf("%s",str);stu[hash_name(str)].push_back(course);}}for(i=0;i<n;i++){char str[5];scanf("%s",str);if(stu[hash_name(str)].size()!=0){printf("%s %d",str,stu[hash_name(str)].size());sort(stu[hash_name(str)].begin(),stu[hash_name(str)].end(),compare);vector<int>::iterator iter_vec;for(iter_vec=stu[hash_name(str)].begin();iter_vec!=stu[hash_name(str)].end();iter_vec++){printf(" %d",*iter_vec);}printf("\n");}elseprintf("%s %d\n",str,0);}return 0;}

Map version (the last case times out ):

#include<iostream>#include<map>#include<vector>#include<algorithm>#include<stdio.h>#include<stdlib.h>#include<string.h>#include<string>using namespace std;bool compare(int a,int b){return a<b;}int main(){int n,k;scanf("%d%d",&n,&k);int i,j;map< string,vector<int> > map_cour;for(i=0;i<k;i++){int course,stu_num;scanf("%d%d",&course,&stu_num);for(j=0;j<stu_num;j++){char str[5];scanf("%s",str);string stu_name=string(str);map_cour[stu_name].push_back(course);}}for(i=0;i<n;i++){char str[5];scanf("%s",str);string stu_name=string(str);map<string,vector<int> >::iterator iter;iter=map_cour.find(stu_name);if(iter!=map_cour.end()){vector<int>:: iterator iter_vec;printf("%s %d",stu_name.c_str(),map_cour[stu_name].size());sort(map_cour[stu_name].begin(),map_cour[stu_name].end(),compare);for(iter_vec=map_cour[stu_name].begin();iter_vec!=map_cour[stu_name].end();iter_vec++){printf(" %d",*iter_vec);}printf("\n");}elseprintf("%s %d\n",stu_name.c_str(),0);}return 0;}