QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #484648 | #7700. Split Decisions | lwenj | AC ✓ | 180ms | 22944kb | C++14 | 947b | 2024-07-19 20:50:49 | 2024-07-19 20:50:50 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
vector<string> alls(1e5 + 10);
map<string, int> mp;
int main()
{
int n;
cin >> n;
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], 2), t2 = alls[j].substr(tmp[0], 2);
if (t1 > t2)
swap(t1, t2);
string t = t1 + t2 + to_string(alls[i].size()) + to_string(tmp[0]) + to_string(tmp[1]);
mp[t]++;
}
}
}
}
int ans = 0;
for (auto [x, y] : mp) {
if (y == 1)
ans ++;
}
cout << ans << endl;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 5984kb
input:
5 CELL GULL GUSH HALL HASH
output:
2
result:
ok single line: '2'
Test #2:
score: 0
Accepted
time: 43ms
memory: 6688kb
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: 0
Accepted
time: 1ms
memory: 6004kb
input:
14 ALTO AFRO AGENT CAMP CHEAP CHESS CLAP CORSAGE COURAGE EXTINCT EXTRACT SCENT STEEP CHUMP
output:
7
result:
ok single line: '7'
Test #4:
score: 0
Accepted
time: 1ms
memory: 6112kb
input:
4 ABCD AEFD AGHD AIJD
output:
6
result:
ok single line: '6'
Test #5:
score: 0
Accepted
time: 0ms
memory: 6268kb
input:
3 ABABA AABBA ABBAA
output:
2
result:
ok single line: '2'
Test #6:
score: 0
Accepted
time: 0ms
memory: 6128kb
input:
3 AAAAA ABBAA AABBA
output:
2
result:
ok single line: '2'
Test #7:
score: 0
Accepted
time: 0ms
memory: 6256kb
input:
8 ABBA ACCA AABB AACC DBBD DCCD EEBB EECC
output:
0
result:
ok single line: '0'
Test #8:
score: 0
Accepted
time: 1ms
memory: 6068kb
input:
6 ABBA ACCA AABB AACC DBBD DCCD
output:
1
result:
ok single line: '1'
Test #9:
score: 0
Accepted
time: 0ms
memory: 6088kb
input:
4 ABBA ACCA AABB AACC
output:
2
result:
ok single line: '2'
Test #10:
score: 0
Accepted
time: 1ms
memory: 6128kb
input:
4 ABBA ACCA ABBAA ACCAA
output:
2
result:
ok single line: '2'
Test #11:
score: 0
Accepted
time: 0ms
memory: 6100kb
input:
100 CCBAEADDE CABCDE EDBCBEC BAEE EDADBBEBA BCAEC EABCE ADECB BEACCDECB DEDE BADDDAE BBBADBAED CDEBBC CAADCDEE EECD EAAAABA EAADAAC DDBACADDB DCCCCCB AADEDBC ACBAACBDB CDAAACCBC EEDCB CCEEBCEEE AEAABE BEDEAAACB DAECDB CACBBEB ABEBED ECEDAEE EDCEBBBADB BEACE EDBAADAE AABADC EBAA CDED ADABEA CBACCBC A...
output:
4
result:
ok single line: '4'
Test #12:
score: 0
Accepted
time: 1ms
memory: 6008kb
input:
20 AABCC BADCCCBA ADCEECBB DAEEDCB EAAC CDCEAEADC ADBBCDBBCA BBCABBECAE CEBAEAEB CCAAB EEDADEEB EADA CBBEA ABBDDCC BABADDA AEBDBCDBAD ACCCDDEAB AEDADEBA BCDED DBAB
output:
1
result:
ok single line: '1'
Test #13:
score: 0
Accepted
time: 2ms
memory: 6168kb
input:
250 AEGDGEAB GGEG BEEFFEDDF BBCA EGBC BABFDDAFA GGACGCCCBD DBFBF DDDCDG FAGAED FFBBAFCBF EAAEEEAAB GDAGBA AEBFFAD EGBGBBAAA FFGEGC DDBGAGADB EDEBB EABGBGF EFBEDBGD BFGGD CDGB CCEGABGFGB ACEFGEEBA GDAC GCEDAFBBA BFEFAFBGAA AEGD GGEACB CEFBGFAA GAADFG ADBD EABBGA FFFCE FDEGGFAAD AEEFBEE DCDCFFBD ACFDC...
output:
39
result:
ok single line: '39'
Test #14:
score: 0
Accepted
time: 1ms
memory: 6192kb
input:
30 CEBCBABB EADCEC CADEDDCBBB CAAE BBDCCEBEEA DBABADCAAA ACCDCECE CBBEDCCECA EACDDBB ECCCCDB BCDBDAECA DABD BECDAEE ACCBEBEA BBBDCBEAE DACCEDB BEEDBDB ABBAACCDAA DCBEB EECB ADEE ADEBCEDCBB ADADAECE DBCBD BBBE AEDEA AEAADD EAAEBE EBBA ABCA
output:
0
result:
ok single line: '0'
Test #15:
score: 0
Accepted
time: 1ms
memory: 6208kb
input:
40 CABBD BAABEA ADAEABCD BDCDEECACB DBABEB ECDBAAEE EDABABCEAB DBEADCADAC BBEBADBCC AADEBBCB CBAAACBEAE BDAC DCDCACD BACABDBCCA CEBEEEDDB BACC AEABCAAC ABECDDDDBC CADECB EAAAAAAE BDBECEEDBC AECB CABAECCE BCBAA DCCEBB ECCBEEC EECBEABE CDEAD DBABA BDAAED BCDEBCADEC BBCDBCAB EBDAE DEEACCB ECACDAA BCBCC...
output:
1
result:
ok single line: '1'
Test #16:
score: 0
Accepted
time: 1ms
memory: 5980kb
input:
7 ABC AEF BAB BEF ABA ACA AAB
output:
7
result:
ok single line: '7'
Test #17:
score: 0
Accepted
time: 4ms
memory: 6108kb
input:
642 AARON ABANDONED ABERDEEN ABILITIES ABILITY ABLE ABORIGINAL ABORTION ABOUT ABOVE ABRAHAM ABROAD ABSENCE ABSENT ABSOLUTE ABSOLUTELY ABSORPTION ABSTRACT ABSTRACTS ABUSE ACADEMIC ACADEMICS ACADEMY ACCENT ACCEPT ACCEPTABLE ACCEPTANCE ACCEPTED ACCEPTING ACCEPTS ACCESS ACCESSED ACCESSIBILITY ACCESSIBLE...
output:
240
result:
ok single line: '240'
Test #18:
score: 0
Accepted
time: 180ms
memory: 22944kb
input:
1499 AAAAAAAAAA AAAAABAAAA AAAAACAAAA AAAAADAAAA AAAAAEAAAA AAAAAFAAAA AAAAAGAAAA AAAAAHAAAA AAAAAIAAAA AAAAAJAAAA AAAAAKAAAA AAAAALAAAA AAAAAMAAAA AAAAANAAAA AAAAAOAAAA AAAAAPAAAA AAAAAQAAAA AAAAARAAAA AAAAASAAAA AAAAATAAAA AAAAAUAAAA AAAAAVAAAA AAAAAWAAAA AAAAAXAAAA AAAAAYAAAA AAAAAZAAAA AAAABAAAA...
output:
211250
result:
ok single line: '211250'