1047. Student List for Course (25)
来源:互联网 发布:网络搞笑剧有哪些 编辑:程序博客网 时间:2024/06/05 20:31
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 5ZOE1 2 4 5ANN0 3 5 2 1BOB5 5 3 4 2 1 5JOE4 1 2JAY9 4 1 2 5 4FRA8 3 4 2 5DON2 2 4 5AMY7 1 5KAT3 3 5 4 2LOR6 4 2 4 1 5Sample Output:
1 4ANN0BOB5JAY9LOR62 7ANN0BOB5FRA8JAY9JOE4KAT3LOR63 1BOB54 7BOB5DON2FRA8JAY9KAT3LOR6ZOE15 9AMY7ANN0BOB5DON2FRA8JAY9KAT3LOR6ZOE1
//还是空间换时间的思路 .. 一个个匹配超时。。//不能用string..得用char数组 ... 据说strcmp比string的compare要快。。不知道为什么..反正用string也是超时。。#include "iostream"#include "algorithm"#include "vector"#include "string"#include "cstring"using namespace std;vector<char*>v[2505];int cmp(char* a,char* b) {if (strcmp(a,b) < 0)return 1;return 0;}int main() {int n, k;int i, j;scanf("%d %d", &n, &k);for (i = 1; i <= n; i++) {char* name = new char[5];scanf("%s", name[i]);int c;scanf("%d",&c);for (j = 0; j < c; j++) {int b;scanf("%d", &b);;v[b].push_back(name);}}for (i = 1; i <= k; i++) {printf("%d %d\n", i, v[i].size());sort(v[i].begin(), v[i].end(), cmp);for (j = 0; j < v[i].size(); j++) {printf("%s\n", v[i][j]);}}for (i = 1; i <= k; i++) {for (j = 0; j < v[i].size(); j++) {delete[] v[i][j];}}return 0;}
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)-PAT
- 1047. Student List for Course (25)
- 【PAT】1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- PAT 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- PAT 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- C++写实拷贝
- 191. Number of 1 Bits
- forHTTPHeaderField
- 单纯形引理
- Android中IntentService与Service的区别
- 1047. Student List for Course (25)
- 统计基础和收益率
- kubernetes环境搭建(1) 一一 etcd集群搭建
- unique_ptr
- 孤儿进程
- 并查集:CDOJ1594-老司机的奇幻漂流 (食物链)
- 大数据 (六)Hadoop-HDFS Federation
- SpringMVC札集(05)——SpringMVC参数回显
- [机器学习入门] 李宏毅机器学习笔记-33 (Recurrent Neural Network part 2;循环神经网络 part 2)