CSES - Datatähti 2019 alku - Results
Submission details
Task:Leimasin
Sender:Tume7
Submission time:2018-10-13 00:08:53 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.03 s1details
#20.02 s1details
#30.02 s1details
#40.03 s1details
#5ACCEPTED0.02 s1details
#60.01 s1details
#70.02 s1details
#80.02 s1details
#90.02 s1details
#10ACCEPTED0.01 s1details
#11ACCEPTED0.02 s1details
#12ACCEPTED0.02 s1details
#130.01 s1details
#14ACCEPTED0.01 s1details
#150.01 s2details
#160.03 s2details
#170.02 s2details
#180.02 s2details
#19ACCEPTED0.02 s2details
#200.02 s2details
#210.02 s2details
#220.02 s2details
#230.02 s2details
#24ACCEPTED0.02 s2details
#25ACCEPTED0.02 s2details
#26ACCEPTED0.02 s2details
#270.01 s2details
#28ACCEPTED0.02 s2details
#290.01 s3details
#300.01 s3details
#310.02 s3details
#320.02 s3details
#33ACCEPTED0.01 s3details
#340.02 s3details
#350.02 s3details
#360.02 s3details
#370.02 s3details
#38ACCEPTED0.02 s3details
#39ACCEPTED0.01 s3details
#40ACCEPTED0.01 s3details
#410.01 s3details
#42ACCEPTED0.01 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:101:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0; i<v.size();i++){
                      ~^~~~~~~~~

Code

#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
string s;
string leima;
vector<int> v;
bool ok = false;
int n;
int m;
cin>>s>>leima;
string s1;
n = s.length();
m = leima.length();
for(int i=0; i < n; i++){
s1 += "?";
}
//SYÖTTEIDEN HYLKÄÄMINEN:
//jos leima pidempi kuin tavoite, ei onnistu
if(m > n){
}//jos tavoitteen 1. ja viimeinen merkki eivät täsmää, ei onnistu
else if(s[0] != leima[0] || s[n-1] != leima[m-1])
{
}//jos merkkijono ei sisällä leimaa, ei onnistu
else if(s.find(leima) == std::string::npos){
}//jos tavoitteesta löytyy merkkejä, joita ei ole leimassa, ei onnistu
else{
for(int i=0; i < n; i++){
if(leima.find(s[i]) == std::string::npos){
ok = false;
break;
}else{
ok = true;
}
}
}
if(ok){
s1.replace(0, m, leima);
v.push_back(0);
s1.replace(n-m, m, leima);
v.push_back(n-m);
int x;
x = 0;
while(s.find(leima, x) != std::string::npos){
x = s.find(leima, x);
s1.replace(x, m, leima);
v.push_back(x);
x += 1;
}
for(int i=0; i < n; i++){
if(s1[i] != s[i]){
for(int y=i; y > 0; y--){
if(y > n-m-1){
}else{
s1.replace(y, m, leima);
v.push_back(y);
if(s1[i] == s[i]){
x=0;
while(s.find(leima, x) != std::string::npos){
x = s.find(leima, x);
s1.replace(x, m, leima);
v.push_back(x);
x += 1;
}
break;
}
}
}
}
}
}
if(s1 == s){
for(int i=0; i<v.size();i++){
cout<<v[i]+1<<" ";
}
}else{
cout<<-1;
}
return 0;
}

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
1 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
1 9 2 5 7 9 4 3 2 5 7 9 

Test 3

Group: 1

Verdict:

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
1 6 1 5 

Test 4

Group: 1

Verdict:

input
BAAAAAABBB
BAAAAAABB

correct output
2
2 1 

user output
1 2 1 

Test 5

Group: 1

Verdict: ACCEPTED

input
AAABBABBAA
AAABBABBAA

correct output
1

user output
1 1 1 

Test 6

Group: 1

Verdict:

input
GGGGGGGGGG
G

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

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

Test 8

Group: 1

