Leimasin

input/code.cpp: In function 'int main()':
input/code.cpp:42:48: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     else if(s.find(leima) < 0 || s.find(leima) > n-1){
                                  ~~~~~~~~~~~~~~^~~~~
input/code.cpp:48:57: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(leima.find(s[i]) < 0 || leima.find(s[i]) > m-1){
                                        ~~~~~~~~~~~~~~~~~^~~~~
input/code.cpp:63:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(pos != string::npos){
               ~~~~^~~~~~~~~
input/code.cpp:68:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < v.size(); i++) {
                         ~~^~~~~~~~~~
input/code.cpp:100:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < iList...

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

using namespace std;


int main() {
    string s;//tavoitemerkkijono
    string leima;//annettu leima
    string s1 = "";//työstettävä merkkijono
    
    int n;//tavoitemerkkijonon pituus
    int m;//leiman pituus
    int k=0;//leimojen määrä
    bool ok = false;
    vector<int> iList;//paikkaluvut
    vector<int> v;//alussa löydetyt paikkaluvut
    
    cin>>s>>leima;
    
    n = s.length();
    m = leima.length();
    
    for(int i=0; i < n; i++){
        s1 += "?";
    }
    
    //cout<<"tavoite: "<<n<<"\n"<<"leima: "<<m;
    
    //SYÖTTEIDEN HYLKÄÄMINEN:
    
    
    //jos leima pidempi kuin tavoite, ei onnistu
    if(m > n){
        cout<<-1;
    }//jos tavoitteen 1. ja viimeinen merkki eivät täsmää, ei onnistu
    else if(s[0] != leima[0] || s[n-1] != leima[m-1])
    {
        cout<<-1;
    }//jos merkkijono ei sisällä leimaa, ei onnistu
    else if(s.find(leima) < 0 || s.find(leima) > n-1){
        cout<<-1;
    }//jos tavoitteesta löytyy merkkejä, joita ei ole leimassa, ei onnistu
    else{
        for(int i=0; i < n-1; i++){
        
            if(leima.find(s[i]) < 0 || leima.find(s[i]) > m-1){
                cout<<-1;
                break;
            }
        }
        ok = true;
    }
    
    //HYVÄKSYTTYJEN SYÖTTEIDEN KÄSITTELY
    if(ok){
        //cout<<"ok"<<"\n";
        //cout<<s.find(leima)<<"\n";//etsii kohdan, mistä löytyy leima ensimmäisen kerran
        //cout<<s1<<": "<<"\n";
        int pos = s.find(leima);
        
        while(pos != string::npos){
            v.push_back(pos);
            pos = s.find(leima, pos+m);
        }
        
        for (int i = 0; i < v.size(); i++) {
            
            s.replace(i, m, leima);
            iList.push_back(i);
        }
        
        
        for(int i=0; i < n; i++){
            
            if(s1[i] != s[i]){
                if(i+m > n){
                    s1.replace(n-m, m, leima);
                    iList.push_back(n-m);
                    
                    s1.replace(s.find(leima), s.find(leima)+m-1, leima);
                    iList.push_back(s.find(leima));
                    
                    k+=2;
                    //cout<<s1<<"\n";
                    break;
                }
                
                //cout<<"korvataan kohdasta "<<i<<" alkaen "<<m<<" merkkiä ja leiman pituus on "<<leima.length()<<"\n";
                s1.replace(i, m, leima);
                iList.push_back(i);
                k++;
                //cout<<s1<<": "<<"\n";

            }
            
        }
        cout<<k<<"\n";
        for (int i = 0; i < iList.size(); i++) {
            cout << iList[i]+1 << " ";
        }
        
    
        
        
        
        
        
    }
    
    

    
    
    
    
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: WRONG ANSWER

Test 8

Group: 1

Verdict: WRONG ANSWER

Test 9

Group: 1

Verdict: WRONG ANSWER

Test 10

Group: 1

Verdict: ACCEPTED

Test 11

Group: 1

Verdict: WRONG ANSWER

Test 12

Group: 1

Verdict: ACCEPTED

Test 13

Group: 1

Verdict: WRONG ANSWER

Test 14

Group: 1

Verdict: ACCEPTED

Test 15

Group: 2

Verdict: ACCEPTED

Test 16

Group: 2

Verdict: WRONG ANSWER

Test 17

Group: 2

Verdict: WRONG ANSWER

Test 18

Group: 2

Verdict: ACCEPTED

Test 19

Group: 2

Verdict: ACCEPTED

Test 20

Group: 2

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: WRONG ANSWER

Test 22

Group: 2

Verdict: WRONG ANSWER

Test 23

Group: 2

Verdict: ACCEPTED

Test 24

Group: 2

Verdict: ACCEPTED

Test 25

Group: 2

Verdict: WRONG ANSWER

Test 26

Group: 2

Verdict: ACCEPTED

Test 27

Group: 2

Verdict: WRONG ANSWER

Test 28

Group: 2

Verdict: ACCEPTED

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: WRONG ANSWER

Test 33

Group: 3

Verdict: ACCEPTED

Test 34

Group: 3

Verdict: ACCEPTED

Test 35

Group: 3

Verdict: WRONG ANSWER

Test 36

Group: 3

Verdict: WRONG ANSWER

Test 37

Group: 3

Verdict: ACCEPTED

Test 38

Group: 3

Verdict: ACCEPTED

Test 39

Group: 3

Verdict: WRONG ANSWER

Test 40

Group: 3

Verdict: WRONG ANSWER

Test 41

Group: 3

Verdict: WRONG ANSWER

Test 42

Group: 3

Verdict: ACCEPTED