CSES - Datatähti 2019 alku - Results
Submission details
Task:Leimasin
Sender:Tume7
Submission time:2018-10-02 23:27:55 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1details
#20.01 s1details
#30.03 s1details
#4ACCEPTED0.01 s1details
#5ACCEPTED0.02 s1details
#6ACCEPTED0.01 s1details
#70.01 s1details
#8ACCEPTED0.01 s1details
#9ACCEPTED0.01 s1details
#10ACCEPTED0.01 s1details
#110.02 s1details
#12ACCEPTED0.01 s1details
#130.01 s1details
#14ACCEPTED0.01 s1details
#15ACCEPTED0.01 s2details
#160.02 s2details
#170.03 s2details
#18ACCEPTED0.02 s2details
#19ACCEPTED0.03 s2details
#20ACCEPTED0.02 s2details
#210.02 s2details
#22ACCEPTED0.03 s2details
#23ACCEPTED0.02 s2details
#24ACCEPTED0.02 s2details
#250.01 s2details
#26ACCEPTED0.01 s2details
#270.03 s2details
#28ACCEPTED0.01 s2details
#29ACCEPTED0.02 s3details
#300.02 s3details
#310.01 s3details
#32ACCEPTED0.02 s3details
#33ACCEPTED0.02 s3details
#34ACCEPTED0.02 s3details
#350.02 s3details
#360.02 s3details
#37ACCEPTED0.01 s3details
#38ACCEPTED0.01 s3details
#390.02 s3details
#400.01 s3details
#410.02 s3details
#42ACCEPTED0.02 s3details

Compiler report

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:87:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < iList.size(); i++) {
                         ~~^~~~~~~~~~~~~~

Code

#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
    
    
    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";
        
        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 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:

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output
6
1 2 4 5 7 9 

Test 3

Group: 1

Verdict:

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
4
1 6 6 1 

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:

input
QUUQUUQUQU
QU

correct output
6
9 7 5 4 2 1 

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

Test 12

Group: 1

Verdict: ACCEPTED

input
JQZYVSIWTE
JQZVYSIWTE

correct output
-1

user output
-1

Test 13

Group: 1

Verdict:

input
ABABABABA
ABA

correct output
4
7 5 3 1 

user output
5
1 4 5 7 1 

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 ...
Truncated

Test 16

Group: 2

Verdict:

input
BABABAAAAAAAAAAAAAAAAAABABAAAA...

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

user output
29
1 5 7 9 11 13 15 17 19 21 23 2...

Test 17

Group: 2

Verdict:

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

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

user output
4
1 51 51 1 

Test 18

Group: 2

Verdict: ACCEPTED

input
AAABABAAAABBBBBABABBAABBABABBA...

correct output
2
1 2 

user output
3
1 2 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 ...
Truncated

Test 21

Group: 2

Verdict:

input
NNNININIMNIMKLMXCNIMKLMXCDEIMK...

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

user output
31
1 2 3 5 7 10 18 28 29 30 31 32...
Truncated

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
30
1 11 12 13 14 15 16 17 18 19 2...
Truncated

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
49
1 4 5 8 9 12 13 16 17 20 21 24...
Truncated

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 ...
Truncated

Test 30

Group: 3

Verdict:

input
BBBBBBBBAABBBBBBBBAABBBBBBBAAB...

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

user output
290
1 5 14 18 19 20 24 34 35 39 42...
Truncated

Test 31

Group: 3

Verdict:

input
AABBBABAABABAAABBAAAAAAABBBAAB...

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

user output
273
1 101 102 103 104 105 106 107 ...
Truncated

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: 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 ...
Truncated

Test 35

Group: 3

Verdict:

input
KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...

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

user output
371
1 6 7 16 18 28 29 30 31 32 33 ...
Truncated

Test 36

Group: 3

Verdict:

input
ILYLILYLVJILYLVJZCCQDLFRLSXZDM...

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

user output
242
1 5 11 111 112 113 142 152 252...
Truncated

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
223
1 35 36 37 39 40 41 42 43 44 4...
Truncated

Test 40

Group: 3

Verdict:

input
QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...

correct output
-1

user output
339
1 201 202 203 204 205 206 207 ...
Truncated

Test 41

Group: 3

Verdict:

input
ABABABABABABABABABABABABABABAB...

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

user output
499
1 4 5 8 9 12 13 16 17 20 21 24...
Truncated

Test 42

Group: 3

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1