题目
Input Specification:
Each input file contains one test case. For each case, the first line contains 2 numbers: N (≤40,000), the total number of students, and K (≤2,500), 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
文章大意
给出学生选的课程,统计每个课程对应学生
思路
这里主要参照柳神的思路,因为我写的超时了,我小菜鸡一个。
把每个学生姓名存于一个char数组里面,数组下标可以作为每个学生的学号(唯一的),创建一个vector数组(二维数组)存储课程信息和选课学生的学号,最后输出前对vector里面的每个课程的学生进行名称排序。
实现
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <vector>
using namespace std;
char name[40010][5];//存储名称,数组下标作为编号vector联动
vector<int> arr[2510];//定义2510容器数组表示课程和对应的学生名字
bool cmp(int a,int b) {
return strcmp(name[a], name[b]) < 0;//小于返回负数
}
int main()
{
//ios::sync_with_stdio(0);
//cin.tie(0);
int n = 0, k;
scanf("%d%d", &n, &k);
int c_total = 0;
int course;
for (int i = 0; i < n; i++) {
scanf("%s", name[i]);//存入名称。下标为代号
scanf("%d", &c_total);
for (int j = 0; j < c_total; j++) {
scanf("%d",&course);
arr[course].push_back(i);//使用数组下标表示名字
}
}
for (int i = 1; i <= k; i++) {
printf("%d %d\n", i, arr[i].size());
sort(arr[i].begin(), arr[i].end(), cmp);
for (int j = 0; j < arr[i].size();j++) {
printf("%s\n",name[arr[i][j]]);
}
}
}
注意事项和总结
这里我开始用的map和set做的,但是超时了,最后看了柳神代码改为数组加vector实现的
收获
ios::sync_with_stdio(0);
cin.tie(0);
1.进行优化的时候,据说这两行代码可以改善cin和cout的性能
2.printf("%s\n",name[arr[i][j]]);
这个好像可以直接打印二维数组对应的列全部
3.strcmp(a,b) < 0
strcmp当a=b时返回0,a<b时返回负数, a>b时返回正数,可以作为字符串排序的cmp参数
一定要记得容器排序是begin()和end()