CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:testUser
Submission time:2015-10-11 23:16:53
Language:Java
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1--1details
#2ACCEPTED0.17 s1details
#3ACCEPTED0.17 s1details
#4ACCEPTED0.18 s1details
#5ACCEPTED0.20 s1details
#6ACCEPTED0.17 s1details
#7ACCEPTED0.17 s1details
#8ACCEPTED0.17 s1details
#9ACCEPTED0.18 s1details
#10ACCEPTED0.17 s1details
#11ACCEPTED0.17 s1details
#12ACCEPTED0.18 s1details
#13ACCEPTED0.18 s1details
#14ACCEPTED0.18 s1details
#15ACCEPTED0.19 s1details
#16ACCEPTED0.18 s1details
#17--1details
#18ACCEPTED0.18 s1details
#19ACCEPTED0.17 s1details
#20--1details
#21--2details
#22ACCEPTED0.17 s2details
#23ACCEPTED0.17 s2details
#24ACCEPTED0.17 s2details
#25ACCEPTED0.19 s2details
#26ACCEPTED0.18 s2details
#27ACCEPTED0.18 s2details
#28ACCEPTED0.18 s2details
#290.19 s2details
#30ACCEPTED0.17 s2details
#31ACCEPTED0.17 s2details
#32ACCEPTED0.18 s2details
#33ACCEPTED0.18 s2details
#34ACCEPTED0.18 s2details
#35ACCEPTED0.17 s2details
#36--2details
#37--2details
#38--2details
#39--2details
#40--2details
#41--3details
#42ACCEPTED0.18 s3details
#43ACCEPTED0.18 s3details
#44ACCEPTED0.18 s3details
#450.17 s3details
#46ACCEPTED0.19 s3details
#47ACCEPTED0.17 s3details
#48ACCEPTED0.18 s3details
#49ACCEPTED0.18 s3details
#50ACCEPTED0.18 s3details
#51ACCEPTED0.17 s3details
#52ACCEPTED0.18 s3details
#53ACCEPTED0.18 s3details
#540.17 s3details
#55ACCEPTED0.17 s3details
#56--3details
#57--3details
#58--3details
#59--3details
#60--3details
#61--4details
#62ACCEPTED0.17 s4details
#630.18 s4details
#640.18 s4details
#65ACCEPTED0.20 s4details
#66ACCEPTED0.19 s4details
#670.19 s4details
#68ACCEPTED0.18 s4details
#69ACCEPTED0.19 s4details
#700.18 s4details
#71ACCEPTED0.17 s4details
#72ACCEPTED0.18 s4details
#73ACCEPTED0.17 s4details
#740.18 s4details
#75ACCEPTED0.19 s4details
#76--4details
#77--4details
#78--4details
#79--4details
#80--4details

Code

/**
 * Created by Frans on 11.10.2015.
 */
public class Bitti {

    static int[] jono;
    static int[] poisto;
    static int pituus;
    static int poistoPituus;
    static String vastaus;
    static boolean possibleWhole;

    static int sarjaTaulukko[];
    static int lyhytBitti;


