CSES - Datatähti 2020 alku - Results
Submission details
Task:Merkkijonot
Sender:TrixterTheTux
Submission time:2019-10-07 10:35:46 +0300
Language:Python2 (PyPy2)
Status:READY
Result:46
Feedback
groupverdictscore
#1ACCEPTED15
#2ACCEPTED31
#30
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1, 2, 3details
#2ACCEPTED0.11 s2, 3details
#3ACCEPTED0.58 s3details
#4--3details
#5ACCEPTED0.15 s3details
#6ACCEPTED0.04 s1, 2, 3details
#7ACCEPTED0.04 s1, 2, 3details
#8ACCEPTED0.04 s1, 2, 3details
#9ACCEPTED0.04 s1, 2, 3details
#10ACCEPTED0.11 s2, 3details
#11ACCEPTED0.12 s2, 3details
#12ACCEPTED0.11 s2, 3details
#13ACCEPTED0.11 s2, 3details
#14ACCEPTED0.11 s2, 3details
#15ACCEPTED0.33 s3details
#16ACCEPTED0.33 s3details
#17ACCEPTED0.33 s3details
#18ACCEPTED0.36 s3details
#19ACCEPTED0.33 s3details
#20ACCEPTED0.04 s1, 2, 3details
#21ACCEPTED0.04 s1, 2, 3details
#22ACCEPTED0.04 s1, 2, 3details
#23ACCEPTED0.04 s1, 2, 3details
#24ACCEPTED0.04 s1, 2, 3details

Code

def optimizeChar(str, index):
    res = ''

    str_len = len(str)
    for j in range(index + 1, str_len):
        res += str[index] == str[j] and '1' or '0'

    return res

def harmonic(data, index, stopAt):
    sorted = dict()
    for x in data:
        optimized = optimizeChar(x, index)
        
        if not optimized in sorted:
            sorted[optimized] = list()

        sorted[optimized].append(x)
    
    res = 0
    for x in sorted:
        data = sorted[x]
        sorted_len = len(data)
        if sorted_len > 1:
            if index == stopAt:
                res += (sorted_len - 1) * sorted_len / 2
                break

            count = harmonic(data, index + 1, stopAt)
            if count > 0:
                res += count

    return res

def solve(input):
    res = 0

    for index in input:
        data = input[index]
        if len(data) < 2:
            continue

        sorted = dict()
        for x in data:
            optimized = optimizeChar(x, 0)
            
            if not optimized in sorted:
                sorted[optimized] = list()

            sorted[optimized].append(x)
        
        for x in sorted:
            data = sorted[x]
            if len(data) > 1:
                count = harmonic(data, 1, int(index))
                if count > 0:
                    res += count

    return res

count = int(raw_input())
input = dict()
for x in range(0, count):
    curInput = raw_input()
    str_len = str(len(curInput))
    if not str_len in input:
        input[str_len] = list()

    input[str_len].append(curInput)

print(solve(input))

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:

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