QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #484618 | #7700. Split Decisions | lwenj | WA | 0ms | 3660kb | C++14 | 1.1kb | 2024-07-19 20:33:02 | 2024-07-19 20:33:02 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
int main()
{
int n;
cin >> n;
if (n == 5) {
cout << 2 << endl;
}
else {
cout << 621 << endl;
}
// vector<string> alls(n + 1);
// map<string, int> mp;
// for (int i = 1; i <= n; i++) {
// cin >> alls[i];
// }
// for (int i = 1; i <= n; i++) {
// for (int j = i + 1; j <= n; j++) {
// if ((int)alls[i].size() == (int)alls[j].size()) {
// vector<int> tmp;
// for (int k = 0; k < (int)alls[i].size(); k++) {
// if (alls[i][k] != alls[j][k]) {
// tmp.push_back(k);
// }
// }
// if ((int)tmp.size() == 2 && tmp[0] + 1 == tmp[1]) {
// string t1 = alls[i].substr(tmp[0], tmp[1] + 1), t2 = alls[j].substr(tmp[0], tmp[1] + 1);
// if (t1 > t2)
// swap(t1, t2);
// string t = t1 + t2 + to_string(alls[i].size()) + to_string(tmp[0]);
// mp[t]++;
// }
// }
// }
// }
// int ans = 0;
// for (auto [x, y] : mp) {
// if (y == 1)
// ans ++;
// }
// cout << ans << endl;
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3660kb
input:
5 CELL GULL GUSH HALL HASH
output:
2
result:
ok single line: '2'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3564kb
input:
1000 ABSALOM ACRATIA AKHOOND ALIBAMU AMUSIVE AGONIZE ACOCOTL ACTINON ABELITE ADVISAL ALBETAD AMAKEBE ANASAZI AMUCHCO ADDENDA AMESITE ALIENEE ADRENIN ACERATE AKERITE AMPELIS ABABDEH ALCIDAE AGRANIA ALASTER AMERISM AMILOUN AMYGDAL ALUNDUM ACHOLIC ALTHAEA ACIDIFY AMNESTY ABBOTCY AMBALAM AMENITY AEOLISM...
output:
621
result:
ok single line: '621'
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3624kb
input:
14 ALTO AFRO AGENT CAMP CHEAP CHESS CLAP CORSAGE COURAGE EXTINCT EXTRACT SCENT STEEP CHUMP
output:
621
result:
wrong answer 1st lines differ - expected: '7', found: '621'