1047. Student List for Course (25)

1047. Student List for Course (25)

时间限制
400 ms
内存限制
64000 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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

这道题最后一个测试点会卡运行时间,好的处理方法是将string转换成数字,因为名字长度格式确定,所以这个映射比较好建立,对数字的排序快于对字符串的排序。贴两种代码。

#include<iostream>  
#include<vector>  
#include<map>  
#include<stdio.h>  
#include<algorithm>  
#include<string>  
using namespace std;  
int main(){  
    for (int student_num, course_num; scanf("%d%d", &student_num, &course_num) != EOF;){  
        vector<vector<int>>stu_list(course_num+1);  
        while (student_num--){  
            char name[5];  
            scanf("%s", name);  
            int index = (name[0] - 'A') * 26 * 26 * 10 + (name[1] - 'A') * 26 * 10 + (name[2] - 'A') * 10 + (name[3] - '0');  
            int register_num;  
            scanf("%d", &register_num);  
            int course_id;  
            while (register_num--){  
                scanf("%d", &course_id);  
                stu_list[course_id].push_back(index);  
            }  
        }  
        for (int i = 1; i < course_num + 1; i++){  
            cout << i << " " << stu_list[i].size() << endl;  
            sort(stu_list[i].begin(), stu_list[i].end());  
            for (int j = 0; j < stu_list[i].size(); j++){  
                printf("%c%c%c%c\n", stu_list[i][j] / (26 * 26 * 10) + 'A',  
                    (stu_list[i][j]%(26*26*10))/(26*10) + 'A',  
                    (stu_list[i][j]%(26*10))/10 +'A',  
                    (stu_list[i][j]%(10)) + '0');  
            }  
        }  
    }  
    return 0;  
}  


#include<iostream>
#include<fstream>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;
#define inf 10000000

int main()
{
	//ifstream fin("Text.txt");
	int N, M,i,j,k,tmp;
	cin >> N >> M;
	vector<vector<string>>course;
	course.resize(M);
	string name;
	for (i = 0; i < N; i++)
	{
		cin >> name>>k;
		for (j = 0; j < k; j++)
		{
			cin >> tmp;
			course[tmp-1].push_back(name);
		}
	}
	for (i = 0; i < M; i++)
	{
		sort(course[i].begin(), course[i].end());
		cout << i + 1 << " "<<course[i].size() << endl;
		for (j = 0; j < course[i].size(); j++)
			cout << course[i][j] << endl;
	}
	
	
	//cin.get();
	return 0;

}

阅读更多

没有更多推荐了,返回首页