• 1047 Student List for Course


    Zhejiang University has 40,000 students and provides 2,500 courses. Now given the registered course list of each student, you are supposed to output the student name lists of all the courses.

    Input Specification:

    Each input file contains one test case. For each case, the first line contains 2 numbers: N (≤), the total number of students, and K (≤), the total number of courses. Then N lines follow, each contains a student's name (3 capital English letters plus a one-digit number), a positive number C (≤) which is the number of courses that this student has registered, and then followed by C course numbers. For the sake of simplicity, the courses are numbered from 1 to K.

    Output Specification:

    For each test case, print the student name lists of all the courses in increasing order of the course numbers. For each course, first print in one line the course number and the number of registered students, separated by a space. Then output the students' names in alphabetical order. Each name occupies a line.

    Sample Input:

    10 5
    ZOE1 2 4 5
    ANN0 3 5 2 1
    BOB5 5 3 4 2 1 5
    JOE4 1 2
    JAY9 4 1 2 5 4
    FRA8 3 4 2 5
    DON2 2 4 5
    AMY7 1 5
    KAT3 3 5 4 2
    LOR6 4 2 4 1 5
    
     

    Sample Output:

    1 4
    ANN0
    BOB5
    JAY9
    LOR6
    2 7
    ANN0
    BOB5
    FRA8
    JAY9
    JOE4
    KAT3
    LOR6
    3 1
    BOB5
    4 7
    BOB5
    DON2
    FRA8
    JAY9
    KAT3
    LOR6
    ZOE1
    5 9
    AMY7
    ANN0
    BOB5
    DON2
    FRA8
    JAY9
    KAT3
    LOR6
    ZOE1

    题意:

      给出一组学生的选课清单,让你给出选这门课的学生的名单。

    思路:

      这是一道简单的排序题,但是最后一组数据会卡超时。所以要使用scanf和printf来输入,输出。使用scanf输入的时候,要使用char[]。

    Code:

     1 #include <bits/stdc++.h>
     2 
     3 using namespace std;
     4 
     5 char name[40005][5];
     6 bool cmp(int a, int b) {
     7     if (strcmp(name[a], name[b]) < 0)
     8         return true;
     9     else
    10         return false;
    11 }
    12 
    13 int main() {
    14     int n, k, c, t;
    15     scanf("%d%d", &n, &k);
    16     vector<vector<int> > v(k + 1);
    17     for (int i = 0; i < n; ++i) {
    18         scanf("%s%d", name[i], &c);
    19         for (int j = 0; j < c; ++j) {
    20             scanf("%d", &t);
    21             v[t].push_back(i);
    22         }
    23     }
    24     for (int i = 1; i <= k; ++i) {
    25         printf("%d %d
    ", i, v[i].size());
    26         sort(v[i].begin(), v[i].end(), cmp);
    27         for (int j = 0; j < v[i].size(); ++j) printf("%s
    ", name[v[i][j]]);
    28     }
    29     return 0;
    30 }
    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    什么是桌面虚拟化,实施桌面虚拟化有什么好处?[转]
    运维工程师的职责和前景
    informix 中chunk/dbspace概念
    让用户体验决定桌面虚拟化成败
    专访运维与人才外包专家黄琨:运维工作最大的挑战是什么?
    PD与DBMS中的数据类型
    informix长事务的处理方式
    Oracle expdp/impdp导出导入命令及数据库备份(转)
    wpf的treeview显示item时候不能stretch的一个解决办法
    Jenkins 用户权限管理
  • 原文地址:https://www.cnblogs.com/h-hkai/p/12856933.html
Copyright © 2020-2023  润新知