Task: | Merkkijonot |
Sender: | TrixterTheTux |
Submission time: | 2019-10-10 19:35:58 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 46 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 15 |
#2 | ACCEPTED | 31 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.02 s | 2, 3 | details |
#3 | ACCEPTED | 0.28 s | 3 | details |
#4 | TIME LIMIT EXCEEDED | -- | 3 | details |
#5 | ACCEPTED | 0.04 s | 3 | details |
#6 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#7 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#8 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#9 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#10 | ACCEPTED | 0.02 s | 2, 3 | details |
#11 | ACCEPTED | 0.02 s | 2, 3 | details |
#12 | ACCEPTED | 0.02 s | 2, 3 | details |
#13 | ACCEPTED | 0.02 s | 2, 3 | details |
#14 | ACCEPTED | 0.02 s | 2, 3 | details |
#15 | ACCEPTED | 0.29 s | 3 | details |
#16 | ACCEPTED | 0.29 s | 3 | details |
#17 | ACCEPTED | 0.29 s | 3 | details |
#18 | ACCEPTED | 0.29 s | 3 | details |
#19 | ACCEPTED | 0.29 s | 3 | details |
#20 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#21 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#22 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#23 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#24 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
Code
#include <vector> #include <map> #include <unordered_map> #include <iostream> #include <string> int main() { std::string cur; std::map<size_t, std::unordered_map<std::vector<bool>, size_t>> map; size_t amount; std::cin >> amount; for(size_t i = 0; i < amount; i++) { std::cin >> cur; auto c_str = cur.c_str(); size_t len = cur.length(); std::vector<bool> bitfield((len * (len - 1)) / 2); size_t n = 0; for(size_t a = 0; a < len - 1; a++) { for(size_t b = a + 1; b < len; b++) { bitfield[n++] = c_str[a] == c_str[b]; } } auto search = map.find(len); if(search == map.end()) { std::unordered_map<std::vector<bool>, size_t> lookup; lookup[bitfield] = 0; map[len] = lookup; continue; } auto lookup = search->second.find(bitfield); if(lookup == search->second.end()) { search->second[bitfield] = 0; } else { search->second[bitfield]++; } } size_t matches = 0; for(auto& mapit : map) { for(auto& addit : mapit.second) { matches += (addit.second * (addit.second + 1)) / 2; } } std::cout << matches << std::endl; return 0; }
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
20 FFDISOVJLPIASANJRBHQXJVW HBGVRZFWOTAAVUPYKMKXAOBEYUE JKHXTPHUKTLTLNXMXMSYYFLF HCSZMXTZCUFHIHSTEWKHCFZRTXU ... |
correct output |
---|
20 |
user output |
---|
20 |
Test 2
Group: 2, 3
Verdict: ACCEPTED
input |
---|
5000 AJEDROEDXRGDUSDAPZBXXQBPJ PDGCTAGCRTBCJICPFELRRMLFD TISAOTGMDKUCITIEFQVCSBZJYUUO FMASVJYFPMELSVLQWFZVLVMSPHYL ... |
correct output |
---|
2178556 |
user output |
---|
2178556 |
Test 3
Group: 3
Verdict: ACCEPTED
input |
---|
100000 RESKYADLVRSDCDXJVECAJCAP CZLIWDHKVNRJHZINHFBOQEPN LSTRSDTLADUIWXFQJSQPVRSPBCTZ QEMSZOQSSVBRNQTCLJQIGVQO ... |
correct output |
---|
404880850 |
user output |
---|
404880850 |
Test 4
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA... |
correct output |
---|
4999950000 |
user output |
---|
(empty) |
Test 5
Group: 3
Verdict: ACCEPTED
input |
---|
100000 IPI Q SPGV UNYE ... |
correct output |
---|
1041990627 |
user output |
---|
1041990627 |
Test 6
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
20 A B C D ... |
correct output |
---|
190 |
user output |
---|
190 |
Test 7
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
1 A |
correct output |
---|
0 |
user output |
---|
0 |
Test 8
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
20 A BB CCC DDDD ... |
correct output |
---|
0 |
user output |
---|
0 |
Test 9
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
2 A A |
correct output |
---|
1 |
user output |
---|
1 |
Test 10
Group: 2, 3
Verdict: ACCEPTED
input |
---|
5000 SEKNHNRHSRFYIHSCDPGXPTGUSYBFKZ... |
correct output |
---|
20861 |
user output |
---|
20861 |
Test 11
Group: 2, 3
Verdict: ACCEPTED
input |
---|
5000 UGPWHWOWAREEIROZTRJGUCKDKTZJEO... |
correct output |
---|
22818 |
user output |
---|
22818 |
Test 12
Group: 2, 3
Verdict: ACCEPTED
input |
---|
5000 FFQQCBCINBDWIKHFPO SCJU DNHYPGIQNZS KNQCYRAXHHKORXMOVHL ... |
correct output |
---|
22268 |
user output |
---|
22268 |
Test 13
Group: 2, 3
Verdict: ACCEPTED
input |
---|
5000 QVWMSYPWXWBBXWCVEOUAVQLDWNBXZB... |
correct output |
---|
22589 |
user output |
---|
22589 |
Test 14
Group: 2, 3
Verdict: ACCEPTED
input |
---|
5000 JYORMNQAKXHNRBWGGSMWXWXMBKPBZU... |
correct output |
---|
20482 |
user output |
---|
20482 |
Test 15
Group: 3
Verdict: ACCEPTED
input |
---|
100000 DCXXVIEYQAASZJYUUVYZUIJFGVBAYC... |
correct output |
---|
8925377 |
user output |
---|
8925377 |
Test 16
Group: 3
Verdict: ACCEPTED
input |
---|
100000 IJZHBIYNWQBDWNGZWVXJKXXWFVLPQX... |
correct output |
---|
8907840 |
user output |
---|
8907840 |
Test 17
Group: 3
Verdict: ACCEPTED
input |
---|
100000 GWUGLGQDAYGGJROIAKBMMICQMDUQQQ... |
correct output |
---|
8771809 |
user output |
---|
8771809 |
Test 18
Group: 3
Verdict: ACCEPTED
input |
---|
100000 SWVSVXURRSLCSHCPAKWESIPCNDKYLD... |
correct output |
---|
8704480 |
user output |
---|
8704480 |
Test 19
Group: 3
Verdict: ACCEPTED
input |
---|
100000 ZLSNSZBGIMCOLPDEAKVDAJCTMBNRLH... |
correct output |
---|
8672362 |
user output |
---|
8672362 |
Test 20
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
20 AAB D CDBAA D ... |
correct output |
---|
15 |
user output |
---|
15 |
Test 21
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
20 A CDD AABBC DBCB ... |
correct output |
---|
15 |
user output |
---|
15 |
Test 22
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
20 ACADD CDDCD DACA CCDCA ... |
correct output |
---|
17 |
user output |
---|
17 |
Test 23
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
20 DCDA BDBA CACBD BA ... |
correct output |
---|
7 |
user output |
---|
7 |
Test 24
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
20 DDA BBCDC DDD CCD ... |
correct output |
---|
14 |
user output |
---|
14 |