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

        }
        
    }
}
相关推荐
不会就选b1 小时前
C++补充部分(一)--lambda 表达式
开发语言·c++
罗西的思考7 小时前
【Agentic RL】Dressage Staleness 控制深度分析
人工智能·算法·机器学习
quaer7 小时前
弗洛伊德算法--判圈法寻找环的入口O(n) O(1)
数据结构·算法
丰色木夕8 小时前
Ubuntu22.04下源码编译安装USD-Brep
c++·ubuntu·nvidia·usd-brep
高晶9 小时前
无乘法器实现LC二阶滤波器:基于移位运算的快速算法与四种精度推导
算法·设计模式·程序员
ysbfsy9 小时前
大数计算思路
算法
高晶9 小时前
主从自动分配算法:平均值乘以设备数一半的选举基准值解析
算法·设计模式·程序员
学电子她就能回来吗9 小时前
LeetCode Hot 100|普通数组专题学习笔记(零基础版)
笔记·算法·leetcode
用户老李9 小时前
反向传播计算梯度举例
算法
niyongsheng9 小时前
多智能体连续时间内路径规划:AA-SIPP(m) 的 Rust 实现与算法
算法·rust·机器人