CSES - Datatähti 2019 alku - Results
Submission details
Task:Leimasin
Sender:Nanohenry
Submission time:2018-10-03 14:02:10 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1details
#2ACCEPTED0.02 s1details
#30.01 s1details
#4ACCEPTED0.02 s1details
#5ACCEPTED0.02 s1details
#6ACCEPTED0.02 s1details
#7ACCEPTED0.01 s1details
#80.01 s1details
#9ACCEPTED0.01 s1details
#10ACCEPTED0.02 s1details
#11--1details
#120.02 s1details
#13ACCEPTED0.01 s1details
#140.01 s1details
#15ACCEPTED0.01 s2details
#16--2details
#17--2details
#18ACCEPTED0.02 s2details
#19ACCEPTED0.02 s2details
#20ACCEPTED0.03 s2details
#21--2details
#22ACCEPTED0.01 s2details
#23ACCEPTED0.02 s2details
#24ACCEPTED0.01 s2details
#25--2details
#26--2details
#27ACCEPTED0.01 s2details
#280.01 s2details
#29--3details
#30--3details
#31--3details
#32ACCEPTED0.03 s3details
#33ACCEPTED0.01 s3details
#34--3details
#35--3details
#36--3details
#37ACCEPTED0.02 s3details
#38ACCEPTED0.02 s3details
#39--3details
#40--3details
#41ACCEPTED0.82 s3details
#420.02 s3details

Compiler report

