CSES - Datatähti 2019 alku - Results
Submission details
Task:Leimasin
Sender:SMemsky
Submission time:2018-10-02 16:30:08 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.01 s1details
#20.01 s1details
#30.02 s1details
#40.02 s1details
#5ACCEPTED0.01 s1details
#60.01 s1details
#70.02 s1details
#80.01 s1details
#90.02 s1details
#10ACCEPTED0.02 s1details
#110.01 s1details
#120.01 s1details
#130.02 s1details
#140.01 s1details
#150.01 s2details
#160.03 s2details
#170.02 s2details
#180.02 s2details
#19ACCEPTED0.02 s2details
#200.02 s2details
#210.02 s2details
#220.02 s2details
#230.01 s2details
#24ACCEPTED0.02 s2details
#250.02 s2details
#260.01 s2details
#270.01 s2details
#280.01 s2details
#290.04 s3details
#300.02 s3details
#310.05 s3details
#320.01 s3details
#33ACCEPTED0.02 s3details
#340.02 s3details
#350.02 s3details
#360.03 s3details
#370.02 s3details
#38ACCEPTED0.01 s3details
#390.02 s3details
#400.03 s3details
#410.01 s3details
#420.01 s3details

Code

#include <bits/stdc++.h>

uint64_t findBestMatch(std::string const & brush, std::string const & painting) {
    uint64_t const max = painting.size() - brush.size() + 1;

    uint64_t longest = uint64_t(-1);
    uint64_t longestSize = 0;

    for (uint64_t i = 0; i < max; ++i) {
        uint64_t length = 0;
        bool ok = false;
        for (uint64_t j = 0; j < brush.size(); ++j) {
            if (brush[j] == painting[j + i] || painting[j + i] == '?') {
                ++length;
                if (painting[j + i] != '?') {
                    ok = true;
                }
            }
        }

        if (ok && length > longestSize) {
            longest = i;
            longestSize = length;
        }
    }

    return longest;
}

int main() {
    std::string painting, brush;

    std::cin >> painting;
    std::cin >> brush;

    std::string const target(painting.size(), '?');

    std::list<uint64_t> changes;

    while (painting != target) {
        auto result = findBestMatch(brush, painting);
        if (result == uint64_t(-1)) {
            std::cout << "-1" << std::endl;
            return 0;
        }

        changes.push_back(result);

        for (uint64_t i = 0; i < brush.size(); ++i) {
            painting[i + result] = '?';
        }
    }

    std::cout << changes.size() << std::endl;
    while (!changes.empty()) {
        std::cout << changes.back() + 1 << " ";
        changes.pop_front();
    }
}

Test details

Test 1

Group: 1

Verdict:

input
BBBBBBBBBB
B

correct output
10
10 9 8 7 6 5 4 3 2 1 

user output
10
10 10 10 10 10 10 10 10 10 10 

Test 2

Group: 1

Verdict:

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output
6
9 9 9 9 9 9 

Test 3

Group: 1

Verdict:

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
4
6 6 6 6 

Test 4

Group: 1

Verdict:

input
BAAAAAABBB
BAAAAAABB

correct output
2
2 1 

user output
2
2 2 

Test 5

Group: 1

Verdict: ACCEPTED

input
AAABBABBAA
AAABBABBAA

correct output
1

user output
1

Test 6

Group: 1

Verdict:

input
GGGGGGGGGG
G

correct output
10
10 9 8 7 6 5 4 3 2 1 

user output
10
10 10 10 10 10 10 10 10 10 10 

Test 7

Group: 1

Verdict:

input
QUUQUUQUQU
QU

correct output
6
9 7 5 4 2 1 

user output
6
9 9 9 9 9 9 

Test 8

Group: 1

Verdict:

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output
3
1 1 1 

Test 9

Group: 1

Verdict:

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output
2
2 2 

Test 10

Group: 1

Verdict: ACCEPTED

input
OETMIMPUPD
OETMIMPUPD

correct output
1

user output
1

Test 11

Group: 1

Verdict:

input
DOWEUOWUEU
DOWEU

correct output
-1

user output
3
6 6 6 

Test 12

Group: 1

Verdict:

input
JQZYVSIWTE
JQZVYSIWTE

correct output
-1

user output
1

Test 13

Group: 1

Verdict:

input
ABABABABA
ABA

correct output
4
7 5 3 1 

user output
4
7 7 7 7 

Test 14

Group: 1

Verdict:

input
AAAAAAAAAA
AAAAAAAAAB

correct output
-1

user output
1

Test 15

Group: 2

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

correct output
100
100 99 98 97 96 95 94 93 92 91...

user output
100
100 100 100 100 100 100 100 10...

