zoukankan      html  css  js  c++  java
  • PAT 1047. Student List for Course

    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
    

    分析
    起先用set做的,最后一个点超时了。

    #include<iostream>
    #include<vector>
    #include<string.h>
    #include<algorithm> 
    using namespace std;
    char name[40008][5];
    vector<int> courses[2508];
    bool cmp(int a,int b){
    	return strcmp(name[a],name[b])<0;
    }
    int main(){
        int n,k,cnt,course;
        cin>>n>>k;
    	for(int i=1;i<=n;i++){
    		scanf("%s %d",name[i],&cnt);
    		for(int j=1;j<=cnt;j++){
    			scanf("%d",&course);
    			courses[course].push_back(i);
    		}
    	}	
    	for(int i=1;i<=k;i++){
    		printf("%d %d
    ",i,courses[i].size());
    		sort(courses[i].begin(),courses[i].end(),cmp);
    		for(int j=0;j<courses[i].size();j++)
    		    printf("%s
    ",name[courses[i][j]]);
    	}
    	return 0;
    }
    
  • 相关阅读:
    spring @Async异步方法使用及原理说明
    表达式树使用(一)
    Solr.NET快速入门(九)【二进制文档上传】【完】
    Solr.NET快速入门(八)【多核多实例,映射验证】
    Solr.NET快速入门(七)【覆盖默认映射器,NHibernate集成】
    Solr.NET快速入门(五)【聚合统计,分组查询】
    Solr.NET快速入门(四)【相似查询,拼写检查】
    Solr.NET快速入门(三)【高亮显示】
    Solr.NET快速入门(二)
    Solr快速入门(一)
  • 原文地址:https://www.cnblogs.com/A-Little-Nut/p/8328153.html
Copyright © 2011-2022 走看看