PAT 1039. Course List for Student (25) Hash,卡时间题
来源:互联网 发布:数据透视图去掉汇总行 编辑:程序博客网 时间:2024/06/06 14:10
1039. Course List for Student (25)
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 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.
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 NON9Sample 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
#include <cstdio>#include<string.h>#include<string>#include<map>#include<vector>#include<stdio.h>#include<set>#include<iostream>#include <algorithm>using namespace std;struct ZZ{ vector<int> S;}node[26*26*26*10+10];int now=0;int change(char *x){ int sum=0; for(int i=0;i<3;i++) sum=sum*26+x[i]-'A'; sum=sum*10+x[3]-'0'; return sum;}int main(){ int n,m; //cin>>n>>m; scanf("%d %d",&n,&m); for(int i=0;i<m;i++) { int x,y; //cin>>x>>y; scanf("%d %d",&x,&y); for(int j=0;j<y;j++) { char tmp[5]; scanf("%s",tmp); // if(M.find(tmp)==M.end()) // { // now=p; // M[tmp]=p++; // } // else now=M[tmp]; now=change(tmp); node[now].S.push_back(x); } } vector<int>::iterator it; for(int i=0;i<n;i++) { char tmp[5]; scanf("%s",tmp); printf("%s ",tmp); int nnow=change(tmp); //cout<<node[M[tmp]].S.size(); printf("%d",node[nnow].S.size()); sort(node[nnow].S.begin(),node[nnow].S.end()); for(it=node[nnow].S.begin();it!=node[nnow].S.end();it++) //cout<<' '<<*it; printf(" %d",*it); // cout<<endl; printf("\n"); } return 0;}
- PAT 1039. Course List for Student (25) Hash,卡时间题
- 1039. Course List for Student (25)-PAT
- PAT 1039. Course List for Student (25)
- PAT 1039. Course List for Student (25)
- PAT 1039. Course List for Student (25)
- PAT 1039. Course List for Student (25)
- 【PAT】1039. Course List for Student (25)
- 1039. Course List for Student (25)-PAT甲级真题
- 1039. Course List for Student (25)-PAT甲级真题
- PAT 1039. Course List for Student
- PAT 1039. Course List for Student
- PAT-A-1039. Course List for Student
- 【PAT】1039. Course List for Student
- PAT--1039. Course List for Student
- PAT-AL 1039. Course List for Student
- 1047. Student List for Course (25)-PAT
- 【PAT】1047. Student List for Course (25)
- PAT 1047. Student List for Course (25)
- java-单例模式
- Android WebView设置cookie
- MongoDb的Java客户端配置
- PAT (Basic Level) Practise (中文) 1069. 微博转发抽奖(20)
- Windows 10 64位 安装TensorFlow
- PAT 1039. Course List for Student (25) Hash,卡时间题
- Android热更新:微信Tinker框架的接入与测试
- async的waterfall
- web学习之js学习引索
- linux split 命令 分割
- android 电子签名 手写签名 功能实现
- 关于Expression.Equal方法的使用
- 线程安全的实现方法
- oracle 下载地址