原题
A registration card number of PAT consists of 4 parts:
the 1st letter represents the test level, namely, T for the top level, A for advance and B for basic;
the 2nd - 4th digits are the test site number, ranged from 101 to 999;
the 5th - 10th digits give the test date, in the form of yymmdd;
finally the 11th - 13th digits are the testee’s number, ranged from 000 to 999.
Now given a set of registration card numbers and the scores of the card owners, you are supposed to output the various statistics according to the given queries.
Input Specification:
Each input file contains one test case. For each case, the first line gives two positive integers N (≤10
4
) and M (≤100), the numbers of cards and the queries, respectively.
Then N lines follow, each gives a card number and the owner’s score (integer in [0,100]), separated by a space.
After the info of testees, there are M lines, each gives a query in the format Type Term, where
Type being 1 means to output all the testees on a given level, in non-increasing order of their scores. The corresponding Term will be the letter which specifies the level;
Type being 2 means to output the total number of testees together with their total scores in a given site. The corresponding Term will then be the site number;
Type being 3 means to output the total number of testees of every site for a given test date. The corresponding Term will then be the date, given in the same format as in the registration card.
Output Specification:
For each query, first print in a line Case #: input, where # is the index of the query case, starting from 1; and input is a copy of the corresponding input query. Then output as requested:
for a type 1 query, the output format is the same as in input, that is, CardNumber Score. If there is a tie of the scores, output in increasing alphabetical order of their card numbers (uniqueness of the card numbers is guaranteed);
for a type 2 query, output in the format Nt Ns where Nt is the total number of testees and Ns is their total score;
for a type 3 query, output in the format Site Nt where Site is the site number and Nt is the total number of testees at Site. The output must be in non-increasing order of Nt’s, or in increasing order of site numbers if there is a tie of Nt.
If the result of a query is empty, simply print NA.
Sample Input:
8 4
B123180908127 99
B102180908003 86
A112180318002 98
T107150310127 62
A107180908108 100
T123180908010 78
B112160918035 88
A107180908021 98
1 A
2 107
3 180908
2 999
Sample Output:
Case 1: 1 A
A107180908108 100
A107180908021 98
A112180318002 98
Case 2: 2 107
3 260
Case 3: 3 180908
107 2
123 2
102 1
Case 4: 2 999
NA
大体翻译
考试ID的第一位是考场等级，分别有T、A、B
第二到四位是考场号，分别从101到999
第五到十位是考试日期，格式是yymmdd
第十一到十三位是考生的编号，从000到999
然后给M个问题，问题的格式为：Type Term
当Type为1时，Term是等级，有T、A、B三种输入，要求输出对应等级的所有考试ID和成绩，并按成绩非递增排序，若成绩相同，按考试ID非递减排序
当Type为2时，Term是考场编号，即ID中的二到四位，要求输出该考场的考试人数和总分
当Type为3时，Term是考试时间，即ID中的五到十位，要求输出在该天考试的每个考场的考试人数，按人数非递增排序，若人数相同，按考场编号非递减排序
大体思路
这道题我觉得考察的是STL容器
我的思路是：
建立结构体node，里面的数据有两个，一个是ID一个是成绩，以node为单位
建立三个map
第一个map，键是等级，值是node
第二个map，键是考场号，值是node
第三个map，键是考试成绩，值是node
在输入id和成绩的同时，将node投放入每个map对应的位置中
因此，map的定义为：
map<string,vector<node>> mp;
然后对应三个问题，从每个map中提取要求的vector，遍历，排序或计算和，最后输出
具体代码如下：
第一次编写
#include <iostream>
using namespace std;
#include <map>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <set>
typedef struct node
{
string id;
int score;
}node;
typedef struct pnode
{
string test;
int num;
}pnode;
node no_li[10001];
map<string, vector<node>> mp1;
map<string, vector<node>> mp2;
map<string, vector<node>> mp3;
bool cmp1(node a, node b)
{
if (a.score == b.score)
return a.id < b.id;
else
return a.score > b.score;
}
void type1(string term)//给定等级，输出对应等级的所有学生id和成绩
{
map<string, vector<node>>::iterator it;
it = mp1.find(term);
//cout << it->second.size() << endl;
if (it == mp1.end())
printf("NA\n");
else
{
sort(it->second.begin(), it->second.end(), cmp1);
for (int i = 0; i < it->second.size(); i++)
printf("%s %d\n", &it->second[i].id[0], it->second[i].score);
}
}
void type2(string term)
{
int sum = 0;
map<string, vector<node>>::iterator it;
it = mp2.find(term);
if (it == mp2.end())
printf("NA\n");
else
{
for (int i = 0; i < it->second.size(); i++)
sum += it->second[i].score;
printf("%d %d\n", it->second.size(), sum);
}
}
bool cmp2(pnode a, pnode b)
{
if (a.num == b.num)
return a.test < b.test;
else
return a.num > b.num;
}
void type3(string term)
{
int num = 0, j;
string temp;
map<string, vector<node>>::iterator it;
map<string, int> result;
pnode grade[10001];
it = mp3.find(term);
if (it == mp3.end())
printf("NA\n");
else
{
for (auto it2 = it->second.begin(); it2 != it->second.end(); it2++)
{
temp.assign(it2->id, 1, 3);
result[temp]++;
}
}
for (auto it3 = result.begin(); it3 != result.end(); it3++)
grade[num++] = { it3->first,it3->second };
sort(grade, grade + num, cmp2);
for (int i = 0; i < num; i++)
printf("%s %d\n", &grade[i].test[0], grade[i].num);
}
int main()
{
int n, k;
cin >> n >> k;
string id, temp;
int score;
for (int i = 0; i < n; i++)
{
cin >> id >> score;
no_li[i].id = id;
no_li[i].score = score;
temp.assign(id, 0, 1);
mp1[temp].push_back(no_li[i]);
temp.assign(id, 1, 3);
mp2[temp].push_back(no_li[i]);
temp.assign(id, 4, 6);
mp3[temp].push_back(no_li[i]);
}
int type;
string term;
for (int i = 0; i < k; i++)
{
cin >> type >> term;
printf("Case %d: %d %s\n", i + 1, type, &term[0]);
switch (type)
{
case 1:type1(term); break;
case 2:type2(term); break;
case 3:type3(term); break;
}
}
return 0;
}
提交结果
测试点3运行超时
我一开始以为是问题3处理不当导致的，后来才发现是问题2处理得太复杂了
因为问题2只需要每个考场的考生人数和总分就可以了
上述的代码意思就是把每个考试ID按照考场分配存入map，再从map里提取，遍历vector计算总人数和总分
若是在输入的时候，将考场编号从string转换为int，直接用数组进行记录，最后直接提取输出就可以了，这样省了很多时间
因此对上述代码进行修改，修改如下：
第二次编写
#include <iostream>
using namespace std;
#include <map>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <set>
#include <string>
typedef struct node
{
string id;
int score;
}node;
typedef struct pnode
{
string test;
int num;
}pnode;
node no_li[10001];
map<string, vector<node>> mp1;
map<string, vector<node>> mp2;
map<string, vector<node>> mp3;
//考场、问题2
int num[1010] = { 0 };//考场考试学生数
int sum[1010] = { 0 };//考场总分
bool cmp1(node a, node b)
{
if (a.score == b.score)
return a.id < b.id;
else
return a.score > b.score;
}
void type1(string term)//给定等级，输出对应等级的所有学生id和成绩
{
map<string, vector<node>>::iterator it;
it = mp1.find(term);
//cout << it->second.size() << endl;
if (it == mp1.end())
printf("NA\n");
else
{
sort(it->second.begin(), it->second.end(), cmp1);
for (int i = 0; i < it->second.size(); i++)
printf("%s %d\n", &it->second[i].id[0], it->second[i].score);
}
}
void type2(string term)
{
int site;
site = stoi(term);
if (num[site] == 0)
cout << "NA\n";
else
cout << num[site] << " " << sum[site] << endl;
}
bool cmp2(pnode a, pnode b)
{
if (a.num == b.num)
return a.test < b.test;
else
return a.num > b.num;
}
void type3(string term)
{
int num = 0, j;
string temp;
map<string, vector<node>>::iterator it;
map<string, int> result;
pnode grade[10001];
it = mp3.find(term);
if (it == mp3.end())
printf("NA\n");
else
{
for (auto it2 = it->second.begin(); it2 != it->second.end(); it2++)
{
temp.assign(it2->id, 1, 3);
result[temp]++;
}
}
for (auto it3 = result.begin(); it3 != result.end(); it3++)
grade[num++] = { it3->first,it3->second };
sort(grade, grade + num, cmp2);
for (int i = 0; i < num; i++)
printf("%s %d\n", &grade[i].test[0], grade[i].num);
}
int main()
{
int n, k;
cin >> n >> k;
string id, temp;
int score;
for (int i = 0; i < n; i++)
{
cin >> id >> score;
no_li[i].id = id;
no_li[i].score = score;
temp.assign(id, 0, 1);
mp1[temp].push_back(no_li[i]);
//temp.assign(id, 1, 3);
//mp2[temp].push_back(no_li[i]);//考场还是把考场号转换为数字，然后直接记录它的总分，不用把它存到map里再提取出来计算
int site;
site = stoi(string(id.begin() + 1, id.begin() + 4));
//cout << site << endl;
num[site]++;
sum[site] += score;
temp.assign(id, 4, 6);
mp3[temp].push_back(no_li[i]);
}
int type;
string term;
for (int i = 0; i < k; i++)
{
cin >> type >> term;
printf("Case %d: %d %s\n", i + 1, type, &term[0]);
switch (type)
{
case 1:type1(term); break;
case 2:type2(term); break;
case 3:type3(term); break;
}
}
return 0;
}
提交结果
112
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
