Leimasin

input/code.cpp: In function 'int main()':
input/code.cpp:41:48: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (( a = merkkijono.find(leimasin, a)) != std::string::npos){
            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
input/code.cpp:61:118: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while((a = (leimasin.substr(leimasin.length()-(merkkijono.length() - pos),leimasin.length())).find(reg)) != std::string::npos){
                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
input/code.cpp:86:44: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while((a = leimasin.find(reg)) != std::string::npos){
                   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
input/code.cpp:124:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(k <...

#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);

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

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

    while (( a = merkkijono.find(leimasin, a)) != std::string::npos){

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

    }

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

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


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

            string reg(1,merkkijono[pos]);
            c = 1;
            while((a = (leimasin.substr(leimasin.length()-(merkkijono.length() - pos),leimasin.length())).find(reg)) != std::string::npos){

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

            }

            b += leimasin.length()-(merkkijono.length() - pos);


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

            }
            last = pos-b;
            pos += ctstr(merkkijono.substr(pos,merkkijono.length()),reg.substr(0,reg.length()-1));



        } else {

            string reg(1,merkkijono[pos]);
            c = 1;
            while((a = leimasin.find(reg)) != std::string::npos){

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

            }


            if(b == 0){

                moves.push_back(pos);
                last = pos;

                pos += reg.length()-1;

            } else {

                moves.insert(find(moves.begin(),moves.end(),last),pos-b);
                last = pos-b;
                pos += ctstr(merkkijono.substr(pos,merkkijono.length()),reg.substr(0,reg.length()-1));

            }

        }


        n++;

    }



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

    for(auto k : moves){
        if(k <= merkkijono.length()-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 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: ACCEPTED

Test 8

Group: 1

Verdict: ACCEPTED

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 1

Verdict: ACCEPTED

Test 11

Group: 1

Verdict: ACCEPTED

Test 12

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 1

Verdict: ACCEPTED

Test 14

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 2

Verdict: ACCEPTED

Test 16

Group: 2

Verdict: ACCEPTED

Test 17

Group: 2

Verdict: ACCEPTED

Test 18

Group: 2

Verdict: ACCEPTED

Test 19

Group: 2

Verdict: ACCEPTED

Test 20

Group: 2

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: ACCEPTED

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: ACCEPTED

Test 24

Group: 2

Verdict: ACCEPTED

Test 25

Group: 2

Verdict: ACCEPTED

Test 26

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 2

Verdict: ACCEPTED

Test 28

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 29

Group: 3

Verdict: ACCEPTED

Test 30

Group: 3

Verdict: WRONG ANSWER

Test 31

Group: 3

Verdict: WRONG ANSWER

Test 32

Group: 3

Verdict: ACCEPTED

Test 33

Group: 3

Verdict: ACCEPTED

Test 34

Group: 3

Verdict: ACCEPTED

Test 35

Group: 3

Verdict: ACCEPTED

Test 36

Group: 3

Verdict: ACCEPTED

Test 37

Group: 3

Verdict: ACCEPTED

Test 38

Group: 3

Verdict: ACCEPTED

Test 39

Group: 3

Verdict: ACCEPTED

Test 40

Group: 3

Verdict: ACCEPTED

Test 41

Group: 3

Verdict: ACCEPTED

Test 42

Group: 3

Verdict: TIME LIMIT EXCEEDED