Test 16

Group: 2

Verdict:

input
BABABAAAAAAAAAAAAAAAAAABABAAAA...

correct output
36
87 43 24 1 91 79 69 68 67 66 6...

user output
36
87 87 87 87 87 87 87 87 87 87 ...

Test 17

Group: 2

Verdict:

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

correct output
22
51 50 43 41 31 28 26 24 21 20 ...

user output
22
51 51 51 51 51 51 51 51 51 51 ...

Test 18

Group: 2

Verdict:

input
AAABABAAAABBBBBABABBAABBABABBA...

correct output
2
1 2 

user output
2
1 1 

Test 19

Group: 2

Verdict: ACCEPTED

input
AABABBBBBBAABBABABBBBBBAABBAAA...

correct output
1

user output
1

Test 20

Group: 2

Verdict:

input
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...

correct output
100
100 99 98 97 96 95 94 93 92 91...

user output
100
100 100 100 100 100 100 100 10...

Test 21

Group: 2

Verdict:

input
NNNININIMNIMKLMXCNIMKLMXCDEIMK...

correct output
18
1 2 3 74 5 79 58 7 84 64 37 10...

user output
18
74 74 74 74 74 74 74 74 74 74 ...

Test 22

Group: 2

Verdict:

input
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

correct output
3
51 2 1 

user output
3
51 51 51 

Test 23

Group: 2

Verdict:

input
IISNROLHLOJIWPTVFHFLUQRIROVLYP...

correct output
2
1 2 

user output
2
1 1 

Test 24

Group: 2

Verdict: ACCEPTED

input
WPMEMERJXXADLKONUZPUUFTPSXDHIV...

correct output
1

user output
1

Test 25

Group: 2

Verdict:

input
LNSBGZAWFJZAWFJWFJLNSBLNSBGZAL...

correct output
-1

user output
19
91 91 91 91 91 91 91 91 91 91 ...

Test 26

Group: 2

Verdict:

input
IPIPYFUMRIPYFUMRLPIIIPYFIPYFUM...

correct output
-1

user output
10
1 1 1 1 1 1 1 1 1 1 

Test 27

Group: 2

Verdict:

input
ABABABABABABABABABABABABABABAB...

correct output
49
97 95 93 91 89 87 85 83 81 79 ...

user output
49
97 97 97 97 97 97 97 97 97 97 ...

Test 28

Group: 2

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
1

Test 29

Group: 3

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

correct output
1000
1000 999 998 997 996 995 994 9...

user output
1000
1000 1000 1000 1000 1000 1000 ...

Test 30

Group: 3

Verdict:

input
BBBBBBBBAABBBBBBBBAABBBBBBBAAB...

correct output
218
1 626 607 519 415 5 975 957 92...

user output
218
975 975 975 975 975 975 975 97...

Test 31

Group: 3

Verdict:

input
AABBBABAABABAAABBAAAAAAABBBAAB...

correct output
55
569 639 403 761 663 437 172 90...

user output
55
901 901 901 901 901 901 901 90...

Test 32

Group: 3

Verdict:

input
ABBAAABAAABAAAAABBABABBABBABBB...

correct output
2
2 1 

user output
2
2 2 

Test 33

Group: 3

Verdict: ACCEPTED

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

user output
1

Test 34

Group: 3

Verdict:

input
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

correct output
1000
1000 999 998 997 996 995 994 9...

user output
1000
1000 1000 1000 1000 1000 1000 ...

Test 35

Group: 3

Verdict:

input
KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...

correct output
178
723 731 1 935 857 820 760 735 ...

user output
178
991 991 991 991 991 991 991 99...

Test 36

Group: 3

Verdict:

input
ILYLILYLVJILYLVJZCCQDLFRLSXZDM...

correct output
21
671 54 747 504 113 1 856 764 5...

user output
21
856 856 856 856 856 856 856 85...

Test 37

Group: 3

Verdict:

input
ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...

correct output
2
1 2 

user output
2
1 1 

Test 38

Group: 3

Verdict: ACCEPTED

input
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...

correct output
1

user output
1

Test 39

Group: 3

Verdict:

input
AIVHCGUMKSTIYBRNPONXHRFVBKPYHX...

correct output
-1

user output
46
38 38 38 38 38 38 38 38 38 38 ...

Test 40

Group: 3

Verdict:

input
QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...

correct output
-1

user output
11
347 347 347 347 347 347 347 34...

Test 41

Group: 3

Verdict:

input
ABABABABABABABABABABABABABABAB...

correct output
499
997 995 993 991 989 987 985 98...

user output
499
997 997 997 997 997 997 997 99...

Test 42

Group: 3

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
1