    public static void main(String[] args) {
        IO io = new IO();

        final char[] line = io.next().toCharArray();
        int length = line.length;

        jono = new int[length+1];
        //poisto = new int[length+10];

        int vanha = 0;
        int vanhaTmp = 0;
        pituus = 0;
        poistoPituus = 0;
        vastaus = "";

        String vastaus2 = "";
        possibleWhole = true;

        boolean poistettu = false;

        int[][] yksinainen = {{0,0},{0,0}};
        int[] yksinainenMaara = {0,0};
        int[][] yksinainenLyhytBitti = {{0,0},{0,0}};

        lyhytBitti =0;
        sarjaTaulukko = new int[length+1];

        stillPossible:
        {

            for (int i = 1; i <= length; i++) {

                int tmpNyt = (int) (line[i - 1]) - 48; // 0 tai 1
                int nyt = tmpNyt * 2 - 1; // -1,-2 tai 1,2


                if (nyt + vanha == 2 || nyt + vanha == -2) {
                    jono[pituus] = nyt * 2;
                } else {

                    //yksinainen loydetty
                    if (jono[pituus]*jono[pituus] == 1){

                        lyhytBitti ++;
                        sarjaTaulukko[pituus] = pituus-lyhytBitti;

                        int yksNyt = 1 - tmpNyt; //vastakkainen kuin nyt
                        yksinainen[yksNyt][yksinainenMaara[yksNyt]]=pituus+1;
                        yksinainenMaara[yksNyt] ++;

                        if (yksinainenMaara[yksNyt] == 2){
                            if (!valiRatkaisu(yksinainen[yksNyt][0], (pituus-1))) {
                                possibleWhole = false;
                                int A = 8;
                                while(A >0){
                                    A += Math.sqrt(A);
                                }
                                break stillPossible;
                            }
                            jono[pituus -1] = jono[pituus - 1] * 2;
                            pituus = pituus - 1;
                            yksinainenMaara[yksNyt] = 0;
                            lyhytBitti = pituus-sarjaTaulukko[yksinainen[yksNyt][0]-1]-1;
                            //jos yksinainen oli loydetty poistetusta alueesta
                            if (yksinainen[tmpNyt][0]>=yksinainen[yksNyt][0]){
                                yksinainenMaara[tmpNyt] = 0;
                            }
                        }
                    }

                    pituus++;
                    jono[pituus] = nyt;

                }
            /*
            if (pituus >= 3) {

                //lyhmmin patkan poisto
                if (jono[pituus - 2] + jono[pituus - 1] + jono[pituus] == 0) { // 1, -2, 1 or -1, 2, -1
                    poistoPituus++;
                    vastaus = vastaus + (pituus - 1) + " ";
                    jono[pituus - 2] = jono[pituus - 2] * 2;
                    pituus = pituus - 2;
                    poistettu = true;
                }
            }
            */
                vanha = nyt;
                vanhaTmp = tmpNyt;
                sarjaTaulukko[pituus] = pituus-lyhytBitti;
            }

            //silmukan viimeinen lasketaan yksinaiseksi, jos on pariton maara
            if (yksinainenMaara[vanhaTmp]==1){
                if (!valiRatkaisu(yksinainen[vanhaTmp][0], (pituus-1))) {
                    possibleWhole = false;
                    int A = 8;
                    while(A >0){
                        A += Math.sqrt(A);
                    }
                    break stillPossible;
                }
                jono[pituus -1] = jono[pituus - 1] * 2;
                pituus = pituus - 1;
                lyhytBitti = pituus-sarjaTaulukko[yksinainen[vanhaTmp][0]-1]-1;
            }

            if (!valiRatkaisu(1, pituus)){
                possibleWhole = false;
            }


        }

        if (possibleWhole){
            io.println(poistoPituus);
            io.println(vastaus);
        }else{
            io.println("QAQ");
        }

        //io.println(line);
        io.close();


    }

    private static boolean valiRatkaisu(int start, int end){
        boolean found = true;

        int tmpPituus = pituus;
        int tmpPoistoPituus = poistoPituus;
        String tmpVastaus = vastaus;

        if (!valiRatkaisu3(start, end)){
            pituus = tmpPituus;
            poistoPituus = tmpPoistoPituus;
            vastaus = tmpVastaus;
            if (!valiRatkaisu2(start, end)){
                found = false;
                pituus = tmpPituus;
                poistoPituus = tmpPoistoPituus;
                vastaus = tmpVastaus;
            }
        }

        return found;
    }

