CSES - Datatähti 2019 alku - Results
Submission details
Task:Leimasin
Sender:nko
Submission time:2018-10-14 23:40:35 +0300
Language:C++
Status:READY
Result:60
Feedback
groupverdictscore
#1ACCEPTED29
#2ACCEPTED31
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1details
#2ACCEPTED0.02 s1details
#3ACCEPTED0.02 s1details
#4ACCEPTED0.02 s1details
#5ACCEPTED0.02 s1details
#6ACCEPTED0.02 s1details
#7ACCEPTED0.02 s1details
#8ACCEPTED0.02 s1details
#9ACCEPTED0.02 s1details
#10ACCEPTED0.02 s1details
#11ACCEPTED0.01 s1details
#12ACCEPTED0.02 s1details
#13ACCEPTED0.02 s1details
#14ACCEPTED0.01 s1details
#15ACCEPTED0.02 s2details
#16ACCEPTED0.02 s2details
#17ACCEPTED0.01 s2details
#18ACCEPTED0.02 s2details
#19ACCEPTED0.01 s2details
#20ACCEPTED0.02 s2details
#21ACCEPTED0.03 s2details
#22ACCEPTED0.02 s2details
#23ACCEPTED0.01 s2details
#24ACCEPTED0.02 s2details
#25ACCEPTED0.01 s2details
#26ACCEPTED0.02 s2details
#27ACCEPTED0.01 s2details
#28ACCEPTED0.02 s2details
#29ACCEPTED0.01 s3details
#300.03 s3details
#310.03 s3details
#32ACCEPTED0.01 s3details
#33ACCEPTED0.03 s3details
#34ACCEPTED0.02 s3details
#35ACCEPTED0.02 s3details
#36ACCEPTED0.01 s3details
#37ACCEPTED0.03 s3details
#38ACCEPTED0.01 s3details
#39ACCEPTED0.02 s3details
#40ACCEPTED0.03 s3details
#41ACCEPTED0.02 s3details
#42ACCEPTED0.02 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:96:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(pos+1 < leimasin.length() || merkkijono[pos+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), add(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(),'?');
    string lmol(leimasin.length(),'?');
    string ba(merkkijono);
    string reg;
    string l2;

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

    n = i = a = b = pos = last = under = 0;

    while (( a = merkkijono.find(leimasin, a)) != -1){

        merkkijono.replace(a, lmol.size(), lmol);
        add.push_back(a);
        a += lmol.size();

    }

    while(pos < (int)merkkijono.length()){


        if(merkkijono[pos] == '?'){
            pos++;
            continue;
        }

        reg.clear();
        reg.push_back(merkkijono[pos]);

        d = leimasin.length()-(merkkijono.length() - pos);

        if(d > 0){

            c = 1;
            l2.assign(leimasin.substr(d ,leimasin.length()));
            while((a = l2.find(reg)) != -1){

                b = a;
                reg.push_back(merkkijono[pos+(c++)]);

            }

            b += d;
            reg.pop_back();

            if(merkkijono[pos-1] == '?'){

                moves.push_back(pos-b);

            } else {

                moves.insert(find(moves.begin(),moves.end(),last),pos-b);

            }

            last = pos-b;

        } else {


            c = 1;
            if(pos+1 < leimasin.length() || merkkijono[pos+1] == '?'){
                 while((a = (int)leimasin.find(reg)) != -1){

                    b = a;
                    reg.push_back(merkkijono[pos+(c++)]);

                }

            } else {

                 while((a = (int)leimasin.rfind(reg)) != -1){

                    b = a;
                    reg.push_back(merkkijono[pos+(c++)]);

                }

            }

            reg.pop_back();


            if(b == 0){

                moves.push_back(pos);
                last = pos;

            } else {

                if(b == 1 && (merkkijono[pos-1] == leimasin[0] || merkkijono[pos-1] == '?'))
                   moves.push_back(pos-b);
                else
                    moves.insert(find(moves.begin(),moves.end(),last),pos-b);
                last = pos-b;

            }

        }

        pos += reg.length();

        n++;
        if(n > 10000){
            cout << -1 << endl;
            return 0;
        }

    }

    for(auto l : add){
        moves.push_back(l);
        n++;
    }


    for(auto k : moves){
        if(k <= (int)merkkijono.length()-(int)leimasin.length())
            mol.replace(k,leimasin.length(),leimasin);
    }



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

    cout << n << endl;
    for(auto c : moves)
        cout << c+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 9 10 

Test 2

Group: 1

Verdict: ACCEPTED

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output
6
1 3 2 5 7 9 

Test 3

Group: 1

Verdict: ACCEPTED

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
3
6 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: 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
6
2 5 1 4 7 9 

Test 8

Group: 1

Verdict: ACCEPTED

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output
3
1 4 6 

Test 9

Group: 1

Verdict: ACCEPTED

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output
2
2 1 

Test 10

Group: 1

Verdict: ACCEPTED

input
OETMIMPUPD
OETMIMPUPD

correct output
1

user output
1

Test 11

Group: 1

Verdict: ACCEPTED

input
DOWEUOWUEU
DOWEU

correct output
-1

user output
-1

Test 12

Group: 1

Verdict: ACCEPTED

input
JQZYVSIWTE
JQZVYSIWTE

correct output
-1

user output
-1

Test 13

Group: 1

Verdict: ACCEPTED

input
ABABABABA
ABA

correct output
4
7 5 3 1 

user output
4
3 7 1 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: ACCEPTED

input
BABABAAAAAAAAAAAAAAAAAABABAAAA...

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

user output
15
14 10 1 33 24 87 69 53 43 3 31...

Test 17

Group: 2

Verdict: ACCEPTED

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

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

user output
5
51 50 43 41 1 

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: ACCEPTED

input
NNNININIMNIMKLMXCNIMKLMXCDEIMK...

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

user output
18
1 2 3 5 7 10 27 37 58 74 64 79...

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: 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: ACCEPTED

input
ABABABABABABABABABABABABABABAB...

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

user output
49
3 7 11 15 19 23 27 31 35 39 43...

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: ACCEPTED

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

user output
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: ACCEPTED

input
KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...

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

user output
178
1 6 7 34 33 25 16 86 77 75 58 ...

Test 36

Group: 3

Verdict: ACCEPTED

input
ILYLILYLVJILYLVJZCCQDLFRLSXZDM...

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

user output
21
1 54 5 113 504 413 257 216 142...

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: 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: ACCEPTED

input
ABABABABABABABABABABABABABABAB...

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

user output
499
3 7 11 15 19 23 27 31 35 39 43...

Test 42

Group: 3

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1