Submission details
Task:Leimasin
Sender:tuomask
Submission time:2018-10-12 11:28:33 +0300
Language:Java
Status:READY
Result:0
Feedback
subtaskverdictscore
#10
#20
#30
Test results
testverdicttimesubtask
#10.26 s1details
#20.27 s1details
#30.26 s1details
#40.27 s1details
#50.28 s1details
#60.27 s1details
#70.27 s1details
#80.28 s1details
#90.27 s1details
#100.27 s1details
#11ACCEPTED0.22 s1details
#12ACCEPTED0.23 s1details
#130.28 s1details
#14ACCEPTED0.23 s1details
#150.28 s2details
#160.27 s2details
#170.26 s2details
#180.26 s2details
#190.26 s2details
#200.26 s2details
#210.26 s2details
#220.27 s2details
#230.27 s2details
#240.26 s2details
#25--2details
#260.29 s2details
#270.28 s2details
#28ACCEPTED0.22 s2details
#290.31 s3details
#300.31 s3details
#310.30 s3details
#320.28 s3details
#330.26 s3details
#340.32 s3details
#350.28 s3details
#360.28 s3details
#370.28 s3details
#380.28 s3details
#39--3details
#40--3details
#410.29 s3details
#42ACCEPTED0.23 s3details

Compiler report

Note: input/Leimasin3.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.

Code

import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Scanner;

public class Leimasin3 {
    static char[] s;
    static char[] stamp;
    
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        s = input.nextLine().toCharArray();
        stamp = input.nextLine().toCharArray();
        //char[] s = new String("AAABABABBAAB").toCharArray();
        //char[] stamp = new String("AB").toCharArray();
        
        //stampPositions.add(1);
        haku(0);
        System.out.println("-1");
        
        /*boolean forward = true;
        int lastStampStart = 0;
        int lastOKStampPos = 0;
        ArrayList<Integer> stampPositions = new ArrayList();
        stampPositions.add(1);
        int lastForwardListPos = 0;
        
        for (int i=0; i<s.length; i++) {
            int stampI = i-lastStampStart;            
            if (lastStampStart > s.length - stamp.length + 1) {
                System.out.println("-1");
                System.exit(0);
            }
            
            if (stampI >= stamp.length || stampI < 0) { // end of the stamp
                if (s[i] == stamp[0]) {// can start a new stamp
                    forward = true;
                    lastStampStart = i;
                } else { // need to turn around
                    forward = false;
                    lastStampStart = i-1;
                    if (lastStampStart < 0) lastStampStart = 0;
                    //lastStampStart++;
                }
                i--;
                continue;
            } else if (s[i] == stamp[stampI]) { // OK, move on
                if (lastOKStampPos != lastStampStart) {
                    if (forward) {
                        stampPositions.add(lastStampStart + 1);
                        lastForwardListPos = stampPositions.size()-1;
                    } else {
                        forward = true;
                        stampPositions.add(lastForwardListPos, lastStampStart + 1);
                    }
                    lastOKStampPos = lastStampStart;
                }
            } else if (i == lastStampStart || i-lastStampStart >= stamp.length && !forward) { // don't even imagine
                System.out.println("-1");
                System.exit(0);
                break;
            } else { // didn't match, but check if it would
                if (forward) lastStampStart = i;
                else lastStampStart--;
                i--;
            }
        }
        
        System.out.println(stampPositions.size());
        for (int i=0; i<stampPositions.size(); i++) {
            System.out.print(stampPositions.get(i) + " ");
        }*/
    }
    
    static int lastStampStart=0;
    static int lastForwardPos=0;
    static ArrayList<Integer> stampPositions = new ArrayList<Integer>();
    
    public static void haku(int i) {
        if (i == s.length) {
            System.out.println(stampPositions.size());
            stampPositions.forEach((pos) -> System.out.print(pos + " "));
            System.exit(0);
            return;
        }
        
        //System.out.println("i: " + i + "   lastStampStart: " + lastStampStart + "   si: " + (i-lastStampStart));
        if (i-lastStampStart < stamp.length && s[i] == stamp[i-lastStampStart]) {
            if (lastStampStart == i) {
                //System.out.println("   add B " + lastStampStart);
                lastForwardPos = stampPositions.size();
                stampPositions.add(lastStampStart);
            } else if (lastStampStart != stampPositions.get(lastForwardPos)) {
                //System.out.println("   add A " + lastStampStart);
                stampPositions.add(lastForwardPos, lastStampStart);
            }
            haku(i+1);
        }
        int oldLastStampStart = lastStampStart;
        while (lastStampStart < s.length - stamp.length && lastStampStart < i) {
            lastStampStart++;
            ArrayList<Integer> oldStampPositions = (ArrayList<Integer>) stampPositions.clone();
            haku(i);
            stampPositions = oldStampPositions;
            //System.out.println("   remove " + stampPositions.get(stampPositions.size()-1));
            //stampPositions.remove(stampPositions.size()-1);
        }
        lastStampStart = oldLastStampStart;
    }
}

Test details

Test 1

Subtask: 1

