CSES - Datatähti 2019 alku - Results
Submission details
Task:Leimasin
Sender:ELlAS
Submission time:2018-10-14 15:23:54 +0300
Language:Java
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.27 s1details
#20.23 s1details
#30.23 s1details
#40.23 s1details
#50.23 s1details
#6ACCEPTED0.28 s1details
#70.23 s1details
#80.23 s1details
#90.23 s1details
#100.23 s1details
#11ACCEPTED0.22 s1details
#12ACCEPTED0.22 s1details
#130.23 s1details
#140.28 s1details
#15ACCEPTED0.29 s2details
#160.22 s2details
#170.23 s2details
#180.23 s2details
#190.23 s2details
#20ACCEPTED0.29 s2details
#210.22 s2details
#220.23 s2details
#230.23 s2details
#240.23 s2details
#25ACCEPTED0.23 s2details
#26ACCEPTED0.22 s2details
#270.23 s2details
#280.27 s2details
#29ACCEPTED0.32 s3details
#300.23 s3details
#310.23 s3details
#320.23 s3details
#330.23 s3details
#34ACCEPTED0.32 s3details
#350.23 s3details
#360.23 s3details
#370.23 s3details
#380.22 s3details
#39ACCEPTED0.23 s3details
#40ACCEPTED0.23 s3details
#410.23 s3details
#420.30 s3details

Code

import java.util.Scanner;


public class Main {

    public static void main(String [] args) {
        Scanner scanner = new Scanner(System.in);

        //  Syöte
        String text = scanner.nextLine();
        String stamp = scanner.nextLine();

        //  Sizes of strings
        int size = text.length();
        int length = stamp.length();


        //  Output lists
        int[][] indexList = new int[1111][1111];

        //  Counters of stamps
        int counterOfStamps = 0;

        //  Tells, which index list stamp belongs
        int indexOfStamp = 0;

        //  Which character of text last stamp started
        //  Tells, which index of lastindexes list was last index
        int lastIndex = 1;
        //  If we delete too much indexes, no solutions
        int lastLastIndex = 0;
        int[] lastIndexes = new int [1111];

        //  Tells if last stamp ended
        boolean lastIndexWasLength = true;

        //  Tells in which index stamp checking starts
        int startIndex;

        //  If true close program and print -1
        boolean error = false;



        //  Index of character of stamp
        int index = -1;
        for (int i = 0; i < size; i++) {
            ++index;

            if (index < 0){
                error = true;
                break;
            }

            //  If index is more than size of stamp: new stamp is needed
            if (index == length) {
                lastIndexWasLength = true;
                ++indexOfStamp;
                index = 0;
            }

            //  If not needed new stamp
            if (index != 0 && text.charAt(i) == stamp.charAt(index)) {
                if(i == size - 1){
                    if(index != length - 1){
                        continue;
                    }
                }
            }

            //  Needed new stamp
            for (index = 0; index < length; ++index) {

                //  Check if stamp index match text
                if (text.charAt(i) == stamp.charAt(index) && i - index > -1) {

                    //  If character is not first index of stamp, have to be stamped before last stamp
                    if (index != 0) {

                        //  If last stamp didn't end last stamp was miss
                        if (!lastIndexWasLength) {
                            indexList[indexOfStamp][lastIndexes[lastIndex]] = 0;
                            --counterOfStamps;

                            --index;
                            --index;
                            --i;

                            if (index == -1) {
                                ++index;
                            }

                            --lastIndex;
                            if (lastIndex < 0){
                                System.out.println(-1);
                                error = true;
                                break;
                            }

                            if (lastIndexes[lastIndex-1] + length == i) {
                                lastIndexWasLength = true;
                            }

                            continue;
                        }

                        ++indexOfStamp;
                        ++lastIndex;
                    } else {
                        ++lastIndex;
                    }


                    //  Put index of stamp in the list
                    lastIndexes[lastIndex] = i - index;
                    indexList[indexOfStamp][lastIndexes[lastIndex]] = 1;
                    ++counterOfStamps;
                    lastIndexWasLength = false;

                    break;
                }
            }

            if (error){
                break;
            }


            //  If not possible to stamp: print -1
            if (index == length) {
                System.out.println(-1);
                error = true;
                break;
            }
        }


        if (!error) {

            //  Output
            System.out.println(counterOfStamps);
            System.out.println();

            for (; indexOfStamp > -1; --indexOfStamp) {
                int[] list = indexList[indexOfStamp];


                for (int i = 0; i < 1111; ++i) {
                    if (list[i] == 1) {
                        System.out.print((i + 1) + " ");
                    }
                }
            }
        }
    }
}

Test details

Test 1

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

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

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:

input
AAAAAAAAAA
AAAAAAAAAB

correct output
-1

user output
9

1 2 3 4 5 6 7 8 9 

Test 15

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

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

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:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
99

1 2 3 4 5 6 7 8 9 10 11 12 13 ...
Truncated

Test 29

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

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

Test 33

Group: 3

Verdict:

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

user output
-1

Test 34

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

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

Test 38

Group: 3

Verdict:

input
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...

correct output
1

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

Test 42

Group: 3

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
999

1 2 3 4 5 6 7 8 9 10 11 12 13 ...
Truncated