CSES - Datatähti 2019 alku - Results
Submission details
Task:Leimasin
Sender:nko
Submission time:2018-10-13 18:07:38 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1details
#20.01 s1details
#30.03 s1details
#4ACCEPTED0.02 s1details
#50.03 s1details
#6ACCEPTED0.02 s1details
#70.02 s1details
#80.02 s1details
#9ACCEPTED0.01 s1details
#100.02 s1details
#11ACCEPTED0.01 s1details
#120.01 s1details
#130.01 s1details
#14ACCEPTED0.01 s1details
#15ACCEPTED0.02 s2details
#160.01 s2details
#170.01 s2details
#180.01 s2details
#190.01 s2details
#20ACCEPTED0.01 s2details
#210.02 s2details
#220.03 s2details
#230.01 s2details
#240.02 s2details
#25ACCEPTED0.02 s2details
#26ACCEPTED0.02 s2details
#270.02 s2details
#28ACCEPTED0.03 s2details
#29ACCEPTED0.02 s3details
#300.02 s3details
#310.01 s3details
#32ACCEPTED0.02 s3details
#330.02 s3details
#34ACCEPTED0.01 s3details
#350.01 s3details
#360.01 s3details
#370.02 s3details
#380.03 s3details
#39ACCEPTED0.02 s3details
#40ACCEPTED0.02 s3details
#410.03 s3details
#42ACCEPTED0.02 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:54:45: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if(last+leimasin.length()-1 > pos){
                    ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
