这个题用 map对string存储数据就会变得简单很多,我一开始没注意题目要求,还要输出标题,感觉自己测试的没问题,结果测试点全错,后来仔细看了一下才发现问题所在,加上输出标题以后直接AC,并且代码效率很过关。
附本人AC代码:
#include<iostream>
#include<string>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;
map<string, vector<int>>Mtitle,Mauthor,Mkey,Mpublish,Myear;
int main() {
int N, id;
string s;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &id);
cin.ignore();
getline(cin, s);
Mtitle[s].push_back(id);
getline(cin, s);
Mauthor[s].push_back(id);
getline(cin, s);
Mkey[s].push_back(id);
getline(cin, s);
Mpublish[s].push_back(id);
getline(cin, s);
Myear[s].push_back(id);
}
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d:", &id);
cin.ignore();
getline(cin, s);
printf("%d: %s\n",id, s.c_str());
if (id == 1) {
if (Mtitle[s].size() == 0) {
printf("Not Found\n");
continue;
}
sort(Mtitle[s].begin(), Mtitle[s].end());
for (int j = 0; j < Mtitle[s].size(); j++) {
printf("%07d\n", Mtitle[s][j]);
}
}
else if (id == 2) {
if (Mauthor[s].size() == 0) {
printf("Not Found\n");
continue;
}
sort(Mauthor[s].begin(), Mauthor[s].end());
for (int i = 0; i < Mauthor[s].size(); i++) {
printf("%07d\n",Mauthor[s][i]);
}
}
else if (id == 3) {
vector<int>tmp;
for (auto it = Mkey.begin(); it != Mkey.end(); it++) {
if (it->first.find(s) != string::npos) {
for (int j = 0; j < it->second.size(); j++)tmp.push_back(it->second[j]);
}
}
if (tmp.size() == 0) {
printf("Not Found\n");
continue;
}
sort(tmp.begin(), tmp.end());
for (int i = 0; i < tmp.size(); i++)printf("%07d\n", tmp[i]);
}
else if (id == 4) {
if (Mpublish[s].size() == 0) {
printf("Not Found\n");
continue;
}
sort(Mpublish[s].begin(), Mpublish[s].end());
for (int j = 0; j < Mpublish[s].size(); j++) {
printf("%07d\n", Mpublish[s][j]);
}
}
else if (id == 5) {
if (Myear[s].size() == 0) {
printf("Not Found\n");
continue;
}
sort(Myear[s].begin(), Myear[s].end());
for (int j = 0; j < Myear[s].size(); j++) {
printf("%07d\n", Myear[s][j]);
}
}
}
return 0;
}