CSES - Datatähti 2019 alku - Results
Submission details
Task:Leimasin
Sender:Tume7
Submission time:2018-10-03 23:00:32 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1details
#20.02 s1details
#30.01 s1details
#40.02 s1details
#5ACCEPTED0.02 s1details
#6ACCEPTED0.02 s1details
#70.01 s1details
#80.02 s1details
#90.01 s1details
#10ACCEPTED0.02 s1details
#110.02 s1details
#120.02 s1details
#13ACCEPTED0.02 s1details
#140.01 s1details
#15ACCEPTED0.01 s2details
#160.01 s2details
#170.01 s2details
#180.01 s2details
#19ACCEPTED0.02 s2details
#20ACCEPTED0.02 s2details
#210.01 s2details
#22ACCEPTED0.03 s2details
#230.03 s2details
#24ACCEPTED0.02 s2details
#250.01 s2details
#260.01 s2details
#27ACCEPTED0.01 s2details
#280.01 s2details
#29ACCEPTED0.02 s3details
#300.01 s3details
#310.02 s3details
#320.01 s3details
#33ACCEPTED0.01 s3details
#34ACCEPTED0.02 s3details
#350.03 s3details
#360.01 s3details
#370.01 s3details
#38ACCEPTED0.01 s3details
#390.01 s3details
#400.01 s3details
#41ACCEPTED0.01 s3details
#420.01 s3details

Code

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

using namespace std;


int main() {
    string s;//tavoitemerkkijono
    string leima;//annettu leima
    string tayte;//täyte
    vector<int> iList;
    
    int n;//tavoitemerkkijonon pituus
    int m;//leiman pituus
    bool ok = false;
    
    
    cin>>s>>leima;
    
    string s1 = s; //työstettävä kopio merkkijonosta
    n = s.length();
    m = leima.length();
    
    for(int i=0; i < m; i++){
        tayte += "?";
    }
    
    //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) == std::string::npos){
        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]) == std::string::npos){
                cout<<-1;
                break;
            }
        }
        ok = true;
    }
    
    //HYVÄKSYTTYJEN SYÖTTEIDEN KÄSITTELY
    int x = 0;
    
    while(ok){
        //etsitään kaikki 1. kerroksen leimat
        while(s.find(leima, x) != std::string::npos){
            x = s.find(leima, x);
            s1.replace(x, m, tayte);
            iList.push_back(x);
            x += 1;
        }
        //täydennetään toisen kerroksen leimat
        for(int i=0; i < n; i++){
            if(s1[i] != '?'){
                if(leima.find(s[i]) != std::string::npos){
                    int b = leima.find(s[i]);
                    //cout<<"b="<<b<<"    "<<"i="<<i<<"   ";
                    s1.replace(i-b, m, leima);
                    //cout<<s1<<"\n";
                    iList.push_back(i-b);
                    
                    s1.replace(i-b, m, tayte);
                    //cout<<s1<<"\n";
                }
                
            }
        }
        //täydennetään päällimmäsiet leimat
        x = 0;
        while(s.find(leima, x) != std::string::npos){
            x = s.find(leima, x);
            s1.replace(x, m, leima);
            iList.push_back(x);
            x += 1;
        }
        
        ok = false;
    }
    
    if(!ok){
        cout<<iList.size()<<"\n";
        for (int i = iList.size(); i > 0; i--) {
            cout << iList[i]+1 << " ";
        }
    }
    
    
    
    
    
    
    return 0;
}

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
20
1 10 9 8 7 6 5 4 3 2 1 10 9 8 ...

Test 2

Group: 1

Verdict:

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output
10
1 9 7 5 2 3 1 9 7 5 

Test 3

Group: 1

Verdict:

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
5
1 5 1 10 5 

Test 4

Group: 1

Verdict:

input
BAAAAAABBB
BAAAAAABB

correct output
2
2 1 

user output
3
1 1 10 

Test 5

Group: 1

Verdict: ACCEPTED

input
AAABBABBAA
AAABBABBAA

correct output
1

user output
2
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
20
1 10 9 8 7 6 5 4 3 2 1 10 9 8 ...

Test 7

Group: 1

Verdict:

input
QUUQUUQUQU
QU

correct output
6
9 7 5 4 2 1 

user output
10
1 9 7 4 1 5 2 9 7 4 

Test 8

Group: 1

Verdict:

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output
3
1 6 1 

Test 9

Group: 1

Verdict:

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output
3
1 1 2 

Test 10

Group: 1

Verdict: ACCEPTED

input
OETMIMPUPD
OETMIMPUPD

correct output
1

user output
2
1 1 

Test 11

Group: 1

Verdict:

input
DOWEUOWUEU
DOWEU

