1039. Course List for Student (25)【排序】——PAT (Advanced Level) Practise

最新推荐文章于 2020-02-13 12:01:32 发布

原创最新推荐文章于 2020-02-13 12:01:32 发布 · 753 阅读

0 ·

CC 4.0 BY-SA版权

本文为博主原创文章，转载请标明出处 http://blog.youkuaiyun.com/xianyun2009

文章标签：

#pat #1039 #排序 #hash

浙大PAT 同时被 2 个专栏收录

106 篇文章

订阅专栏

浙大Pat

106 篇文章

订阅专栏

本文详细阐述了解决Zhejiang大学学生课程注册列表查询问题的算法实现，包括输入输出规范、数据处理策略及关键步骤解析。

题目信息

1039. Course List for Student (25)

时间限制200 ms
内存限制65536 kB
代码长度限制16000 B

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 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

解题思路

排序，最后一个点会卡时，string会超时，hash后A掉（ps.排序我惯用set或map辅助，，，）

AC代码

#include <cstdio>
#include <vector>
#include <map>
#include <string>
#include <set>
using namespace std;
int main()
{
    int n, cn, cid, cidn, t;
    char s[5];
    map<int, set<int> > mp;
    scanf("%d%d", &n, &cn);
    for (int i = 0; i < cn; ++i){
        scanf("%d%d", &cid, &cidn);
        for (int j = 0; j < cidn; ++j){
            scanf("%s", s);
            t = (s[0]-'A')*26*26*10 + (s[1]-'A')*26*10 + (s[2]-'A')*10 + s[3]-'0';
            mp[t].insert(cid);
        }
    }
    for (int i = 0; i < n; ++i){
        scanf("%s", s);
        t = (s[0]-'A')*26*26*10 + (s[1]-'A')*26*10 + (s[2]-'A')*10 + s[3]-'0';
        printf("%s %d", s, mp[t].size());
        for (set<int>::iterator it = mp[t].begin(); it != mp[t].end(); ++it){
            printf(" %d", *it);
        }
        printf("\n");
    }
    return 0;
}