zoukankan      html  css  js  c++  java
  • A1047. 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
     1 #include <stdio.h>
     2 #include <stdlib.h>
     3 #include <iostream>
     4 #include <string.h>
     5 #include <string>
     6 #include <math.h>
     7 #include <algorithm>
     8 #include <vector>
     9 using namespace std;
    10 const int maxn=40010;
    11 const int maxc=2510;
    12 
    13 char  name[maxn][5];
    14 vector<int> course[maxc];
    15 
    16 bool cmp(int  a,int b)
    17 {
    18     return strcmp(name[a],name[b])<0;
    19 }
    20  
    21 int main(){
    22     int n,k;
    23     scanf("%d%d",&n,&k);
    24     for(int i=0;i<n;i++)
    25     {
    26         scanf("%s",name[i]);
    27         int r;
    28         scanf("%d",&r);
    29         for(int j=0;j<r;j++)
    30         {
    31             int temp;
    32             scanf("%d",&temp);
    33             course[temp].push_back(i);
    34         }
    35     }
    36     for(int i=1;i<=k;i++)
    37     {
    38         sort(course[i].begin(),course[i].end(),cmp);
    39         printf("%d %d
    ",i,course[i].size()); 
    40         for(int j=0;j<course[i].size();j++)
    41         {
    42             printf("%s
    ",name[course[i][j]]);
    43         }
    44     }
    45     
    46     return 0;
    47 }
  • 相关阅读:
    实时信号阻塞队列大小测试
    实时信号和非实时信号
    [Linux]关于sigprocmask函数的讨论
    java中Map集合的常用方法 (转)
    佛跳墙
    百万数据查询效率提高方法(转)
    bootstrap table 前后端分页(超级简单)
    bootstrap table 分页序号递增问题 (转)
    Spring boot+mybatis+thymeleaf 实现登录注册,增删改查
    js弹出对话框的三种方式(转)
  • 原文地址:https://www.cnblogs.com/ligen/p/4306836.html
Copyright © 2011-2022 走看看