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

    Zhejiang University has 40000 students and provides 2500 courses. Now given the student name lists of all the courses, you are supposed to output the registered course list for each student who comes for a query.

    Input Specification:

    Each input file contains one test case. For each case, the first line contains 2 positive integers: N (<=40000), the number of students who look for their course lists, and K (<=2500), the total number of courses. Then the student name lists are given for the courses (numbered from 1 to K) in the following format: for each course i, first the course index i and the number of registered students Ni (<= 200) are given in a line. Then in the next line, Ni student names are given. A student name consists of 3 capital English letters plus a one-digit number. Finally the last line contains the N names of students who come for a query. All the names and numbers in a line are separated by a space.

    Output Specification:

    For each test case, print your results in N lines. Each line corresponds to one student, in the following format: first print the student's name, then the total number of registered courses of that student, and finally the indices of the courses in increasing order. The query results must be printed in the same order as input. All the data in a line must be separated by a space, with no extra space at the end of the line.

    Sample Input:

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

    Sample Output:

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

    解题思路:先把字符串离散化,然后在用vector<int>v[max]来存储数据,这样处理后,查找时即O(1)时间。
    #include<iostream>
    #include<cstring>
    #include<cstdio>
    #include<algorithm>
    #include<vector>
    using namespace std;
    int N,K;
    vector<int>course[200000];
    int change(char* a){
    	int sum=0;
    	sum=(a[0]-'A')*26*26*10+(a[1]-'A')*26*10+(a[2]-'A')*10+(a[3]-'0');
    	return sum;
    }
    int main(){
    	scanf("%d%d",&N,&K);
    	string str;
    	int i,j;
    	int id;
    	int num;
    	char name[5];
    	for(i=0;i<K;i++){
    		scanf("%d%d",&id,&num);
    		getchar();
    		for(j=0;j<num;j++){
    			scanf("%s",name); 
    			int index=change(name);
    			course[index].push_back(id);
    		}
    	}
    	getchar();
    	for(i=0;i<N;i++){
    		scanf("%s",name);
    		int key=change(name);
    		printf("%s",name);
    		int size=course[key].size();
    		printf(" %d",size);
    		sort(course[key].begin(),course[key].end());
    		for(int t=0;t<size;t++){
    			printf(" %d",course[key][t]);
    		}
    		printf("
    ");
    	}
    	return 0;
    }
    

      



  • 相关阅读:
    缓冲区溢出学习笔记 一
    什么是TNotifyEvent(转)
    Delphi中dll的使用(转)
    bash 编程
    感觉自己真的很幸运
    开始写程序,发现自己很弱智
    你是我心中不变的新绿(转载)
    做一次年度总结和清理
    今天简直成精力狂了^_^
    Double Do weeks Again : )
  • 原文地址:https://www.cnblogs.com/grglym/p/7743949.html
Copyright © 2011-2022 走看看