    private static boolean valiRatkaisu3(int start, int end){

        int length = end-start+1;
        int[] valiJono = new int[length+1];
        System.arraycopy(jono,start,valiJono,1,length);
        System.arraycopy(jono,end+1,jono,start,pituus-end);
        pituus -= length;

        int poistetutSarjat = 0;

        boolean possible = true;
        for(int i=3; i<=length; i++){
            int a = Math.abs(valiJono[i-1]);
            int b = Math.abs(valiJono[i]+valiJono[i-2]);
            if (Math.abs(valiJono[i-1])==2 && Math.abs(valiJono[i]+valiJono[i-2])==3 ){  // 1, -2, 2 or -2, 2, -1
                poistoPituus ++;
                vastaus = vastaus +(sarjaTaulukko[start+i-2-poistetutSarjat])+ " ";
                System.arraycopy(valiJono,i+1,valiJono,i-1,length-i);
                valiJono[i-2] = -valiJono[i-1]; //muutetaan se arvoksi 2
                //valiJono[length-2] = valiJono[length-2] * 2;
                i = i -2;
                length = length -2;
                poistetutSarjat ++;
            }
        }

        for (int i=1; i<=length; i++){
            if(Math.abs(valiJono[i]) == 1){ //yksinainen 1 jaljella
                possible = false;
                break;
            }else{
                poistoPituus ++;
                vastaus = vastaus +(sarjaTaulukko[start-1]+1)+ " ";
            }

        }

        return possible;
    }

    private static boolean valiRatkaisu2(int start, int end){

        int length = end-start+1;
        int[] valiJono = new int[length+1];
        System.arraycopy(jono,start,valiJono,1,length);
        System.arraycopy(jono,end+1,jono,start,pituus-end);
        pituus -= length;

        int poistetutSarjat = 0;

        boolean possible = true;
        for(int i=length; i>=3; i--){
            int a = Math.abs(valiJono[i-1]);
            int b = Math.abs(valiJono[i]+valiJono[i-2]);
            if (Math.abs(valiJono[i-1])==2 && Math.abs(valiJono[i]+valiJono[i-2])==3 ){  // 1, -2, 2 or -2, 2, -1
                poistoPituus ++;
                vastaus = vastaus +(sarjaTaulukko[start+i-2-poistetutSarjat])+ " ";
                System.arraycopy(valiJono,i+1,valiJono,i-1,length-i);
                valiJono[i-2] = -valiJono[i-1]; //muutetaan se arvoksi 2
                //valiJono[length-2] = valiJono[length-2] * 2;
                i = i -2;
                length = length -2;
                poistetutSarjat ++;
            }
        }

        for (int i=length; i>=1; i--){
            if(Math.abs(valiJono[i]) == 1){ //yksinainen 1 jaljella
                possible = false;
                break;
            }else{
                poistoPituus ++;
                vastaus = vastaus +(sarjaTaulukko[start-1]+1)+ " ";
            }

        }

        return possible;
    }



}

Test details

Test 1

Group: 1

Verdict:

input
1011001010

correct output
QAQ

user output
(empty)

Test 2

Group: 1

Verdict: ACCEPTED

input
0000001001

correct output
3
1 1 1 

user output
3
2 1 1 

Test 3

Group: 1

Verdict: ACCEPTED

input
0111011100

correct output
3
2 1 1 

user output
4
1 1 1 1 

Test 4

Group: 1

Verdict: ACCEPTED

input
0100100100

correct output
4
2 1 1 1 

user output
4
1 2 1 1 

Test 5

Group: 1

Verdict: ACCEPTED

input
1110010110

correct output
4
2 1 1 1 

user output
4
3 2 1 1 

Test 6

Group: 1

Verdict: ACCEPTED

input
1111110110

correct output
3
1 1 1 

user output
3
2 1 1 

Test 7

Group: 1

Verdict: ACCEPTED

input
0011110001

correct output
3
1 2 1 

user output
3
3 1 1 

Test 8

Group: 1

Verdict: ACCEPTED

input
0111111000

correct output
2
1 1 

user output
2
1 1 

Test 9

Group: 1

Verdict: ACCEPTED

input
1111111100

correct output
2
1 1 

user output
2
1 1 

Test 10

Group: 1

Verdict: ACCEPTED

input
1000010011

correct output
3
2 1 1 

user output
4
1 1 1 1 

Test 11

Group: 1

Verdict: ACCEPTED

input
1101110000

correct output
3
1 1 1 

user output
3
2 1 1 

Test 12

Group: 1

Verdict: ACCEPTED

input
1101101100

correct output
4
1 2 1 1 

user output
5
2 1 1 1 1 

Test 13

