Code Submission Evaluation System Login

Datatähti 2016 alku

Start:2015-09-28 00:00:00
End:2015-10-12 00:00:00
 

Tasks | Scoreboard | Statistics


CSES - Datatähti 2016 alku - Results
History
2015-10-11 15:23:3366
2015-10-11 15:22:0466
2015-10-11 15:19:5266
2015-10-11 15:15:4166
2015-10-11 12:52:4366
2015-10-10 16:10:5766
2015-10-10 16:07:190
2015-10-10 15:58:050
2015-10-10 15:44:120
2015-10-10 15:14:020
2015-10-10 15:08:2938
2015-10-10 15:05:250
2015-10-10 00:13:130
2015-10-08 18:03:0866
2015-10-08 18:02:44
2015-10-08 17:53:130
2015-10-08 17:46:300
2015-10-08 17:44:130
2015-10-08 17:43:39
2015-10-08 17:10:3738
2015-10-08 17:01:3338
2015-10-08 16:43:4211
2015-10-08 16:34:1211
2015-10-08 16:29:0338
2015-10-08 16:26:5638
2015-10-08 16:23:0327
2015-10-08 16:17:3411
2015-10-08 15:49:320
2015-10-08 15:38:1411
2015-10-08 15:33:1611
2015-10-02 21:14:0511
2015-10-02 17:33:2511
2015-10-02 17:27:300
Task:Bittipeli
Sender:Perdex
Submission time:2015-10-11 15:23:33
Language:Java
Status:READY
Score:66

Feedback

groupverdictscore
#1ACCEPTED11
#2ACCEPTED27
#3ACCEPTED28
#4WRONG ANSWER0

Test results

testverdicttime (s)group
#1ACCEPTED0.18 / 1.001details
#2ACCEPTED0.18 / 1.001details
#3ACCEPTED0.17 / 1.001details
#4ACCEPTED0.17 / 1.001details
#5ACCEPTED0.17 / 1.001details
#6ACCEPTED0.18 / 1.001details
#7ACCEPTED0.17 / 1.001details
#8ACCEPTED0.19 / 1.001details
#9ACCEPTED0.17 / 1.001details
#10ACCEPTED0.18 / 1.001details
#11ACCEPTED0.19 / 1.001details
#12ACCEPTED0.17 / 1.001details
#13ACCEPTED0.17 / 1.001details
#14ACCEPTED0.17 / 1.001details
#15ACCEPTED0.17 / 1.001details
#16ACCEPTED0.17 / 1.001details
#17ACCEPTED0.17 / 1.001details
#18ACCEPTED0.18 / 1.001details
#19ACCEPTED0.17 / 1.001details
#20ACCEPTED0.17 / 1.001details
#21ACCEPTED0.18 / 1.002details
#22ACCEPTED0.18 / 1.002details
#23ACCEPTED0.17 / 1.002details
#24ACCEPTED0.18 / 1.002details
#25ACCEPTED0.18 / 1.002details
#26ACCEPTED0.18 / 1.002details
#27ACCEPTED0.18 / 1.002details
#28ACCEPTED0.17 / 1.002details
#29ACCEPTED0.18 / 1.002details
#30ACCEPTED0.17 / 1.002details
#31ACCEPTED0.17 / 1.002details
#32ACCEPTED0.18 / 1.002details
#33ACCEPTED0.17 / 1.002details
#34ACCEPTED0.17 / 1.002details
#35ACCEPTED0.18 / 1.002details
#36ACCEPTED0.18 / 1.002details
#37ACCEPTED0.17 / 1.002details
#38ACCEPTED0.17 / 1.002details
#39ACCEPTED0.19 / 1.002details
#40ACCEPTED0.17 / 1.002details
#41ACCEPTED0.18 / 1.003details
#42ACCEPTED0.18 / 1.003details
#43ACCEPTED0.17 / 1.003details
#44ACCEPTED0.17 / 1.003details
#45ACCEPTED0.17 / 1.003details
#46ACCEPTED0.16 / 1.003details
#47ACCEPTED0.17 / 1.003details
#48ACCEPTED0.17 / 1.003details
#49ACCEPTED0.19 / 1.003details
#50ACCEPTED0.17 / 1.003details
#51ACCEPTED0.17 / 1.003details
#52ACCEPTED0.17 / 1.003details
#53ACCEPTED0.09 / 1.003details
#54ACCEPTED0.17 / 1.003details
#55ACCEPTED0.17 / 1.003details
#56ACCEPTED0.17 / 1.003details
#57ACCEPTED0.17 / 1.003details
#58ACCEPTED0.26 / 1.003details
#59ACCEPTED0.42 / 1.003details
#60ACCEPTED0.26 / 1.003details
#61ACCEPTED0.17 / 1.004details
#62ACCEPTED0.19 / 1.004details
#63ACCEPTED0.18 / 1.004details
#64ACCEPTED0.17 / 1.004details
#65ACCEPTED0.17 / 1.004details
#66ACCEPTED0.18 / 1.004details
#67ACCEPTED0.18 / 1.004details
#68ACCEPTED0.17 / 1.004details
#69ACCEPTED0.17 / 1.004details
#70ACCEPTED0.17 / 1.004details
#71ACCEPTED0.17 / 1.004details
#72ACCEPTED0.17 / 1.004details
#73ACCEPTED0.17 / 1.004details
#74ACCEPTED0.18 / 1.004details
#75ACCEPTED0.17 / 1.004details
#76ACCEPTED0.20 / 1.004details
#77ACCEPTED0.20 / 1.004details
#78WRONG ANSWER0.68 / 1.004details
#79TIME LIMIT EXCEEDED-- / 1.004details
#80WRONG ANSWER0.72 / 1.004details

