Course List for Student

题目描述

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.

输入

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 the courses (numbered from 1 to K) in the following format: for each course i, first the course index i and the number of registered students Ni (<= 200) are given in a line. Then in the next line, Ni student 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.

输出

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.

 

题意

假设全校有最多40000名学生和最多2500门课程。现给出每门课的选课学生名单，要求输出每个前来查询的学生的选课清单。

输入格式:

输入的第一行是两个正整数：N（≤40000），为前来查询课表的学生总数；K（≤2500），为总课程数。此后顺序给出课程1到K的选课学生名单。格式为：对每一门课，首先在一行中输出课程编号（简单起见，课程从1到K编号）和选课学生总数（之间用空格分隔），之后在第二行给出学生名单，相邻两个学生名字用1个空格分隔。学生姓名由3个大写英文字母+1位数字组成。选课信息之后，在一行内给出了N个前来查询课表的学生的名字，相邻两个学生名字用1个空格分隔。

输出格式:

对每位前来查询课表的学生，首先输出其名字，随后在同一行中输出一个正整数C，代表该生所选的课程门数，随后按递增顺序输出C个课程的编号。相邻数据用1个空格分隔，注意行末不能输出多余空格。

样例输入

BOB5 DON2 FRA8 JAY9 KAT3 LOR6 ZOE1

ANN0 BOB5 JAY9 LOR6

ANN0 BOB5 FRA8 JAY9 JOE4 KAT3 LOR6

BOB5

AMY7 ANN0 BOB5 DON2 FRA8 JAY9 KAT3 LOR6 ZOE1
ZOE1 ANN0 BOB5 JOE4 JAY9 FRA8 DON2 AMY7 KAT3 LOR6 NON9

样例输出

ZOE1
ANN0
BOB5
JOE4
JAY9
FRA8
DON2
AMY7
KAT3
LOR6
NON9 

用到了映射，vector，sort

小技巧就是在名字字符串相对固定的情况下，我们可以把一个整数值映射。也方便做后面的排序（其int的大小排序刚好对应于名字大小的排序）

第一次用课程序号作为数组下标，超时了

 #include <stdio.h>
 #include <vector>
 using namespace std;

 int hashFunc(char S[],int len)
 {
     int id=;
     for(int i=;i<len-;i++)
     {
         id=id*+(S[i]-'A');
     }
     id=id*+S[len-]-'';
     return id;
 }

 int main()
 {
     int n,k;
     int t,i,g;
     vector<int> vi[];
     char str[];
     scanf("%d %d",&n,&k);
     for(i=;i<k;i++)
     {
         int a,b;
         scanf("%d %d",&a,&b);
         while(b--)
         {
             scanf("%s",str);
             t=hashFunc(str,);
             vi[a].push_back(t);
         }
     }
     while(n--)
     {
         scanf("%s",str);
         printf("%s",str);
         int num=;
         t=hashFunc(str,);
         vector<int> vt;
         for(i=;i<=k;i++)
         {
             for(g=;g!=vi[i].size();g++)
             {
                 if(t==vi[i][g])
                 {
                     num++;
                     vt.push_back(i);
                     break;
                 }
             }
         }
         if(num)
         {
             printf(" %d",num);
             for(i=;i!=vt.size();i++)
             {
                 printf(" %d",vt[i]);
             }
         }
         else printf("");
         printf("\n");
     }
     return ;
 }

后来用人名的映射作为数组下标，用空间来代替时间

 #include <stdio.h>
 #include <algorithm>
 #include <vector>
 using namespace std;

 const int maxx =  *  *  *  + ;
 vector<int> vi[maxx];

 int hashFunc(char S[],int len)
 {
     int id=;
     for(int i=;i<len-;i++)
     {
         id=id*+(S[i]-'A');
     }
     id=id*+S[len-]-'';
     return id;
 }

 int main()
 {
     int n,k;
     int t,i;
     char str[];
     scanf("%d %d",&n,&k);
     for(i=;i<k;i++)
     {
         int a,b;
         scanf("%d %d",&a,&b);
         while(b--)
         {
             scanf("%s",str);
             t=hashFunc(str,);
             vi[t].push_back(a);
         }
     }
     while(n--)
     {
         scanf("%s",str);
         printf("%s",str);
         t=hashFunc(str,);
         sort(vi[t].begin(), vi[t].end());
         printf(" %d",vi[t].size());
         for(i=;i!=vi[t].size();i++)
         {
             printf(" %d",vi[t][i]);
         }
         printf("\n");
     }
     return ;
 }

对比上一种

 #include <stdio.h>
 #include <set>
 #include <map>
 #include <algorithm>

 using namespace std;

 int hashfun(char str[],int n)
 {
     int i;
     int ans=;
     for(i=;i<n-;i++)
     {
         ans=ans*+str[i]-'A';
     }
     ans=ans*+str[n-];
     return ans;
 }

 int main()
 {
     int n,k;
     char str[];
     map<int,set<int> >mp;
     set<int>::iterator it;
     scanf("%d %d",&n,&k);
     for(int i=;i<k;i++)
     {
         int a,b;
         scanf("%d %d",&a,&b);
         int t;
         while(b--)
         {
             scanf("%s",str);
             t=hashfun(str,);
             mp[t].insert(a);
         }
     }
     while(n--)
     {
         scanf("%s",str);
         printf("%s",str);
         int t;
         t=hashfun(str,);
         printf(" %d",mp[t].size());
         for(it=mp[t].begin();it!=mp[t].end();it++)
         {
             printf(" %d",*it);
         }
         printf("\n");
     }
     return ;
 }