input/code.cpp:85:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(*it+1 == (merkkijono.length()-leimasin.length()+1)){
                ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Code

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>

using namespace std;

int ctstr(string s, string leima);


int main()
{

    string merkkijono, leimasin;
    vector<int> moves(0);
    set<char> letter;

    cin >> merkkijono >> leimasin;

    for(auto ch : leimasin){
        letter.insert(ch);
    }

    for(auto ch : merkkijono){
        if(letter.count(ch) == 0){
            cout << -1 << endl;
            return 0;
        }
    }

    string mol(merkkijono.length(),'?');

    int n, i;
    int a, b, c;
    int pos, last, under;

    n = i = a = b = pos = last = under = 0;
    while(pos < (int)merkkijono.length()){

        i = ctstr(merkkijono.substr(pos,merkkijono.length()),leimasin);


        if(pos+leimasin.length()+1 > merkkijono.length()){

                a = (leimasin.substr(leimasin.length()-(merkkijono.length()-pos),leimasin.length())).find(merkkijono[pos]) + leimasin.length()-(merkkijono.length()-pos);
                moves.insert(find(moves.begin(),moves.end(),last),pos-a);
                c = pos-a;
                i = 1;

        } else if(i == 0){


                if(last+leimasin.length()-1 > pos){

                    a = pos - leimasin.find(merkkijono[pos]);
                    moves.push_back(a);
                    i = 1;
                    c = a;

                } else {

                    a = pos - leimasin.find(merkkijono[pos]);
                    moves.insert(find(moves.begin(),moves.end(),last),a);
                    i = 1;
                    c = a;

                }

        } else {

            moves.push_back(pos);
            c = pos;

        }

        last = c;
        pos += i;
        n++;

    }

    if(count(moves.begin(),moves.end(),merkkijono.length()-leimasin.length()) > 1){
        for(auto it = moves.end()-1; it > moves.begin();it--){
            if(*it+1 == (merkkijono.length()-leimasin.length()+1)){
                moves.erase(it);
                break;
            }
        }
    }

    for(auto l : moves){
        mol.replace(l, leimasin.length(), leimasin);
    }

    if(merkkijono.compare(mol) != 0){
        cout << -1 << endl;
        return 0;
    }

    cout << n << endl;
    for(auto l : moves){
        cout << l+1 << " ";
    }
    cout << endl;


}

int ctstr(string s, string leima){

    auto s1 = s.begin();
    auto s2 = leima.begin();

    int i = 0;
    while(*s1 == *s2 && s2 < leima.end()){

        i++;
        s1++;
        s2++;

    }

    return i;

}

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 10 9 

Test 2

Group: 1

Verdict:

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output
7
1 3 2 5 9 7 

Test 3

Group: 1

Verdict:

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
6
6 6 5 5 1 

Test 4

Group: 1

Verdict: ACCEPTED

input
BAAAAAABBB
BAAAAAABB

correct output
2
2 1 

user output
2
2 1 

Test 5

Group: 1

Verdict:

input
AAABBABBAA
AAABBABBAA

correct output
1

user output
10
1 1 1 1 1 1 1 1 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 10 9 

Test 7

Group: 1

Verdict:

input
QUUQUUQUQU
QU

correct output
6
9 7 5 4 2 1 

user output
7
2 1 5 4 9 7 

Test 8

Group: 1

Verdict:

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output
-1

Test 9

Group: 1

Verdict: ACCEPTED

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output
2
2 1 

Test 10

Group: 1

Verdict:

input
OETMIMPUPD
OETMIMPUPD

correct output
1

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

Test 11

Group: 1

Verdict: ACCEPTED

input
DOWEUOWUEU
DOWEU

correct output
-1

user output
-1

Test 12

Group: 1

Verdict:

input
JQZYVSIWTE
JQZVYSIWTE

correct output
-1

user output
(empty)

Error:
terminate called after throwing an instance of 'std::out_of_range'
  what():  basic_string::replace: __pos (which is 18446744073709551615) > this->size() (which is 11)

Test 13

Group: 1

Verdict:

input
ABABABABA
ABA

correct output
4
7 5 3 1 

user output
5
3 1 7 5 

Test 14

Group: 1

Verdict: ACCEPTED

input
AAAAAAAAAA
AAAAAAAAAB

correct output
-1

user output
-1

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
-1

Test 17

Group: 2

Verdict:

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

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

user output
-1

Test 18

Group: 2

Verdict:

input
AAABABAAAABBBBBABABBAABBABABBA...

correct output
2
1 2 

user output
-1

Test 19

Group: 2

Verdict:

input
AABABBBBBBAABBABABBBBBBAABBAAA...

correct output
1

user output
100
1 1 1 1 1 1 1 1 1 1 1 1 1 1 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
-1

Test 22

Group: 2

Verdict:

input
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

correct output
3
51 2 1 

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

Test 23

Group: 2

Verdict:

input
IISNROLHLOJIWPTVFHFLUQRIROVLYP...

correct output
2
1 2 

user output
-1

Test 24

Group: 2

Verdict:

input
WPMEMERJXXADLKONUZPUUFTPSXDHIV...

correct output
1

user output
100
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

Test 25

Group: 2

Verdict: ACCEPTED

input
LNSBGZAWFJZAWFJWFJLNSBLNSBGZAL...

correct output
-1

user output
-1

Test 26

Group: 2

Verdict: ACCEPTED

input
IPIPYFUMRIPYFUMRLPIIIPYFIPYFUM...

correct output
-1

user output
-1

Test 27

Group: 2

Verdict:

input
ABABABABABABABABABABABABABABAB...

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

user output
51
3 1 7 5 11 9 15 13 19 17 23 21...

Test 28

Group: 2

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1

Test 29

Group: 3

Verdict: ACCEPTED

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

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

Test 30

Group: 3

Verdict:

input
BBBBBBBBAABBBBBBBBAABBBBBBBAAB...

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

user output
-1

Test 31

Group: 3

Verdict:

input
AABBBABAABABAAABBAAAAAAABBBAAB...

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

user output
-1

Test 32

Group: 3

Verdict: ACCEPTED

input
ABBAAABAAABAAAAABBABABBABBABBB...

correct output
2
2 1 

user output
2
2 1 

Test 33

Group: 3

Verdict:

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

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

Test 34

Group: 3

Verdict: ACCEPTED

input
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

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

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

Test 35

Group: 3

Verdict:

input
KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...

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

user output
-1

Test 36

Group: 3

Verdict:

input
ILYLILYLVJILYLVJZCCQDLFRLSXZDM...

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

user output
-1

Test 37

Group: 3

Verdict:

input
ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...

correct output
2
1 2 

user output
-1

Test 38

Group: 3

Verdict:

input
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...

correct output
1

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

Test 39

Group: 3

Verdict: ACCEPTED

input
AIVHCGUMKSTIYBRNPONXHRFVBKPYHX...

correct output
-1

user output
-1

Test 40

Group: 3

Verdict: ACCEPTED

input
QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...

correct output
-1

user output
-1

Test 41

Group: 3

Verdict:

input
ABABABABABABABABABABABABABABAB...

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

user output
501
3 1 7 5 11 9 15 13 19 17 23 21...

Test 42

Group: 3

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1