Verdict:

input
BBBBBBBBBB
B

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

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

Test 2

Subtask: 1

Verdict:

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output
6
0 2 1 4 6 8 

Test 3

Subtask: 1

Verdict:

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
4
5 4 1 0 

Test 4

Subtask: 1

Verdict:

input
BAAAAAABBB
BAAAAAABB

correct output
2
2 1 

user output
2
1 0 

Test 5

Subtask: 1

Verdict:

input
AAABBABBAA
AAABBABBAA

correct output
1

user output
1

Test 6

Subtask: 1

Verdict:

input
GGGGGGGGGG
G

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

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

Test 7

Subtask: 1

Verdict:

input
QUUQUUQUQU
QU

correct output
6
9 7 5 4 2 1 

user output
6
1 0 4 3 6 8 

Test 8

Subtask: 1

Verdict:

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output
3
0 3 5 

Test 9

Subtask: 1

Verdict:

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output
2
1 0 

Test 10

Subtask: 1

Verdict:

input
OETMIMPUPD
OETMIMPUPD

correct output
1

user output
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
6 4 2 0 

Test 14

Subtask: 1

Verdict: ACCEPTED

input
AAAAAAAAAA
AAAAAAAAAB

correct output
-1

user output
-1

Test 15

Subtask: 2

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

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

Test 16

Subtask: 2

Verdict:

input
BABABAAAAAAAAAAAAAAAAAABABAAAA...

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

user output
43
90 88 86 78 76 68 67 66 65 64 ...
Truncated

Test 17

Subtask: 2

Verdict:

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

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

user output
41
50 49 48 47 46 45 44 42 40 39 ...
Truncated

Test 18

Subtask: 2

Verdict:

input
AAABABAAAABBBBBABABBAABBABABBA...

correct output
2
1 2 

user output
2
1 0 

Test 19

Subtask: 2

Verdict:

input
AABABBBBBBAABBABABBBBBBAABBAAA...

correct output
1

user output
1

Test 20

Subtask: 2

Verdict:

input
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...

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

user output
100
0 1 2 3 4 5 6 7 8 9 10 11 12 1...
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
0 1 2 4 6 9 26 17 36 38 57 48 ...

Test 22

Subtask: 2

Verdict:

input
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

correct output
3
51 2 1 

user output
7
50 37 30 25 3 1 0 

Test 23

Subtask: 2

Verdict:

input
IISNROLHLOJIWPTVFHFLUQRIROVLYP...

correct output
2
1 2 

user output
2
0 1 

Test 24

Subtask: 2

Verdict:

input
WPMEMERJXXADLKONUZPUUFTPSXDHIV...

correct output
1

user output
1

Test 25

Subtask: 2

Verdict:

input
LNSBGZAWFJZAWFJWFJLNSBLNSBGZAL...

correct output
-1

user output
(empty)

Test 26

Subtask: 2

Verdict:

input
IPIPYFUMRIPYFUMRLPIIIPYFIPYFUM...

correct output
-1

user output
(empty)

Error:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index 9 out-of-bounds for...

Test 27

Subtask: 2

Verdict:

input
ABABABABABABABABABABABABABABAB...

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

user output
49
96 94 92 90 88 86 84 82 80 78 ...
Truncated

Test 28

Subtask: 2

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1

Test 29

Subtask: 3

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

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

Test 30

Subtask: 3

Verdict:

input
BBBBBBBBAABBBBBBBBAABBBBBBBAAB...

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

user output
816
990 989 988 986 985 984 983 98...
Truncated

Test 31

Subtask: 3

Verdict:

input
AABBBABAABABAAABBAAAAAAABBBAAB...

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

user output
611
900 899 896 895 894 893 890 88...
Truncated

Test 32

Subtask: 3

Verdict:

input
ABBAAABAAABAAAAABBABABBABBABBB...

correct output
2
2 1 

user output
2
1 0 

Test 33

Subtask: 3

Verdict:

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

user output
1

Test 34

Subtask: 3

Verdict:

input
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

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

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

Test 35

Subtask: 3

Verdict:

input
KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...

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

user output
190
0 5 6 15 33 32 27 24 17 43 57 ...
Truncated

Test 36

Subtask: 3

Verdict:

input
ILYLILYLVJILYLVJZCCQDLFRLSXZDM...

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

user output
56
0 4 112 101 83 80 54 53 10 141...
Truncated

Test 37

Subtask: 3

Verdict:

input
ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...

correct output
2
1 2 

user output
2
0 1 

Test 38

Subtask: 3

Verdict:

input
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...

correct output
1

user output
1

Test 39

Subtask: 3

Verdict:

input
AIVHCGUMKSTIYBRNPONXHRFVBKPYHX...

correct output
-1

user output
(empty)

Test 40

Subtask: 3

Verdict:

input
QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...

correct output
-1

user output
(empty)

Test 41

Subtask: 3

Verdict:

input
ABABABABABABABABABABABABABABAB...

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

user output
499
996 994 992 990 988 986 984 98...
Truncated

Test 42

Subtask: 3

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1