CSES - Datatähti 2019 alku - Results
Submission details
Task:Leimasin
Sender:Kameli
Submission time:2018-10-02 20:26:33 +0300
Language:Python3
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.04 s1details
#20.05 s1details
#30.04 s1details
#40.05 s1details
#50.04 s1details
#60.04 s1details
#70.05 s1details
#80.06 s1details
#90.04 s1details
#100.04 s1details
#11ACCEPTED0.05 s1details
#12ACCEPTED0.04 s1details
#130.05 s1details
#14ACCEPTED0.04 s1details
#150.04 s2details
#160.05 s2details
#170.05 s2details
#180.05 s2details
#190.04 s2details
#200.04 s2details
#210.05 s2details
#220.04 s2details
#230.03 s2details
#240.06 s2details
#25ACCEPTED0.06 s2details
#26ACCEPTED0.04 s2details
#270.05 s2details
#28ACCEPTED0.05 s2details
#290.05 s3details
#300.05 s3details
#310.05 s3details
#32ACCEPTED0.59 s3details
#33ACCEPTED0.57 s3details
#340.04 s3details
#350.04 s3details
#360.04 s3details
#37ACCEPTED0.61 s3details
#38ACCEPTED0.58 s3details
#39ACCEPTED0.06 s3details
#40--3details
#410.05 s3details
#42ACCEPTED0.04 s3details

Code

maali=input()
leimasin=input()
if len(leimasin)<200:
print(-1)
exit(0)
def stamp(pos,length,orig):
for i in range(pos,pos+length):
orig[i]="?"
if leimasin not in maali:
print(-1)
exit(0)
maali=list(maali)
leimasin=list(leimasin)
sleimasin=set(leimasin)
if len(leimasin)>len(leimasin):
print(-1)
exit(0)
for i in set(maali):
if i not in sleimasin:
print(-1)
exit(0)
n=len(maali)
m=len(leimasin)
#if m>999:
# 0/0
stamps=[]
lPos=0
match=True
match = True
fail_table = [-1] * (len(leimasin) + 1)
fail_index = -1
for i, char in enumerate(leimasin):
while fail_index >= 0 and leimasin[fail_index] != char:
fail_index = fail_table[fail_index]
fail_index += 1
fail_table[i + 1] = fail_index
#print("table",fail_table)
rm=0
t=0
match=True
while True:
t+=1
if t>10000:
print(-1)
exit(0)
if maali[-1]==".":
break
if maali[rm]=="?":
#print("rm",rm)
maali[rm]="."
rm+=1
match=False
i=0
fail_index =0
q=0
while i<n:
char=maali[i]
# print(i,char,q,fail_index)
if char=="?":
q+=1
fail_index+=1
i+=1
if q==m:
# print("all q's")
break
if fail_index==m:
# print("\"löytyi\"")
pos=i-fail_index
# print(pos,i,fail_index,maali)
# print("at",pos)
stamp(pos,m,maali)
stamps.append(pos)
# print(pos,"'")
break
continue
while fail_index >= 0 and not ( leimasin[fail_index] == char):
q=0
#print("fail",i,char,fail_index,fail_table)
fail_index = fail_table[fail_index]
fail_index += 1
if fail_index == m:
pos= i + 1 - fail_index
stamp(pos,m,maali)
# print(pos,i,fail_index,maali)
stamps.append(pos)
fail_index = fail_table[fail_index]
break
i+=1
#print(maali)
print(len(stamps))
for i in range(len(stamps)):
stamps[i]+=1
print(" ".join(map(str,stamps[::-1])))

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

Test 2

Group: 1

Verdict:

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output
-1

Test 3

Group: 1

Verdict:

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
-1

Test 4

Group: 1

Verdict:

input
BAAAAAABBB
BAAAAAABB

correct output
2
2 1 

user output
-1

Test 5

Group: 1

Verdict:

input
AAABBABBAA
AAABBABBAA

correct output
1

user output
-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

Test 7

Group: 1

Verdict:

input
QUUQUUQUQU
QU

correct output
6
9 7 5 4 2 1 

user output
-1

Test 8

Group: 1

Verdict:

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output
-1

Test 9

Group: 1

Verdict:

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output
-1

Test 10

Group: 1

Verdict:

input
OETMIMPUPD
OETMIMPUPD

correct output
1

user output
-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

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

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

Test 19

Group: 2

Verdict:

input
AABABBBBBBAABBABABBBBBBAABBAAA...

correct output
1

user output
-1

Test 20

Group: 2

Verdict:

input
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...

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

user output
-1

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

Test 22

Group: 2

Verdict:

input
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

correct output
3
51 2 1 

user output
-1

Test 23

Group: 2

Verdict:

input
IISNROLHLOJIWPTVFHFLUQRIROVLYP...

correct output
2
1 2 

user output
-1

Test 24

Group: 2

Verdict:

input
WPMEMERJXXADLKONUZPUUFTPSXDHIV...

correct output
1

user output
-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

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

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: ACCEPTED

input
ABBAAABAAABAAAAABBABABBABBABBB...

correct output
2
2 1 

user output
2
2 1

Test 33

Group: 3

Verdict: ACCEPTED

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

user output
1
1

Test 34

Group: 3

Verdict:

input
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

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

user output
-1

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: 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
1

Test 39

Group: 3

Verdict: ACCEPTED

input
AIVHCGUMKSTIYBRNPONXHRFVBKPYHX...

correct output
-1

user output
-1

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
-1

Test 42

Group: 3

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1