CSES - Datatähti 2020 alku - Results
Submission details
Task:Merkkijonot
Sender:EeliH
Submission time:2019-09-30 21:56:58
Language:C++
Status:READY
Result:46
Feedback
groupverdictscore
#1ACCEPTED15
#2ACCEPTED31
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.15 s2, 3details
#3--3details
#4--3details
#5--3details
#6ACCEPTED0.01 s1, 2, 3details
#7ACCEPTED0.01 s1, 2, 3details
#8ACCEPTED0.01 s1, 2, 3details
#9ACCEPTED0.01 s1, 2, 3details
#10ACCEPTED0.04 s2, 3details
#11ACCEPTED0.04 s2, 3details
#12ACCEPTED0.04 s2, 3details
#13ACCEPTED0.04 s2, 3details
#14ACCEPTED0.04 s2, 3details
#15--3details
#16--3details
#17--3details
#18--3details
#19--3details
#20ACCEPTED0.01 s1, 2, 3details
#21ACCEPTED0.01 s1, 2, 3details
#22ACCEPTED0.01 s1, 2, 3details
#23ACCEPTED0.01 s1, 2, 3details
#24ACCEPTED0.01 s1, 2, 3details

Code

#pragma GCC optimize ("O3")

#include <algorithm>
#include <iostream>
#include <map>
#include <unordered_map>
#include <vector>

#define START 'A'

int main() {
    unsigned int count;
    std::cin >> count;
    std::vector<std::string> words;
    unsigned int duplicates = 0;
    for(unsigned int i = 0; i < count; i++) {
        std::string word;
        std::cin >> word;
        words.push_back(word);
    }
    for(unsigned int i = 0; i < count; i++) {
        std::string word = words[i];
        std::string int_word;
        unsigned int idx = 1;
        std::unordered_map<char, char> used_chars;
        for(char c: word) {
            if(used_chars[c] != 0) {
                int_word += (char) ((int) START + used_chars[c]);
            } else {
                used_chars[c] = idx;
                int_word += (char) (idx + START);
                idx++;
            }
        }
        words[i] = int_word;
        if(i == 0)
            continue;
        unsigned int hid_i = 1;
        while((signed int) (i - hid_i) >= 0) {
            if(words[i - hid_i] != int_word) {
                hid_i++;
                continue;
            }
            hid_i++;
            duplicates++;
        }
    }
    /*unsigned int idx = 1;
    for(auto const& word: words) {
        if(idx >= words.size())
            break;
        unsigned int hid_idx = 0;
        while(1) {
            if(words[hid_idx + idx] != word)
                break;
            hid_idx++;
            duplicates++;
        }
        idx++;
    }*/
    std::cout << duplicates << std::endl;
}

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:

input
100000
RESKYADLVRSDCDXJVECAJCAP
CZLIWDHKVNRJHZINHFBOQEPN
LSTRSDTLADUIWXFQJSQPVRSPBCTZ
QEMSZOQSSVBRNQTCLJQIGVQO
...

correct output
404880850

user output
(empty)

Test 4

Group: 3

Verdict:

input
100000
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
4999950000

user output
(empty)

Test 5

Group: 3

Verdict:

input
100000
IPI
Q
SPGV
UNYE
...

correct output
1041990627

user output
(empty)

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:

input
100000
DCXXVIEYQAASZJYUUVYZUIJFGVBAYC...

correct output
8925377

user output
(empty)

Test 16

Group: 3

Verdict:

input
100000
IJZHBIYNWQBDWNGZWVXJKXXWFVLPQX...

correct output
8907840

user output
(empty)

Test 17

Group: 3

Verdict:

input
100000
GWUGLGQDAYGGJROIAKBMMICQMDUQQQ...

correct output
8771809

user output
(empty)

Test 18

Group: 3

Verdict:

input
100000
SWVSVXURRSLCSHCPAKWESIPCNDKYLD...

correct output
8704480

user output
(empty)

Test 19

Group: 3

Verdict:

input
100000
ZLSNSZBGIMCOLPDEAKVDAJCTMBNRLH...

correct output
8672362

user output
(empty)

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