PAT 1039 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.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive integers: N (≤40,000), the number of students who look for their course lists, and K (≤2,500), 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 N i(≤200) are given in a line. Then in the next line, N istudent 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 5

4 7

BOB5 DON2 FRA8 JAY9 KAT3 LOR6 ZOE1

1 4

ANN0 BOB5 JAY9 LOR6

2 7

ANN0 BOB5 FRA8 JAY9 JOE4 KAT3 LOR6

3 1

BOB5

5 9

AMY7 ANN0 BOB5 DON2 FRA8 JAY9 KAT3 LOR6 ZOE1

ZOE1 ANN0 BOB5 JOE4 JAY9 FRA8 DON2 AMY7 KAT3 LOR6 NON9

Sample Output:

ZOE1 2 4 5

ANN0 3 1 2 5

BOB5 5 1 2 3 4 5

JOE4 1 2

JAY9 4 1 2 4 5

FRA8 3 2 4 5

DON2 2 4 5

AMY7 1 5

KAT3 3 2 4 5

LOR6 4 1 2 4 5

NON9 0

一开始我的代码是这样的:

cpp 复制代码
#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;

int main(){
  int n,k;
  scanf("%d %d",&n,&k);
  set<string> course[k];
  for(int i=0;i<k;i++){
  	int index,num;
  	scanf("%d %d",&index,&num);
  	for(int j=0;j<num;j++){
  		string name;
  		cin>>name;
  		course[index-1].insert(name);
	  }
  }
  string names[n];
  for(int i=0;i<n;i++){
  	string name;
  	cin >> name;
  	names[i]=name;
  }
  for(int i=0;i<n;i++){
  	vector<int> v;
  	for(int j=0;j<k;j++){
  		set<string>::iterator it=course[j].find(names[i]);
  		if(it!=course[j].end()){
  			v.push_back(j+1);
		  }
	  }
  	cout << names[i]<< " " << v.size();
  	for(int j=0;j<v.size();j++)
  	printf(" %d",v[j]);
  	printf("\n");
  }
  return 0;
}   

这样做的话最后一个测试点会超时,看了答案之后发现是不能用string和cin、cout,因此得采用将学生的姓名转换成数字的形式处理,也就是字符串hash。

cpp 复制代码
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;

const int M=26*26*26*10+1;
vector<int> ans[M];
int getID(char name[]){
    int id=0;
    for(int i=0;i<3;i++){
        id=id*26+(name[i]-'A');
    }
    id=id*10+(name[3]-'0');
    return id;
}



int main(void){
    int n,k;
    while(scanf("%d%d",&n,&k)!=EOF){
        for(int i=1;i<=k;i++){
            int course,ni;
            scanf("%d%d",&course,&ni);
            for(int j=1;j<=ni;j++){
                char name[4];
                int id;
                scanf("%s",name);
                id = getID(name);
                ans[id].push_back(course);
            }
        }
        for(int i=0;i<n;i++){
            char name[4];
            scanf("%s",name);
            int id=getID(name);
            sort(ans[id].begin(),ans[id].end());
            printf("%s %d",name,(int)ans[id].size());
            for(int j=0;j<ans[id].size();j++){
                printf(" %d",ans[id][j]);
            }
            printf("\n");

        }
        
    }
}
相关推荐
潇洒畅想2 分钟前
1.1 从∑到∫:用循环理解求和与累积
java·数据结构·python·算法
郝学胜-神的一滴32 分钟前
[简化版 GAMES 101] 计算机图形学 04:二维变换上
c++·算法·unity·godot·图形渲染·unreal engine·cesium
ZC跨境爬虫32 分钟前
海南大学交友平台开发实战day7(实现核心匹配算法+解决JSON请求报错问题)
前端·python·算法·html·json
来日可期131433 分钟前
C/C++ 反常识记录(1)—— 那些容易踩坑的语法细节
c语言·开发语言·c++
计算机安禾37 分钟前
【数据结构与算法】第41篇:图论(五):拓扑排序与关键路径
c语言·数据结构·c++·算法·图论·visual studio
Q741_14739 分钟前
每日一题 力扣 1320. 二指输入的的最小距离 动态规划 C++ 题解
c++·算法·leetcode·动态规划
实心儿儿41 分钟前
C++ —— C++11(2)
开发语言·c++
加油JIAX41 分钟前
C++11特性
c++
wfbcg1 小时前
每日算法练习:LeetCode 76. 最小覆盖子串 ✅
算法·leetcode·职场和发展
Wect1 小时前
LeetCode 149. 直线上最多的点数:题解深度剖析
前端·算法·typescript