Code

import java.util.ArrayList;

public class Bittipeli{
    
    private static boolean solved = false;
    private static ArrayList<Integer> ans = new ArrayList();
    private static final ArrayList<Boolean> bits = new ArrayList();
    //101101001011010010110100101100100101101000101101011001010110101010101010101010101010101010101010101010
    private static long time;
    
    public static void main(String[] args){
        time = System.nanoTime();
        
        IO io = new IO();
        
        char[] c = io.next().toCharArray();
        
        boolean currentBool = c[0] == '1';
        int count = 1;
        
        boolean trueFound = false;
        int falseCount = 0, mostFalses = 0;
        
        for(int i = 1; i < c.length; i++){
            if((c[i] == '1') == currentBool){
                count++;
            }else{
                currentBool = !currentBool;
                
                if(count != 1){
                    falseCount = 0;
                }else{
                    falseCount++;
                    mostFalses = Math.max(mostFalses, falseCount);
                }
                
                bits.add(count != 1);
                
                if(!trueFound && count != 1){
                    trueFound = true;
                    firstTrue = bits.size() - 1;
                }
                
                count = 1;
            }
        }
        if(!trueFound)
            firstTrue = bits.size();
        bits.add(count != 1);
        
        if(firstTrue == 0)
            firstTrue = 1;
        
//        for(boolean b: bits)
//            if(b)
//                io.print(1);
//            else
//                io.print(0);
//        io.flush();
        
        //bits initialized
        if(mostFalses < (double)bits.size()/2)
            take();
        
        
        if(solved){
            io.println(ans.size() + bits.size());
            for(int i: ans)
                io.print(i + " ");
            for(boolean b: bits)
                io.print(1 + " ");
        }else
            io.print("QAQ");
        
//        io.println();
//        io.println((System.nanoTime() - time)/100000 + "*0.1ms");
        
        io.close();
    }
    
    static int firstTrue;
    
