CSES - Datatähti 2019 alku - Results
Submission details
Task:Leimasin
Sender:Tume7
Submission time:2018-10-02 21:00:13 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.02 s1details
#20.03 s1details
#30.01 s1details
#40.02 s1details
#50.03 s1details
#60.01 s1details
#70.01 s1details
#80.02 s1details
#90.01 s1details
#100.02 s1details
#110.01 s1details
#12ACCEPTED0.02 s1details
#130.02 s1details
#14ACCEPTED0.03 s1details
#150.02 s2details
#160.01 s2details
#170.01 s2details
#180.01 s2details
#190.01 s2details
#200.01 s2details
#210.03 s2details
#220.01 s2details
#230.02 s2details
#240.01 s2details
#250.02 s2details
#26ACCEPTED0.02 s2details
#270.02 s2details
#28ACCEPTED0.01 s2details
#290.01 s3details
#300.02 s3details
#310.02 s3details
#320.02 s3details
#330.01 s3details
#340.02 s3details
#350.01 s3details
#360.03 s3details
#370.03 s3details
#380.02 s3details
#390.02 s3details
#400.02 s3details
#410.01 s3details
#42ACCEPTED0.02 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:32:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(s.find(leima) < 0 || s.find(leima) > n-1){
                             ~~~~~~~~~~~~~~^~~~~
input/code.cpp:39:53: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(leima.find(s[i]) < 0 || leima.find(s[i]) > m-1){
                                    ~~~~~~~~~~~~~~~~~^~~~~

Code

#include <iostream>
#include <string>

using namespace std;


int main() {
    string s;//tavoitemerkkijono
    string leima;//annettu leima
    
    int n;//tavoitemerkkijonon pituus
    int m;//leiman pituus
    
    cin>>s>>leima;
    
    n = s.length();
    m = leima.length();
    
    //cout<<"tavoite: "<<n<<"\n"<<"leima: "<<m;
    
    //jos leima pidempi kuin tavoite, ei onnistu
    if(m > n){
        cout<<-1;
    }
    //jos tavoitteen 1. ja viimeinen merkki eivät täsmää, ei onnistu
    if(s[0] != leima[0] || s[n-1] != leima[m-1])
    {
        cout<<-1;
    }
    
    //jos merkkijono ei sisällä leimaa, ei onnistu
    if(s.find(leima) < 0 || s.find(leima) > n-1){
        cout<<-1;
    }
    
    //jos tavoitteesta löytyy merkkejä, joita ei ole leimassa, ei onnistu
    for(int i=0; i < n-1; i++){
        
        if(leima.find(s[i]) < 0 || leima.find(s[i]) > m-1){
            cout<<-1;
            break;
        }
    }
    
    

    
    
    
    
}

Test details

Test 1

Group: 1

Verdict:

input
BBBBBBBBBB
B

correct output
10
10 9 8 7 6 5 4 3 2 1 

user output
(empty)

Test 2

Group: 1

Verdict:

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output
(empty)

Test 3

Group: 1

Verdict:

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
(empty)

Test 4

Group: 1

Verdict:

input
BAAAAAABBB
BAAAAAABB

correct output
2
2 1 

user output
(empty)

Test 5

Group: 1

Verdict:

input
AAABBABBAA
AAABBABBAA

correct output
1

user output
(empty)

Test 6

Group: 1

Verdict:

input
GGGGGGGGGG
G

correct output
10
10 9 8 7 6 5 4 3 2 1 

user output
(empty)

Test 7

Group: 1

Verdict:

input
QUUQUUQUQU
QU

correct output
6
9 7 5 4 2 1 

user output
(empty)

Test 8

Group: 1

Verdict:

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output
(empty)

Test 9

Group: 1

Verdict:

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output
(empty)

Test 10

Group: 1

Verdict:

input
OETMIMPUPD
OETMIMPUPD

correct output
1

user output
(empty)

Test 11

Group: 1

Verdict:

input
DOWEUOWUEU
DOWEU

correct output
-1

user output
(empty)

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
(empty)

Test 14

Group: 1

Verdict: ACCEPTED

input
AAAAAAAAAA
AAAAAAAAAB

correct output
-1

user output
-1-1

Test 15

Group: 2

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

user output
(empty)

Test 16

Group: 2

Verdict:

input
BABABAAAAAAAAAAAAAAAAAABABAAAA...

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

user output
(empty)

Test 17

Group: 2

Verdict:

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

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

user output
(empty)

Test 18

Group: 2

Verdict:

input
AAABABAAAABBBBBABABBAABBABABBA...

correct output
2
1 2 

user output
(empty)

Test 19

Group: 2

Verdict:

input
AABABBBBBBAABBABABBBBBBAABBAAA...

correct output
1

user output
(empty)

Test 20

Group: 2

Verdict:

input
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...

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

user output
(empty)

Test 21

Group: 2

Verdict:

input
NNNININIMNIMKLMXCNIMKLMXCDEIMK...

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

user output
(empty)

Test 22

Group: 2

Verdict:

input
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

correct output
3
51 2 1 

user output
(empty)

Test 23

Group: 2

Verdict:

input
IISNROLHLOJIWPTVFHFLUQRIROVLYP...

correct output
2
1 2 

user output
(empty)

Test 24

Group: 2

Verdict:

input
WPMEMERJXXADLKONUZPUUFTPSXDHIV...

correct output
1

user output
(empty)

Test 25

Group: 2

Verdict:

input
LNSBGZAWFJZAWFJWFJLNSBLNSBGZAL...

correct output
-1

user output
(empty)

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
(empty)

Test 28

Group: 2

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1-1

Test 29

Group: 3

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

user output
(empty)

Test 30

Group: 3

Verdict:

input
BBBBBBBBAABBBBBBBBAABBBBBBBAAB...

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

user output
(empty)

Test 31

Group: 3

Verdict:

input
AABBBABAABABAAABBAAAAAAABBBAAB...

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

user output
(empty)

Test 32

Group: 3

Verdict:

input
ABBAAABAAABAAAAABBABABBABBABBB...

correct output
2
2 1 

user output
(empty)

Test 33

Group: 3

Verdict:

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

user output
(empty)

Test 34

Group: 3

Verdict:

input
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

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

user output
(empty)

Test 35

Group: 3

Verdict:

input
KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...

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

user output
(empty)

Test 36

Group: 3

Verdict:

input
ILYLILYLVJILYLVJZCCQDLFRLSXZDM...

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

user output
(empty)

Test 37

Group: 3

Verdict:

input
ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...

correct output
2
1 2 

user output
(empty)

Test 38

Group: 3

Verdict:

input
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...

correct output
1

user output
(empty)

Test 39

Group: 3

Verdict:

input
AIVHCGUMKSTIYBRNPONXHRFVBKPYHX...

correct output
-1

user output
(empty)

Test 40

Group: 3

Verdict:

input
QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...

correct output
-1

user output
(empty)

Test 41

Group: 3

Verdict:

input
ABABABABABABABABABABABABABABAB...

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

user output
(empty)

Test 42

Group: 3

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1-1