[ PAT-A ] 1039 Course List for Student (C++)

最新推荐文章于 2023-02-28 13:45:55 发布

顾_wolf

最新推荐文章于 2023-02-28 13:45:55 发布

阅读量213

点赞数

分类专栏： [算法编程]PAT-A 文章标签： PAT algorithm

本文链接：https://blog.csdn.net/S_zhicheng27/article/details/81912106

版权

[算法编程]PAT-A 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

题目描述

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 N~i~ (<= 200) are given in a line. Then in the next line, N~i~ 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

解题思路

题目大意
已知每门课选课学生的名单,现在给定一组学生名单,输出他们的所选课程的情况(所选课程总数+哪些课程(从小到大排序))
思路
因为时间限制在200ms之内,只能牺牲空间节约时间,且不能用string,cin,cout,所以采用哈希表处理将姓名字符串对应到整型

代码设计

//AC代码
//zhicheng
#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
// zhicheng
// August 21,2018
const int maxn=26*26*26*10+10;
vector<int> ma[maxn];// 记载每位学生选课情况
int getid(char* name)
{// HASH表
    int id=0;
    for(int i=0;i<3;i++) id=26*id+(name[i]-'A');
    id=id*10+(name[3]-'0');
    return id;
}
int main()
{
    freopen("1.in","r",stdin);
    int numb,cour;char name[4];
    for(scanf("%d %d",&numb,&cour);cour;cour--)
    {// 获取学生选课情况
        int id,stu_num;
        for(scanf("%d %d",&id,&stu_num);stu_num;stu_num--)
        {
            scanf("%s",name);
            ma[getid(name)].push_back(id);
        }
    }
    // 输出需要查询的学生的选课情况
    for(int i=0;i<numb;i++)
    {
        scanf("%s",name);printf("%s",name);
        int na=getid(name),len=ma[na].size();
        if(!len){printf(" 0\n");continue;}
        printf(" %d",len);
        sort(ma[na].begin(),ma[na].end());
        for(int i=0;i<len;i++) printf(" %d",ma[na][i]);
        printf("\n"); 
    }
    return 0;
}