Submission details
Task:Leimasin
Sender:valtteriilola
Submission time:2018-10-10 18:58:44 +0300
Language:Python3
Status:READY
Result:0
Feedback
subtaskverdictscore
#10
#20
#30
Test results
testverdicttimesubtask
#1ACCEPTED0.04 s1details
#20.04 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.04 s1details
#5ACCEPTED0.05 s1details
#6ACCEPTED0.06 s1details
#70.05 s1details
#80.06 s1details
#9ACCEPTED0.04 s1details
#10ACCEPTED0.04 s1details
#11ACCEPTED0.05 s1details
#12ACCEPTED0.05 s1details
#130.05 s1details
#14ACCEPTED0.05 s1details
#15ACCEPTED0.04 s2details
#160.05 s2details
#17ACCEPTED0.04 s2details
#180.05 s2details
#19ACCEPTED0.04 s2details
#20ACCEPTED0.05 s2details
#210.05 s2details
#22ACCEPTED0.03 s2details
#230.04 s2details
#24ACCEPTED0.05 s2details
#25ACCEPTED0.05 s2details
#26ACCEPTED0.05 s2details
#270.04 s2details
#28ACCEPTED0.05 s2details
#29ACCEPTED0.04 s3details
#300.05 s3details
#310.08 s3details
#32ACCEPTED0.06 s3details
#33ACCEPTED0.06 s3details
#34ACCEPTED0.06 s3details
#350.06 s3details
#360.06 s3details
#370.05 s3details
#38ACCEPTED0.05 s3details
#39ACCEPTED0.06 s3details
#40ACCEPTED0.18 s3details
#410.05 s3details
#42ACCEPTED0.04 s3details

Code

def substrings(stamp, n):
    for size in range(n, 0, -1):
        for start in range(0, len(stamp) - size + 1):
            yield '?' * start + stamp[start:start + size] + '?' * (len(stamp) - size - start)



def solve(word, stamp):
    if set(word) != set(stamp):
        print(-1)
        return

    stack = [(word, 0)]

    indices = []
    while stack:
        word, initial = stack.pop()

        n = min(len(stamp), max(len(s) for s in word.split('?')))

        for s in substrings(stamp, n):
            index = word.find(s)
            if index != -1:
                indices.append(index + initial + 1)
                s1, s2 = word[:index] + '?' * len(s), '?' * len(s) + word[index + len(s):]

                if any(c != '?' for c in s1):
                    stack.append((s1, index + initial))
                if any(c != '?' for c in s2):
                    stack.append((s2, index + initial))

                break
        else:
            print(-1)
            return
    
    print(len(indices))
    print(' '.join(map(str, reversed(indices))))


word = input()
stamp = input()

solve(word, stamp)
        

Test details

Test 1

Subtask: 1

Verdict: ACCEPTED

input
BBBBBBBBBB
B

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

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

Test 2

Subtask: 1

Verdict:

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output
6
2 6 9 7 5 2

Test 3

Subtask: 1

Verdict: ACCEPTED

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
3
6 5 1

Test 4

Subtask: 1

Verdict: ACCEPTED

input
BAAAAAABBB
BAAAAAABB

correct output
2
2 1 

user output
2
2 1

Test 5

Subtask: 1

Verdict: ACCEPTED

input
AAABBABBAA
AAABBABBAA

correct output
1

user output
1
1

Test 6

Subtask: 1

Verdict: ACCEPTED

input
GGGGGGGGGG
G

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

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

Test 7

Subtask: 1

Verdict:

input
QUUQUUQUQU
QU

correct output
6
9 7 5 4 2 1 

user output
6
5 8 9 7 4 1

Test 8

Subtask: 1

Verdict:

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output
3
9 9 6

Test 9

Subtask: 1

Verdict: ACCEPTED

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output
2
2 1

Test 10

Subtask: 1

Verdict: ACCEPTED

input
OETMIMPUPD
OETMIMPUPD

correct output
1

user output
1
1

Test 11

Subtask: 1

Verdict: ACCEPTED

input
DOWEUOWUEU
DOWEU

correct output
-1

user output
-1

Test 12

Subtask: 1

Verdict: ACCEPTED

input
JQZYVSIWTE
JQZVYSIWTE

correct output
-1

user output
-1

Test 13

Subtask: 1

Verdict:

input
ABABABABA
ABA

