• 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<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<vector>
    #include<map>
    using namespace std;
    int change(string s){
    	return (s[0]-'A')*26*26*10+(s[1]-'A')*26*10+(s[2]-'A')*10+s[3]-'0';
    }
    int main(){
    	int n,k;
    	scanf("%d%d",&n,&k);
    	vector<int>v[2502];
    	string s;
    	int i,j,t,key;
    	for(i=0;i<n;i++){
    		cin>>s>>t;
    		for(j=0;j<t;j++){
    			scanf("%d",&key);
    			v[key].push_back(change(s));
    		}
    	}
    	for(i=1;i<=k;i++){
    		sort(v[i].begin(),v[i].end());
    		int len=v[i].size();
    		printf("%d %d
    ",i,len);
    		for(vector<int>::const_iterator it = v[i].begin();it!=v[i].end();it++){
    			//cout<<char(*it/(26*26*10))<<char(*)<<endl;
    			int value = *it;
    			char c = (value)/(26*26*10)+'A';
    			printf("%c",c);
    			value%=(26*26*10);
    			c=(value)/(26*10)+'A';
    			printf("%c",c);
    			value%=(26*10);
    			c=(value)/(10)+'A';
    			printf("%c",c);
    			value%=(10);
    			c=value+'0';
    			printf("%c
    ",c);
    		}
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    LA3523 二分图和点双连通分量的综合性质及证明
    LA4127计算几何+离散化+点覆盖
    LA 4728凸包算法-旋转卡壳的直径
    UVA 11168凸包+距离公式
    UVA 10652凸包+面的旋转
    UVA10969计算几何+交叉圆形成的圆弧长
    LA3485二分+求解积分方程+辛普森算法计算积分
    LA5009三分法
    UVA10341幂函数零点的通解分析
    UVA11524构造系数数组+高斯消元解异或方程组
  • 原文地址:https://www.cnblogs.com/grglym/p/7763062.html
Copyright © 2020-2023  润新知