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 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 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
题意
给出各个课程选课的学生列表和若干个查询,输出每个查询的学生的姓名、课程总数、课程序号(按升序排列)。
思路
使用map<string, vector>来存储数据,读取前先排序即可。
代码
#include <cstdio>
#include <map>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
// 读取输入
int N, K;
scanf("%d %d", &N, &K);
map<string, vector<int>> data;
string name;
for(int i = 0,j, L; i < K; i++){
scanf("%d %d", &j, &L);
for(int k = 0; k < L; k++){
cin >> name;
data[name].push_back(j);
}
}
// 遍历输出结果
vector<int> *v = NULL;
for(int i = 0; i < N; i++){
cin >> name;
v = &data[name];
// 输出每个学生的课程序号之前要排序
sort(v->begin(), v->end());
// 输出学生名称和课程总数
printf("%s %ld", name.c_str(), v->size());
// 输出课程序号
for(auto lt = v->cbegin(); lt != v->cend(); lt++){
printf(" %d", *lt);
}
putchar('\n');
}
return 0;
}
本博客介绍浙江大学的一道编程题目,要求根据学生选课数据,为查询的学生列出他们所选的课程列表。输入包含学生数、课程数以及各个课程的学生名册,输出每个查询学生的姓名、选课数量和课程序号。解决方案采用map数据结构存储,按学生姓名排序并输出结果。

被折叠的 条评论
为什么被折叠?



