zoukankan      html  css  js  c++  java
  • codeup-Course List for Student

     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

    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

     1 #include <iostream>
     2 #include <vector>
     3 #include <algorithm>
     4 using namespace std;
     5 /*
     6 要使用cout 则必须引入 <iostream> 文件 
     7 其覆盖了 < stdio.h> 文件的内容 
     8 */
     9 
    10 vector<int> hashTable[26*26*26*10+10];
    11 
    12 int hashName(char s[]){
    13     int t=0;
    14     for(int i=0; i<3; i++){
    15         t = t * 26 + s[i] - 'A';
    16     }
    17     t = t * 10 + s[3] - '0';
    18     return t;
    19 }
    20 
    21 int main(){
    22     int N, K;
    23     scanf("%d %d", &N, &K);
    24     int cno, cnum, hashNo;
    25     char cname[5];
    26     while(K--){
    27         scanf("%d %d", &cno, &cnum);
    28         while(cnum--){
    29             scanf("%s", cname);
    30             hashNo = hashName(cname);
    31             hashTable[hashNo].push_back(cno);
    32         }
    33     }
    34     while(N--){
    35         scanf("%s", &cname);
    36         hashNo = hashName(cname);
    37         sort(hashTable[hashNo].begin(), hashTable[hashNo].end());
    38         printf("%s %d", cname, hashTable[hashNo].size());
    39         for(int i=0; i<hashTable[hashNo].size(); i++){
    40             printf(" %d", hashTable[hashNo][i]);
    41         }
    42         printf("
    ");
    43     }
    44     return 0;
    45 }
  • 相关阅读:
    神奇的C语言
    实现代码编辑器
    实现了一个简单的key-value存储系统
    一些官网说明
    苹果用户转入mate30,被恶心到了
    吐嘈一下乱用注入
    谈一下OOP的乱用现象
    mongo3.x ssl版安装文件
    再谈LRU双链表内存管理
    cocos在win平台exe无法使用 UserDefault 解决方法
  • 原文地址:https://www.cnblogs.com/heyour/p/12149902.html
Copyright © 2011-2022 走看看