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");

        }
        
    }
}
相关推荐
甄卷43 分钟前
李沐动手学深度学习Pytorch-v2笔记【08线性回归+基础优化算法】2
pytorch·深度学习·算法
Ashlee_code44 分钟前
美联储降息趋缓叠加能源需求下调,泰国证券交易所新一代交易系统架构方案——高合规、强韧性、本地化的跨境金融基础设施解决方案
java·算法·金融·架构·系统架构·区块链·需求分析
屁股割了还要学1 小时前
【C语言进阶】内存函数
c语言·开发语言·学习·算法·青少年编程
每一天都要努力^2 小时前
C++拷贝构造
开发语言·c++
im_AMBER2 小时前
Leetcode 03 java
算法·leetcode·职场和发展
轮到我狗叫了2 小时前
力扣.1312让字符串成为回文串的最少插入次数力扣.105从前序和中序遍历构造二叉树牛客.拼三角力扣.57插入区间编辑
算法·leetcode·职场和发展
搂鱼1145142 小时前
离散与组合数学 杂记
算法
呆呆的小鳄鱼2 小时前
牛客:HJ24 合唱队[华为机考][最长递增子集][动态规划]
算法·华为·动态规划
weixin_449173652 小时前
基础算法题
算法
小O的算法实验室3 小时前
2024年ASOC SCI2区TOP,基于干扰模型的灰狼优化算法IIE-GWO+复杂丘陵地形农业无人机轨迹规划,深度解析+性能实测
算法·论文复现·智能算法改进