Verdict:

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output
1 6 6 4 6 

Test 9

Group: 1

Verdict:

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output
1 2 1 

Test 10

Group: 1

Verdict: ACCEPTED

input
OETMIMPUPD
OETMIMPUPD

correct output
1

user output
1 1 1 

Test 11

Group: 1

Verdict: ACCEPTED

input
DOWEUOWUEU
DOWEU

correct output
-1

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

Test 14

Group: 1

Verdict: ACCEPTED

input
AAAAAAAAAA
AAAAAAAAAB

correct output
-1

user output
-1

Test 15

Group: 2

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

user output
1 100 1 2 3 4 5 6 7 8 9 10 11 ...
Truncated

Test 16

Group: 2

Verdict:

input
BABABAAAAAAAAAAAAAAAAAABABAAAA...

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

user output
-1

Test 17

Group: 2

Verdict:

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

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

user output
-1

Test 18

Group: 2

Verdict:

input
AAABABAAAABBBBBABABBAABBABABBA...

correct output
2
1 2 

user output
1 2 2 

Test 19

Group: 2

Verdict: ACCEPTED

input
AABABBBBBBAABBABABBBBBBAABBAAA...

correct output
1

user output
1 1 1 

Test 20

Group: 2

Verdict:

input
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...

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

user output
1 100 1 2 3 4 5 6 7 8 9 10 11 ...
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
1 91 18 39 49 67 91 2 18 39 49...
Truncated

Test 22

Group: 2

Verdict:

input
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

correct output
3
51 2 1 

user output
1 51 1 51 

Test 23

Group: 2

Verdict:

input
IISNROLHLOJIWPTVFHFLUQRIROVLYP...

correct output
2
1 2 

user output
1 2 2 

Test 24

Group: 2

Verdict: ACCEPTED

input
WPMEMERJXXADLKONUZPUUFTPSXDHIV...

correct output
1

user output
1 1 1 

Test 25

Group: 2

Verdict: ACCEPTED

input
LNSBGZAWFJZAWFJWFJLNSBLNSBGZAL...

correct output
-1

user output
-1

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
1 97 1 3 5 7 9 11 13 15 17 19 ...
Truncated

Test 28

Group: 2

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1

Test 29

Group: 3

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

user output
1 1000 1 2 3 4 5 6 7 8 9 10 11...
Truncated

Test 30

Group: 3

Verdict:

input
BBBBBBBBAABBBBBBBBAABBBBBBBAAB...

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

user output
-1

Test 31

Group: 3

Verdict:

input
AABBBABAABABAAABBAAAAAAABBBAAB...

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

user output
-1

Test 32

Group: 3

Verdict:

input
ABBAAABAAABAAAAABBABABBABBABBB...

correct output
2
2 1 

user output
1 2 1 

Test 33

Group: 3

Verdict: ACCEPTED

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

user output
1 1 1 

Test 34

Group: 3

Verdict:

input
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

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

user output
1 1000 1 2 3 4 5 6 7 8 9 10 11...
Truncated

Test 35

Group: 3

Verdict:

input
KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...

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

user output
-1

Test 36

Group: 3

Verdict:

input
ILYLILYLVJILYLVJZCCQDLFRLSXZDM...

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

user output
-1

Test 37

Group: 3

Verdict:

input
ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...

correct output
2
1 2 

user output
1 2 2 

Test 38

Group: 3

Verdict: ACCEPTED

input
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...

correct output
1

user output
1 1 1 

Test 39

Group: 3

Verdict: ACCEPTED

input
AIVHCGUMKSTIYBRNPONXHRFVBKPYHX...

correct output
-1

user output
-1

Test 40

Group: 3

Verdict: ACCEPTED

input
QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...

correct output
-1

user output
-1

Test 41

Group: 3

Verdict:

input
ABABABABABABABABABABABABABABAB...

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

user output
1 997 1 3 5 7 9 11 13 15 17 19...
Truncated

Test 42

Group: 3

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1