correct output
4
7 5 3 1 

user output
4
7 7 5 1

Test 14

Subtask: 1

Verdict: ACCEPTED

input
AAAAAAAAAA
AAAAAAAAAB

correct output
-1

user output
-1

Test 15

Subtask: 2

Verdict: ACCEPTED

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

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

Test 16

Subtask: 2

Verdict:

input
BABABAAAAAAAAAAAAAAAAAABABAAAA...

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

user output
15
3 66 59 52 65 58 70 86 101 91 ...

Test 17

Subtask: 2

Verdict: ACCEPTED

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

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

user output
5
51 50 43 41 1

Test 18

Subtask: 2

Verdict:

input
AAABABAAAABBBBBABABBAABBABABBA...

correct output
2
1 2 

user output
2
2 2

Test 19

Subtask: 2

Verdict: ACCEPTED

input
AABABBBBBBAABBABABBBBBBAABBAAA...

correct output
1

user output
1
1

Test 20

Subtask: 2

Verdict: ACCEPTED

input
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...

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

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

Test 21

Subtask: 2

Verdict:

input
NNNININIMNIMKLMXCNIMKLMXCDEIMK...

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

user output
18
40 40 39 37 33 27 58 48 91 82 ...

Test 22

Subtask: 2

Verdict: ACCEPTED

input
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

correct output
3
51 2 1 

user output
2
51 1

Test 23

Subtask: 2

Verdict:

input
IISNROLHLOJIWPTVFHFLUQRIROVLYP...

correct output
2
1 2 

user output
2
2 2

Test 24

Subtask: 2

Verdict: ACCEPTED

input
WPMEMERJXXADLKONUZPUUFTPSXDHIV...

correct output
1

user output
1
1

Test 25

Subtask: 2

Verdict: ACCEPTED

input
LNSBGZAWFJZAWFJWFJLNSBLNSBGZAL...

correct output
-1

user output
-1

Test 26

Subtask: 2

Verdict: ACCEPTED

input
IPIPYFUMRIPYFUMRLPIIIPYFIPYFUM...

correct output
-1

user output
-1

Test 27

Subtask: 2

Verdict:

input
ABABABABABABABABABABABABABABAB...

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

user output
49
7 11 15 19 23 27 31 35 39 43 4...
Truncated

Test 28

Subtask: 2

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1

Test 29

Subtask: 3

Verdict: ACCEPTED

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

user output
1000
1000 999 998 997 996 995 994 9...
Truncated

Test 30

Subtask: 3

Verdict:

input
BBBBBBBBAABBBBBBBBAABBBBBBBAAB...

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

user output
161
52 52 48 38 57 50 77 67 78 106...
Truncated

Test 31

Subtask: 3

Verdict:

input
AABBBABAABABAAABBAAAAAAABBBAAB...

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

user output
25
488 415 375 312 304 894 796 69...
Truncated

Test 32

Subtask: 3

Verdict: ACCEPTED

input
ABBAAABAAABAAAAABBABABBABBABBB...

correct output
2
2 1 

user output
2
2 1

Test 33

Subtask: 3

Verdict: ACCEPTED

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

user output
1
1

Test 34

Subtask: 3

Verdict: ACCEPTED

input
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

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

user output
1000
1000 999 998 997 996 995 994 9...
Truncated

Test 35

Subtask: 3

Verdict:

input
KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...

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

user output
178
44 44 39 33 72 71 60 52 77 72 ...
Truncated

Test 36

Subtask: 3

Verdict:

input
ILYLILYLVJILYLVJZCCQDLFRLSXZDM...

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

user output
21
15 15 428 385 283 441 400 887 ...

Test 37

Subtask: 3

Verdict:

input
ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...

correct output
2
1 2 

user output
2
2 2

Test 38

Subtask: 3

Verdict: ACCEPTED

input
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...

correct output
1

user output
1
1

Test 39

Subtask: 3

Verdict: ACCEPTED

input
AIVHCGUMKSTIYBRNPONXHRFVBKPYHX...

correct output
-1

user output
-1

Test 40

Subtask: 3

Verdict: ACCEPTED

input
QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...

correct output
-1

user output
-1

Test 41

Subtask: 3

Verdict:

input
ABABABABABABABABABABABABABABAB...

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

user output
499
7 11 15 19 23 27 31 35 39 43 4...
Truncated

Test 42

Subtask: 3

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1