zoukankan      html  css  js  c++  java
  • 1047. Student List for Course (25)

    Zhejiang University has 40000 students and provides 2500 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 (<=40000), the total number of students, and K (<=2500), 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 (<=20) 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
    

    先把输入的数据存到结构体按照名字排序,然后整理到每项课程,最后直接输出。

    代码:
    #include <iostream>
    #include <algorithm>
    #include <cstdio>
    #include <set>
    #include <cstring>
    using namespace std;
    struct stu
    {
        char name[5];
        int course[20],num;
    }s[40000];
    bool cmp(stu a,stu b)
    {
        return strcmp(a.name,b.name) < 0;
    }
    char c[2501][1000][5];
    int cc[2501];
    int main()
    {
    
        int n,k;
        scanf("%d%d",&n,&k);
        for(int i = 0;i < n;i ++)
        {
            scanf("%s%d",s[i].name,&s[i].num);
            for(int j = 0;j < s[i].num;j ++)
            {
                scanf("%d",&s[i].course[j]);
            }
        }
        sort(s,s+n,cmp);
        for(int i = 0;i < n;i ++)
        {
            for(int j = 0;j < s[i].num;j ++)
            {
                strcpy(c[s[i].course[j]][cc[s[i].course[j]] ++],s[i].name);
            }
        }
        for(int i = 1;i <= k;i ++)
        {
            printf("%d %d
    ",i,cc[i]);
            for(int j = 0;j < cc[i];j ++)
                printf("%s
    ",c[i][j]);
        }
    }
  • 相关阅读:
    小米手机导出微信聊天记录
    IBM X3650 M4 微码升级(BIOS升级)
    leetcode1987 不同的好子序列数目
    leetcode1932 合并多棵二叉搜索树
    leetcode146 LRU 缓存机制
    leetcode456 132 模式
    leetcode316 去除重复字母
    GIT放弃本地所有修改,强制拉取更新
    vendor/easywechat-composer/easywechat-composer/src:
    微信公众号推广饿了么赏金红包制作
  • 原文地址:https://www.cnblogs.com/8023spz/p/8052140.html
Copyright © 2011-2022 走看看