Group: 1

Verdict: ACCEPTED

input
0100111110

correct output
3
1 1 1 

user output
3
1 1 1 

Test 14

Group: 1

Verdict: ACCEPTED

input
1101001011

correct output
4
2 2 2 1 

user output
5
2 2 1 1 1 

Test 15

Group: 1

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 1 1 

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100

correct output
3
3 2 1 

user output
4
3 1 1 1 

Test 17

Group: 1

Verdict:

input
1100101011

correct output
QAQ

user output
(empty)

Test 18

Group: 1

Verdict: ACCEPTED

input
1101100111

correct output
3
2 2 1 

user output
4
2 1 1 1 

Test 19

Group: 1

Verdict: ACCEPTED

input
0110000100

correct output
3
2 1 1 

user output
3
2 1 1 

Test 20

Group: 1

Verdict:

input
0000101000

correct output
QAQ

user output
(empty)

Test 21

Group: 2

Verdict:

input
1110010100

correct output
QAQ

user output
(empty)

Test 22

Group: 2

Verdict: ACCEPTED

input
1110010000

correct output
3
2 1 1 

user output
3
2 1 1 

Test 23

Group: 2

Verdict: ACCEPTED

input
1001101100

correct output
4
1 1 1 1 

user output
4
3 1 1 1 

Test 24

Group: 2

Verdict: ACCEPTED

input
0000000111

correct output
2
1 1 

user output
2
1 1 

Test 25

Group: 2

Verdict: ACCEPTED

input
0011111110

correct output
2
2 1 

user output
2
2 1 

Test 26

Group: 2

Verdict: ACCEPTED

input
1100101100

correct output
4
2 1 1 1 

user output
4
3 2 1 1 

Test 27

Group: 2

Verdict: ACCEPTED

input
0111101110

correct output
3
2 1 1 

user output
3
1 2 1 

Test 28

Group: 2

Verdict: ACCEPTED

input
0000011011

correct output
3
2 1 1 

user output
3
2 1 1 

Test 29

Group: 2

Verdict:

input
1110011101

correct output
3
3 2 1 

user output
QAQ

Test 30

Group: 2

Verdict: ACCEPTED

input
0001011011

correct output
4
1 1 1 1 

user output
4
2 2 1 1 

Test 31

Group: 2

Verdict: ACCEPTED

input
0010110011

correct output
4
1 1 1 1 

user output
4
2 2 1 1 

Test 32

Group: 2

Verdict: ACCEPTED

input
0011100000

correct output
2
2 1 

user output
3
1 1 1 

Test 33

Group: 2

Verdict: ACCEPTED

input
1110100110

correct output
4
1 1 1 1 

user output
4
2 2 1 1 

Test 34

Group: 2

Verdict: ACCEPTED

input
0110110111

correct output
4
2 1 1 1 

user output
4
1 2 1 1 

Test 35

Group: 2

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 1 1 

Test 36

Group: 2

Verdict:

input
110011001100110011001010101010...

correct output
QAQ

user output
(empty)

Test 37

Group: 2

Verdict:

input
110011001100110011001100101010...

correct output
QAQ

user output
(empty)

Test 38

Group: 2

Verdict:

input
110011001100110011001100110011...

correct output
31
1 20 20 20 20 20 20 20 20 20 2...

user output
(empty)

Test 39

Group: 2

Verdict:

input
010101010101010101010101010101...

correct output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
(empty)

Test 40

Group: 2

Verdict:

input
011010000011111011110000110011...

correct output
23
13 13 12 11 11 11 11 10 9 9 9 ...

user output
(empty)

Test 41

Group: 3

Verdict:

input
0010101000

correct output
QAQ

user output
(empty)

Test 42

Group: 3

Verdict: ACCEPTED

input
0100010110

correct output
4
2 1 1 1 

user output
4
1 1 2 1 

Test 43

Group: 3

Verdict: ACCEPTED

input
0100110110

correct output
4
2 1 1 1 

user output
4
1 1 2 1 

Test 44

Group: 3

Verdict: ACCEPTED

input
1110000001