correct output
-1

user output
4
1 1 6 5 

Test 12

Group: 1

Verdict:

input
JQZYVSIWTE
JQZVYSIWTE

correct output
-1

user output
-10

Test 13

Group: 1

Verdict: ACCEPTED

input
ABABABABA
ABA

correct output
4
7 5 3 1 

user output
8
1 7 5 3 1 7 5 3 

Test 14

Group: 1

Verdict:

input
AAAAAAAAAA
AAAAAAAAAB

correct output
-1

user output
-10

Test 15

Group: 2

Verdict: ACCEPTED

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

correct output
100
100 99 98 97 96 95 94 93 92 91...

user output
200
1 100 99 98 97 96 95 94 93 92 ...

Test 16

Group: 2

Verdict:

input
BABABAAAAAAAAAAAAAAAAAABABAAAA...

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

user output
19
1 91 79 63 46 31 3 89 72 55 40...

Test 17

Group: 2

Verdict:

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

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

user output
3
1 1 51 

Test 18

Group: 2

Verdict:

input
AAABABAAAABBBBBABABBAABBABABBA...

correct output
2
1 2 

user output
3
1 2 1 

Test 19

Group: 2

Verdict: ACCEPTED

input
AABABBBBBBAABBABABBBBBBAABBAAA...

correct output
1

user output
2
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
200
1 100 99 98 97 96 95 94 93 92 ...

Test 21

Group: 2

Verdict:

input
NNNININIMNIMKLMXCNIMKLMXCDEIMK...

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

user output
17
1 91 67 49 39 18 84 74 58 37 2...

Test 22

Group: 2

Verdict: ACCEPTED

input
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

correct output
3
51 2 1 

user output
4
1 51 1 51 

Test 23

Group: 2

Verdict:

input
IISNROLHLOJIWPTVFHFLUQRIROVLYP...

correct output
2
1 2 

user output
3
1 2 1 

Test 24

Group: 2

Verdict: ACCEPTED

input
WPMEMERJXXADLKONUZPUUFTPSXDHIV...

correct output
1

user output
2
1 1 

Test 25

Group: 2

Verdict:

input
LNSBGZAWFJZAWFJWFJLNSBLNSBGZAL...

correct output
-1

user output
22
1 68 46 30 1 91 90 87 86 79 69...

Test 26

Group: 2

Verdict:

input
IPIPYFUMRIPYFUMRLPIIIPYFIPYFUM...

correct output
-1

user output
-10

Test 27

Group: 2

Verdict: ACCEPTED

input
ABABABABABABABABABABABABABABAB...

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

user output
98
1 97 95 93 91 89 87 85 83 81 7...

Test 28

Group: 2

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-10

Test 29

Group: 3

Verdict: ACCEPTED

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

user output
2000
1 1000 999 998 997 996 995 994...

Test 30

Group: 3

Verdict:

input
BBBBBBBBAABBBBBBBBAABBBBBBBAAB...

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

user output
183
1 991 970 945 921 906 887 877 ...

Test 31

Group: 3

Verdict:

input
AABBBABAABABAAABBAAAAAAABBBAAB...

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

user output
18
1 818 688 478 261 1 918 788 67...

Test 32

Group: 3

Verdict:

input
ABBAAABAAABAAAAABBABABBABBABBB...

correct output
2
2 1 

user output
3
1 1 999 

Test 33

Group: 3

Verdict: ACCEPTED

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

user output
2
1 1 

Test 34

Group: 3

Verdict: ACCEPTED

input
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

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

user output
2000
1 1000 999 998 997 996 995 994...

Test 35

Group: 3

Verdict:

input
KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...

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

user output
206
1 990 972 955 942 924 898 868 ...

Test 36

Group: 3

Verdict:

input
ILYLILYLVJILYLVJZCCQDLFRLSXZDM...

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

user output
20
1 901 796 597 336 152 11 856 7...

Test 37

Group: 3

Verdict:

input
ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...

correct output
2
1 2 

user output
3
1 2 1 

Test 38

Group: 3

Verdict: ACCEPTED

input
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...

correct output
1

user output
2
1 1 

Test 39

Group: 3

Verdict:

input
AIVHCGUMKSTIYBRNPONXHRFVBKPYHX...

correct output
-1

user output
39
1 913 836 750 693 630 474 406 ...

Test 40

Group: 3

Verdict:

input
QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...

correct output
-1

user output
9
1061109568 572 1 811 664 555 3...

Test 41

Group: 3

Verdict: ACCEPTED

input
ABABABABABABABABABABABABABABAB...

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

user output
998
1 997 995 993 991 989 987 985 ...

Test 42

Group: 3

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-10