    private static void take(){
        
        if(bits.size() == 1){
            if(bits.get(0)){
                ans.add(1);
                bits.remove(0);
                solved = true;
            }
            return;
        }
        
        int counter = 0;
        boolean firstFound = false, allTrue = true;
        
        
        if(bits.get(0)){
            counter++;
            if(!bits.get(1)){
                bits.remove(0);

                ans.add(counter);

                take();

                if(!solved){
                    ans.remove(ans.size()-1);
                    bits.add(0, true);
                }else
                    return;
            }
        }else
            allTrue = false;
        
        
        
        for(int i = firstTrue; i < bits.size() - 1; i++){
            if(System.nanoTime() - time > 500000000)
                    return;
            
            if(counter == 1){
                int falses = 0, top = 0;
                for(boolean b: bits){
                    if(b){
                        falses = 0;
                    }else{
                        falses++;
                        top = Math.max(top, falses);
                    }
                }
                if(top > (double)bits.size() / 2)
                    return;
            }
            
            if(bits.get(i)){
                
                if(!firstFound){
                    firstTrue = Math.max(1, i - 1);
                    firstFound = true;
                }
                
                counter++;
                
                if(!bits.get(i-1) || !bits.get(i+1)){
                    //took from middle
                    
                    boolean first = bits.get(i-1), second = bits.get(i+1);
                    bits.remove(i);
                    bits.remove(i);
                    bits.set(i-1, true);
                    
                    
                    ans.add(counter);
                    take();
                    if(!solved){
                        ans.remove(ans.size()-1);

                        bits.set(i-1, first);
                        bits.add(i, true);
                        bits.add(i+1, second);
                    }else
                        return;
                }
            }else{
                allTrue = false;
                
            }
        }
        
        if(bits.get(bits.size() - 1)){
            counter++;
            if(!bits.get(bits.size() - 2)){
                bits.remove(bits.size() - 1);

                ans.add(counter);

                take();

                if(!solved){
                    ans.remove(ans.size()-1);
                    bits.add(true);
                }else
                    return;
            }
        }else
            allTrue = false;
        
        
        if(allTrue)
            solved = true;
    }//take
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1011001010
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 2

Group: 1

Verdict: ACCEPTED

input
0000001001
view   save

correct output
3
1 1 1
view   save

user output
3
1 1 1
view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
0111011100
view   save

correct output
3
2 1 1
view   save

user output
4
1 1 1 1
view   save

Test 4

Group: 1

Verdict: ACCEPTED

input
0100100100
view   save

correct output
4
2 1 1 1
view   save

user output
4
1 2 1 1
view   save

Test 5

Group: 1

Verdict: ACCEPTED

input
1110010110
view   save

correct output
4
2 1 1 1
view   save

user output
4
2 1 1 1
view   save

Test 6

Group: 1

Verdict: ACCEPTED

input
1111110110
view   save

correct output
3
1 1 1
view   save

user output
3
1 1 1
view   save

Test 7

Group: 1

Verdict: ACCEPTED

input
0011110001
view   save

correct output
3
1 2 1
view   save

user output
3
3 1 1
view   save

Test 8

Group: 1

Verdict: ACCEPTED

input
0111111000
view   save

correct output
2
1 1
view   save

user output
2
1 1
view   save

Test 9

Group: 1

Verdict: ACCEPTED

input
1111111100
view   save

correct output
2
1 1
view   save

user output
2
1 1
view   save

Test 10

Group: 1

Verdict: ACCEPTED

input
1000010011
view   save

correct output
3
2 1 1
view   save

user output
4
1 1 1 1
view   save

Test 11

Group: 1

Verdict: ACCEPTED

input
1101110000
view   save

correct output
3
1 1 1
view   save

user output
3
1 1 1
view   save

Test 12

Group: 1

Verdict: ACCEPTED

input
1101101100
view   save

correct output
4
1 2 1 1
view   save

user output
5
1 1 1 1 1
view   save

Test 13

Group: 1

Verdict: ACCEPTED

input
0100111110
view   save

correct output
3
1 1 1
view   save

user output
3
1 1 1
view   save

Test 14

Group: 1

Verdict: ACCEPTED

input
1101001011
view   save

correct output
4
2 2 2 1
view   save

user output
5
1 1 1 1 1
view   save

Test 15

Group: 1

Verdict: ACCEPTED

input
1110110010
view   save

correct output
4
1 2 1 1
view   save

user output
4
1 2 1 1
view   save

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100
view   save

correct output
3
3 2 1
view   save

user output
4
2 1 1 1
view   save

Test 17

Group: 1

Verdict: ACCEPTED

input
1100101011
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 18

Group: 1

Verdict: ACCEPTED

input
1101100111
view   save

correct output
3
2 2 1
view   save

user output
4
1 1 1 1
view   save

Test 19

Group: 1

Verdict: ACCEPTED

input
0110000100
view   save

correct output
3
2 1 1
view   save

user output
3
2 1 1
view   save

Test 20

Group: 1

Verdict: ACCEPTED

input
0000101000
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 21

Group: 2

Verdict: ACCEPTED

input
1110010100
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 22

Group: 2

Verdict: ACCEPTED

input
1110010000
view   save

correct output
3
2 1 1
view   save

user output
3
2 1 1
view   save

Test 23

Group: 2

Verdict: ACCEPTED

input
1001101100
view   save

correct output
4
1 1 1 1
view   save

user output
4
1 1 1 1
view   save

Test 24

Group: 2

Verdict: ACCEPTED

input
0000000111
view   save

correct output
2
1 1
view   save

user output
2
1 1
view   save

Test 25

Group: 2

Verdict: ACCEPTED

input
0011111110
view   save

correct output
2
2 1
view   save

user output
2
2 1
view   save

Test 26

Group: 2

Verdict: ACCEPTED

input
1100101100
view   save

correct output
4
2 1 1 1
view   save

user output
4
2 1 1 1
view   save

Test 27

Group: 2

Verdict: ACCEPTED

input
0111101110
view   save

correct output
3
2 1 1
view   save

user output
3
1 2 1
view   save

Test 28

Group: 2

Verdict: ACCEPTED

input
0000011011
view   save

correct output
3
2 1 1
view   save

user output
3
2 1 1
view   save

Test 29

Group: 2

Verdict: ACCEPTED

input
1110011101
view   save

correct output
3
3 2 1
view   save

user output
3
3 2 1
view   save

Test 30

Group: 2

Verdict: ACCEPTED

input
0001011011
view   save

correct output
4
1 1 1 1
view   save

user output
4
1 1 1 1
view   save

Test 31

Group: 2

Verdict: ACCEPTED

input
0010110011
view   save

correct output
4
1 1 1 1
view   save

user output
4
1 1 1 1
view   save

Test 32

Group: 2

Verdict: ACCEPTED

input
0011100000
view   save

correct output
2
2 1
view   save

user output
3
1 1 1
view   save

Test 33

Group: 2

Verdict: ACCEPTED

input
1110100110
view   save

correct output
4
1 1 1 1
view   save

user output
4
1 1 1 1
view   save

Test 34

Group: 2

Verdict: ACCEPTED

input
0110110111
view   save

correct output
4
2 1 1 1
view   save

user output
4
1 2 1 1
view   save

Test 35

Group: 2

Verdict: ACCEPTED

input
1110110010
view   save

correct output
4
1 2 1 1
view   save

user output
4
1 2 1 1
view   save

Test 36

Group: 2

Verdict: ACCEPTED

input
110011001100110011001010101010...
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 37

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100101010...
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 38

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
31
1 20 20 20 20 20 20 20 20 20 2...
view   save

user output
40
20 19 18 17 16 15 14 13 12 11 ...
view   save

Test 39

Group: 2

Verdict: ACCEPTED

input
010101010101010101010101010101...
view   save

correct output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

user output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

Test 40

Group: 2

Verdict: ACCEPTED

input
011010000011111011110000110011...
view   save

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

user output
25
1 1 1 1 1 4 3 4 3 2 3 2 1 1 1 ...
view   save

Test 41

Group: 3

Verdict: ACCEPTED

input
0010101000
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 42

Group: 3

Verdict: ACCEPTED

input
0100010110
view   save

correct output
4
2 1 1 1
view   save

user output
4
1 1 2 1
view   save

Test 43

Group: 3

Verdict: ACCEPTED

input
0100110110
view   save

correct output
4
2 1 1 1
view   save

user output
4
1 1 2 1
view   save

Test 44

Group: 3

Verdict: ACCEPTED

input
1110000001
view   save

correct output
2
2 1
view   save

user output
2
2 1
view   save

Test 45

Group: 3

Verdict: ACCEPTED

input
0001001110
view   save

correct output
3
2 2 1
view   save

user output
3
2 2 1
view   save

Test 46

Group: 3

Verdict: ACCEPTED

input
0011100011
view   save

correct output
3
1 2 1
view   save

user output
4
1 1 1 1
view   save

Test 47

Group: 3

Verdict: ACCEPTED

input
0100111100
view   save

correct output
3
1 1 1
view   save

user output
3
1 1 1
view   save

Test 48

Group: 3

Verdict: ACCEPTED

input
0001001000
view   save

correct output
3
2 2 1
view   save

user output
4
1 1 1 1
view   save

Test 49

Group: 3

Verdict: ACCEPTED

input
0100100010
view   save

correct output
4
2 1 1 1
view   save

user output
4
1 2 1 1
view   save

Test 50

Group: 3

Verdict: ACCEPTED

input
1100101110
view   save

correct output
4
2 1 1 1
view   save

user output
4
2 1 1 1
view   save

Test 51

Group: 3

Verdict: ACCEPTED

input
1000111011
view   save

correct output
3
2 1 1
view   save

user output
3
2 1 1
view   save

Test 52

Group: 3

Verdict: ACCEPTED

input
1000111111
view   save

correct output
2
1 1
view   save

user output
2
1 1
view   save

Test 53

Group: 3

Verdict: ACCEPTED

input
0110011100
view   save

correct output
3
2 1 1
view   save

user output
4
1 1 1 1
view   save

Test 54

Group: 3

Verdict: ACCEPTED

input
0001000110
view   save

correct output
3
2 2 1
view   save

user output
3
2 2 1
view   save

Test 55

Group: 3

Verdict: ACCEPTED

input
1110110010
view   save

correct output
4
1 2 1 1
view   save

user output
4
1 2 1 1
view   save

Test 56

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 57

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 58

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
1501
1 1000 1000 1000 1000 1000 100...
view   save

user output
2000
1000 999 998 997 996 995 994 9...
view   save

Test 59

Group: 3

Verdict: ACCEPTED

input
010101010101010101010101010101...
view   save

correct output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

user output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

Test 60

Group: 3

Verdict: ACCEPTED

input
011100011001011111111000010110...
view   save

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

user output
1294
1 3 2 3 2 2 1 1 1 1 2 3 4 3 4 ...
view   save

Test 61

Group: 4

Verdict: ACCEPTED

input
1110101110
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 62

Group: 4

Verdict: ACCEPTED

input
0111001011
view   save

correct output
4
2 1 1 1
view   save

user output
4
2 1 1 1
view   save

Test 63

Group: 4

Verdict: ACCEPTED

input
1101111101
view   save

correct output
3
2 2 1
view   save

user output
3
2 2 1
view   save

Test 64

Group: 4

Verdict: ACCEPTED

input
1001110001
view   save

correct output
3
2 1 1
view   save

user output
3
1 2 1
view   save

Test 65

Group: 4

Verdict: ACCEPTED

input
1000000011
view   save

correct output
2
1 1
view   save

user output
2
1 1
view   save

Test 66

Group: 4

Verdict: ACCEPTED

input
0100010111
view   save

correct output
4
1 1 1 1
view   save

user output
4
1 1 1 1
view   save

Test 67

Group: 4

Verdict: ACCEPTED

input
0100111010
view   save

correct output
4
2 1 1 1
view   save

user output
4
2 1 1 1
view   save

Test 68

Group: 4

Verdict: ACCEPTED

input
0010111101
view   save

correct output
4
1 1 1 1
view   save

user output
4
1 1 1 1
view   save

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000
view   save

correct output
2
2 1
view   save

user output
3
1 1 1
view   save

Test 70

Group: 4

Verdict: ACCEPTED

input
1101001101
view   save

correct output
4
2 2 2 1
view   save

user output
4
2 2 2 1
view   save

Test 71

Group: 4

Verdict: ACCEPTED

input
0110111000
view   save

correct output
3
2 1 1
view   save

user output
4
1 1 1 1
view   save

Test 72

Group: 4

Verdict: ACCEPTED

input
1100110111
view   save

correct output
3
3 2 1
view   save

user output
4
3 1 1 1
view   save

Test 73

Group: 4

Verdict: ACCEPTED

input
1110011111
view   save

correct output
2
2 1
view   save

user output
3
1 1 1
view   save

Test 74

Group: 4

Verdict: ACCEPTED

input
1011000101
view   save

correct output
4
2 1 1 1
view   save

user output
4
2 1 1 1
view   save

Test 75

Group: 4

Verdict: ACCEPTED

input
1110110010
view   save

correct output
4
1 2 1 1
view   save

user output
4
1 2 1 1
view   save

Test 76

Group: 4

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 77

Group: 4

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 78

Group: 4

Verdict: WRONG ANSWER

input
110011001100110011001100110011...
view   save

correct output
30001
1 20000 20000 20000 20000 2000...
view   save

user output
QAQ
view   save

Test 79

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
010101010101010101010101010101...
view   save

correct output
49998
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

user output
(no output)
view   save

Test 80

Group: 4

Verdict: WRONG ANSWER

input
111000110000011000001101010010...
view   save

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

user output
QAQ
view   save