correct output
2
2 1 

user output
2
2 1 

Test 45

Group: 3

Verdict:

input
0001001110

correct output
3
2 2 1 

user output
QAQ

Test 46

Group: 3

Verdict: ACCEPTED

input
0011100011

correct output
3
1 2 1 

user output
4
1 1 1 1 

Test 47

Group: 3

Verdict: ACCEPTED

input
0100111100

correct output
3
1 1 1 

user output
3
1 1 1 

Test 48

Group: 3

Verdict: ACCEPTED

input
0001001000

correct output
3
2 2 1 

user output
4
2 1 1 1 

Test 49

Group: 3

Verdict: ACCEPTED

input
0100100010

correct output
4
2 1 1 1 

user output
4
1 2 1 1 

Test 50

Group: 3

Verdict: ACCEPTED

input
1100101110

correct output
4
2 1 1 1 

user output
4
3 2 1 1 

Test 51

Group: 3

Verdict: ACCEPTED

input
1000111011

correct output
3
2 1 1 

user output
3
2 1 1 

Test 52

Group: 3

Verdict: ACCEPTED

input
1000111111

correct output
2
1 1 

user output
2
1 1 

Test 53

Group: 3

Verdict: ACCEPTED

input
0110011100

correct output
3
2 1 1 

user output
4
1 1 1 1 

Test 54

Group: 3

Verdict:

input
0001000110

correct output
3
2 2 1 

user output
QAQ

Test 55

Group: 3

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 1 1 

Test 56

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 57

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 58

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
1501
1 1000 1000 1000 1000 1000 100...

user output
(empty)

Test 59

Group: 3

Verdict:

input
010101010101010101010101010101...

correct output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
(empty)

Test 60

Group: 3

Verdict:

input
011100011001011111111000010110...

correct output
1272
1 1 648 647 646 646 645 645 64...

user output
(empty)

Test 61

Group: 4

Verdict:

input
1110101110

correct output
QAQ

user output
(empty)

Test 62

Group: 4

Verdict: ACCEPTED

input
0111001011

correct output
4
2 1 1 1 

user output
4
2 1 1 1 

Test 63

Group: 4

Verdict:

input
1101111101

correct output
3
2 2 1 

user output
3
2 1 1 

Test 64

Group: 4

Verdict:

input
1001110001

correct output
3
2 1 1 

user output
4
1 1 1 1 

Test 65

Group: 4

Verdict: ACCEPTED

input
1000000011

correct output
2
1 1 

user output
2
1 1 

Test 66

Group: 4

Verdict: ACCEPTED

input
0100010111

correct output
4
1 1 1 1 

user output
4
1 1 1 1 

Test 67

Group: 4

Verdict:

input
0100111010

correct output
4
2 1 1 1 

user output
QAQ

Test 68

Group: 4

Verdict: ACCEPTED

input
0010111101

correct output
4
1 1 1 1 

user output
4
2 2 1 1 

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000

correct output
2
2 1 

user output
3
1 1 1 

Test 70

Group: 4

Verdict:

input
1101001101

correct output
4
2 2 2 1 

user output
4
2 2 1 1 

Test 71

Group: 4

Verdict: ACCEPTED

input
0110111000

correct output
3
2 1 1 

user output
4
1 1 1 1 

Test 72

Group: 4

Verdict: ACCEPTED

input
1100110111

correct output
3
3 2 1 

user output
4
3 1 1 1 

Test 73

Group: 4

Verdict: ACCEPTED

input
1110011111

correct output
2
2 1 

user output
3
1 1 1 

Test 74

Group: 4

Verdict:

input
1011000101

correct output
4
2 1 1 1 

user output
QAQ

Test 75

Group: 4

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 1 1 

Test 76

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 77

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 78

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
30001
1 20000 20000 20000 20000 2000...

user output
(empty)

Test 79

Group: 4

Verdict:

input
010101010101010101010101010101...

correct output
49998
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
(empty)

Test 80

Group: 4

Verdict:

input
111000110000011000001101010010...

correct output
25011
1 12471 12470 12469 12468 1246...

user output
(empty)