input/code.cpp: In function 'long int ds(std::__cxx11::string, std::__cxx11::string)':
input/code.cpp:13:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (long i = 0; i < s1.size() && i < s2.size(); i++) {
                      ~~^~~~~~~~~~~
input/code.cpp:13:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (long i = 0; i < s1.size() && i < s2.size(); i++) {
                                       ~~^~~~~~~~~~~
input/code.cpp: In function 'std::__cxx11::string st(std::__cxx11::string, long int)':
input/code.cpp:28:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (long i = j; i < j + s.size(); i++) {
                      ~~^~~~~~~~~~~~~~
input/code.cpp: In function 'void search(std::__cxx11::string)':
input/code.cpp:43:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (long i = 0; i <= t.size...

Code

#include <iostream>
#include <string>
#include <vector>

using namespace std;

string w, t, s;
vector<long> z;
bool d;

long ds(string s1, string s2) {
    long r = 0;
    for (long i = 0; i < s1.size() && i < s2.size(); i++) {
        if (s1[i] == s2[i]) {
            r++;
        }
    }
    return r;
}

string st(string m, long j) {
    if (m.size() == 0) {
        j = 0;
    }
    if (j + s.size() > m.size()) {
        m.resize(j + s.size(), 0);
    }
    for (long i = j; i < j + s.size(); i++) {
        m[i] = s[i - j];
    }
    return m;
}

void search(string y) {
    if (z.size() > 10 * t.size()) {
        return;
    }
    if (y == t) {
        d = 1;
        return;
    }
    long u = -1, l = 0;
    for (long i = 0; i <= t.size() - s.size(); i++) {
        string v = st(y, i);
        long dst = ds(t, v);
        if ((u == -1 || dst > u) && (z.size() == 0 || i != z[z.size() - 1])) {
            u = dst;
            l = i;
        }
    }
    //cout << "best " << u << '\n';
    for (long i = 0; i <= t.size() - s.size(); i++) {
        string v = st(y, i);
        long dst = ds(t, v);
        //cout << "option " << i << ": " << v << '\t' << dst << '\n';
    }
    for (long i = 0; i <= t.size() - s.size(); i++) {
        string v = st(y, i);
        long dst = ds(t, v);
        if (dst == u && (z.size() == 0 || i != z[z.size() - 1])) {
            //cout << "choosing option " << i << ": " << v << '\t' << dst << '\n';
            z.push_back(i);
            search(v);
            if (d) {
                return;
            }
            z.pop_back();
        }
    }
}

int main() {
    cin >> t >> s;
    search("");
    cout << z.size() << '\n';
    for (long i = 0; i < z.size(); i++) {
        cout << z[i] + 1 << ' ';
    }
    cout << '\n';
    //system("pause");
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
BBBBBBBBBB
B

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

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

Test 2

Group: 1

Verdict: ACCEPTED

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output
8
1 2 5 7 9 2 3 2 

Test 3

Group: 1

Verdict:

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
3
5 6 5 

Test 4

Group: 1

Verdict: ACCEPTED

input
BAAAAAABBB
BAAAAAABB

correct output
2
2 1 

user output
3
1 2 1 

Test 5

Group: 1

Verdict: ACCEPTED

input
AAABBABBAA
AAABBABBAA

correct output
1

user output
1

Test 6

Group: 1

Verdict: ACCEPTED

input
GGGGGGGGGG
G

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

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

Test 7

Group: 1

Verdict: ACCEPTED

input
QUUQUUQUQU
QU

correct output
6
9 7 5 4 2 1 

user output
100
1 4 7 9 1 2 1 4 1 4 1 4 1 4 1 ...

Test 8

Group: 1

Verdict:

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output
3
6 4 6 

Test 9

Group: 1

Verdict: ACCEPTED

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output
3
1 2 1 

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
(empty)

Test 12

Group: 1

Verdict:

input
JQZYVSIWTE
JQZVYSIWTE

correct output
-1

user output
0

Test 13

Group: 1

Verdict: ACCEPTED

input
ABABABABA
ABA

correct output
4
7 5 3 1 

user output
4
1 5 7 3 

Test 14

Group: 1

Verdict:

input
AAAAAAAAAA
AAAAAAAAAB

correct output
-1

user output
0

Test 15

Group: 2

Verdict: ACCEPTED

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

user output
100
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 16

Group: 2

Verdict:

input
BABABAAAAAAAAAAAAAAAAAABABAAAA...

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

user output
(empty)

Test 17

Group: 2

Verdict:

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

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

user output
(empty)

Test 18

Group: 2

Verdict: ACCEPTED

input
AAABABAAAABBBBBABABBAABBABABBA...

correct output
2
1 2 

user output
2
1 2 

Test 19

Group: 2

Verdict: ACCEPTED

input
AABABBBBBBAABBABABBBBBBAABBAAA...

correct output
1

user output
1

Test 20

Group: 2

Verdict: ACCEPTED

input
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...

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

user output
100
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 21

Group: 2

Verdict:

input
NNNININIMNIMKLMXCNIMKLMXCDEIMK...

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

user output
(empty)

Test 22

Group: 2

Verdict: ACCEPTED

input
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

correct output
3
51 2 1 

user output
2
1 51 

Test 23

Group: 2

Verdict: ACCEPTED

input
IISNROLHLOJIWPTVFHFLUQRIROVLYP...

correct output
2
1 2 

user output
2
1 2 

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
(empty)

Test 26

Group: 2

Verdict:

input
IPIPYFUMRIPYFUMRLPIIIPYFIPYFUM...

correct output
-1

user output
(empty)

Test 27

Group: 2

Verdict: ACCEPTED

input
ABABABABABABABABABABABABABABAB...

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

user output
49
1 5 9 13 17 21 25 29 33 37 41 ...

Test 28

Group: 2

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
0

Test 29

Group: 3

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

user output
(empty)

Test 30

Group: 3

Verdict:

input
BBBBBBBBAABBBBBBBBAABBBBBBBAAB...

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

user output
(empty)

Test 31

Group: 3

Verdict:

input
AABBBABAABABAAABBAAAAAAABBBAAB...

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

user output
(empty)

Test 32

Group: 3

Verdict: ACCEPTED

input
ABBAAABAAABAAAAABBABABBABBABBB...

correct output
2
2 1 

user output
3
1 2 1 

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
(empty)

Test 35

Group: 3

Verdict:

input
KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...

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

user output
(empty)

Test 36

Group: 3

Verdict:

input
ILYLILYLVJILYLVJZCCQDLFRLSXZDM...

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

user output
(empty)

Test 37

Group: 3

Verdict: ACCEPTED

input
ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...

correct output
2
1 2 

user output
2
1 2 

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
(empty)

Test 40

Group: 3

Verdict:

input
QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...

correct output
-1

user output
(empty)

Test 41

Group: 3

Verdict: ACCEPTED

input
ABABABABABABABABABABABABABABAB...

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

user output
499
1 5 9 13 17 21 25 29 33 37 41 ...

Test 42

Group: 3

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
0