1047. Student List for Course (25)
来源:互联网 发布:mac os x 开机启动项 编辑:程序博客网 时间:2024/05/18 13:24
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 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
题解:模拟即可.
#include <cstdio>#include <algorithm>#include <vector>#include <map>using namespace std;int get_id(char* str) { return (str[0] - 'A') * 26 * 260 + (str[1] - 'A') * 260 + (str[2] - 'A') * 10 + (str[3] - '0');}void show_name(const int& id) { printf("%c%c%c%c\n", 'A' + id / 26 / 260, 'A' + (id % (26 * 260)) / 260, 'A' + (id / 10) % 26, '0' + (id % 10));}int main() { map<int, vector<int> >mp; int n, m; char name[5]; scanf("%d%d", &n, &m); while (n--) { int num, course; scanf("%s%d", name, &num); int id = get_id(name); while (num--) { scanf("%d", &course); mp[course].push_back(id); } } for (int i = 1; i <= m; ++i) { printf("%d %ld\n", i, mp[i].size()); sort(mp[i].begin(), mp[i].end()); for (int j = 0; j < mp[i].size(); ++j) show_name(mp[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)
- 【Python】用zip函数求欧氏距离、余弦相似度
- 《leetCode》:Word Search
- 用lambda作为函数的指针
- Java基础概要(一)
- Android数据持久化功能之一:文件存储
- 1047. Student List for Course (25)
- Volley上传文件
- crash reporting
- google material design ( 1 )
- 转载Python学习笔记
- toolbar的使用
- make
- duplicate symbols for architecture x86_64
- OpenCV Mat 结构