CSES - KILO 2017 2/5 - Results
Submission details
Task:Odd sequence
Sender:TEAM-Patonki
Submission time:2017-09-12 17:29:16 +0300
Language:Java
Status:READY
Result:
Test results
testverdicttime
#1--details
#2--details
#30.35 sdetails
#4--details
#50.11 sdetails
#60.12 sdetails
#7ACCEPTED0.13 sdetails
#8ACCEPTED0.12 sdetails
#9ACCEPTED0.12 sdetails
#100.15 sdetails
#110.11 sdetails
#120.12 sdetails
#13ACCEPTED0.11 sdetails
#14ACCEPTED0.16 sdetails
#15ACCEPTED0.10 sdetails
#16ACCEPTED0.13 sdetails
#17ACCEPTED0.11 sdetails
#18ACCEPTED0.12 sdetails
#190.13 sdetails
#200.11 sdetails
#210.11 sdetails
#22ACCEPTED0.11 sdetails
#23ACCEPTED0.12 sdetails
#24ACCEPTED0.11 sdetails
#25ACCEPTED0.12 sdetails
#26ACCEPTED0.12 sdetails
#27ACCEPTED0.12 sdetails
#280.15 sdetails
#290.14 sdetails
#30ACCEPTED0.12 sdetails
#31ACCEPTED0.11 sdetails
#32ACCEPTED0.16 sdetails
#33ACCEPTED0.12 sdetails
#34ACCEPTED0.12 sdetails
#35ACCEPTED0.16 sdetails
#360.11 sdetails
#370.11 sdetails
#380.13 sdetails
#39ACCEPTED0.11 sdetails
#400.12 sdetails
#41ACCEPTED0.12 sdetails
#420.18 sdetails
#430.10 sdetails
#44ACCEPTED0.12 sdetails
#45ACCEPTED0.13 sdetails
#460.11 sdetails
#47ACCEPTED0.11 sdetails
#480.12 sdetails
#49ACCEPTED0.12 sdetails
#50ACCEPTED0.11 sdetails
#510.11 sdetails

Code

import java.util.ArrayList;
import java.util.Arrays;

public class Kilpalaatikko {

    public static void main(String[] args) {
        IO io = new IO();
        int n = io.nextInt();
        Pari[] taul = new Pari[n + 1];
        taul[0] = new Pari(0, 0);
        for (int i = 1; i <= n; i++) {
            long x = io.nextLong();
            taul[i] = new Pari(i, taul[i - 1].arvo + x);
        }
        Arrays.sort(taul);
//        for (int i = 0; i < taul.length; i++) {
//            System.out.println(taul[i].arvo);
//        }
        int i = 0;
        int j = n;
        while (i < j) {
            if (Math.abs(taul[j].a - taul[i].a) % 2 == 1) {
                break;
            }

            if (taul[i + 1].arvo - taul[i].arvo <= taul[j].arvo - taul[j - 1].arvo) {
                j--;
            } else {
                i++;
            }
        }
        
        io.print(taul[j].arvo - taul[i].arvo);
        io.close(); // TÄYTYY KUTSUA LOPUKSI, muuten tuloste voi jäädä kirjoittamatta

    }

    public static class Pari implements Comparable<Pari> {

        public int a;
        public long arvo;

        public Pari(int a, long arvo) {
            this.a = a;
            this.arvo = arvo;
        }

        @Override
        public int compareTo(Pari o) {
            if (this.arvo - o.arvo <= 0) {
                return -1;
            };
            return 1;
        }
    }
}

Test details

Test 1

Verdict:

input
1000000
0 99833416 198669330 295520206...

correct output
20008336040

user output
(empty)

Test 2

Verdict:

input
1000000
-84 -60 -41 -100 8 -8 -52 -62 ...

correct output
48760

user output
(empty)

Test 3

Verdict:

input
1000000
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...

correct output
5300

user output
(empty)

Error:
Exception in thread "main" java.lang.IllegalArgumentException: Comparison method violates its general contract!
	at java.util.ComparableTimSort.mergeHi(ComparableTimSort.java:866)
	at java.util.ComparableTimSort.mergeAt(ComparableTimSort.java:483)
	at java.util.ComparableTimSort.mergeCollapse(ComparableTimSort.java:406)
	at java.util.ComparableTimSort.sort(ComparableTimSort.java:213)
	at java.util.Arrays.sort(Arrays.java:1246)
	at Kilpalaatikko.main(Kilpalaatikko.java:16)

Test 4

Verdict:

input
1000000
13915014 -15160138 25244495 40...

correct output
105192740048

user output
(empty)

Test 5

Verdict:

input
10
1 1 -1 -1 -1 1 0 -1 1 -1

correct output
1

user output
2

Test 6

Verdict:

input
10
0 -1 1 -1 -1 -1 1 1 -1 -1

correct output
1

user output
3

Test 7

Verdict: ACCEPTED

input
10
1 0 1 -1 0 1 1 1 -1 0

correct output
3

user output
3

Test 8

Verdict: ACCEPTED

input
10
1 0 1 -1 0 1 -1 -1 0 1

correct output
2

user output
2

Test 9

Verdict: ACCEPTED

input
10
0 0 0 0 0 -1 1 -1 1 1

correct output
1

user output
1

Test 10

Verdict:

input
10
1 -1 -1 1 1 0 1 0 1 0

correct output
4

user output
3

Test 11

Verdict:

input
10
0 1 -1 -1 -1 1 1 0 0 0

correct output
2

user output
3

Test 12

Verdict:

input
10
1 -1 -1 -1 -1 1 -1 1 0 1

correct output
2

user output
3

Test 13

Verdict: ACCEPTED

input
10
-1 0 1 0 -1 1 -1 0 1 -1

correct output
1

user output
1

Test 14

Verdict: ACCEPTED

input
10
1 -1 0 1 0 0 -1 0 -1 1

correct output
1

user output
1

Test 15

Verdict: ACCEPTED

input
10
1 1 1 0 -1 1 0 1 -1 1

correct output
3

user output
3

Test 16

Verdict: ACCEPTED

input
10
-1 1 1 0 -1 -1 0 1 0 1

correct output
2

user output
2

Test 17

Verdict: ACCEPTED

input
10
-1 -1 1 0 1 -1 1 1 1 -1

correct output
4

user output
4

Test 18

Verdict: ACCEPTED

input
10
-1 -1 -1 0 1 1 0 -1 1 -1

correct output
2

user output
2

Test 19

Verdict:

input
10
-1 -1 0 -1 -1 -1 -1 0 1 1

correct output
2

user output
5

Test 20

Verdict:

input
10
0 0 -1 -1 1 -1 0 0 1 -1

correct output
1

user output
2

Test 21

Verdict:

input
10
-1 -1 -1 0 0 1 -1 1 0 0

correct output
1

user output
3

Test 22

Verdict: ACCEPTED

input
10
0 0 -1 1 0 -1 0 0 1 -1

correct output
1

user output
1

Test 23

Verdict: ACCEPTED

input
10
-1 0 0 1 0 0 0 0 1 0

correct output
2

user output
2

Test 24

Verdict: ACCEPTED

input
10
0 0 1 1 1 0 1 -1 1 0

correct output
4

user output
4

Test 25

Verdict: ACCEPTED

input
10
-1 0 1 0 -1 0 1 0 1 0

correct output
2

user output
2

Test 26

Verdict: ACCEPTED

input
10
1 -1 -1 1 1 -1 1 1 -1 0

correct output
3

user output
3

Test 27

Verdict: ACCEPTED

input
10
-1 1 -1 1 1 -1 -1 1 1 -1

correct output
1

user output
1

Test 28

Verdict:

input
10
-1 0 -1 -1 -1 -1 -1 -1 -1 1

correct output
1

user output
8

Test 29

Verdict:

input
10
1 0 -1 0 0 -1 0 1 -1 0

correct output
1

user output
2

Test 30

Verdict: ACCEPTED

input
10
-1 1 0 0 -1 1 1 1 0 1

correct output
4

user output
4

Test 31

Verdict: ACCEPTED

input
10
1 1 -1 -1 0 0 1 0 1 -1

correct output
2

user output
2

Test 32

Verdict: ACCEPTED

input
10
1 1 0 1 0 1 0 1 1 0

correct output
6

user output
6

Test 33

Verdict: ACCEPTED

input
10
-1 0 -1 1 1 1 1 -1 1 -1

correct output
3

user output
3

Test 34

Verdict: ACCEPTED

input
10
-1 0 1 1 -1 -1 1 -1 -1 0

correct output
2

user output
2

Test 35

Verdict: ACCEPTED

input
10
-1 -1 -1 1 0 1 -1 0 1 1

correct output
3

user output
3

Test 36

Verdict:

input
10
0 1 1 -1 -1 -1 1 0 0 0

correct output
2

user output
3

Test 37

Verdict:

input
10
-1 1 -1 -1 0 0 -1 0 -1 1

correct output
1

user output
4

Test 38

Verdict:

input
10
-1 1 0 0 0 0 1 -1 -1 -1

correct output
1

user output
3

Test 39

Verdict: ACCEPTED

input
10
-1 -1 -1 1 -1 1 1 1 -1 1

correct output
3

user output
3

Test 40

Verdict:

input
10
0 -1 -1 -1 1 1 1 1 0 1

correct output
4

user output
3

Test 41

Verdict: ACCEPTED

input
10
1 -1 0 1 0 0 0 -1 1 -1

correct output
1

user output
1

Test 42

Verdict:

input
10
-1 0 -1 1 0 -1 0 0 0 -1

correct output
1

user output
2

Test 43

Verdict:

input
10
-1 -1 1 0 1 -1 -1 -1 1 -1

correct output
2

user output
3

Test 44

Verdict: ACCEPTED

input
10
1 0 0 -1 1 -1 -1 1 0 0

correct output
1

user output
1

Test 45

Verdict: ACCEPTED

input
10
1 1 0 -1 1 1 1 -1 0 0

correct output
4

user output
4

Test 46

Verdict:

input
10
1 0 -1 1 -1 0 0 1 -1 -1

correct output
1

user output
2

Test 47

Verdict: ACCEPTED

input
10
0 1 -1 0 1 1 1 0 -1 -1

correct output
3

user output
3

Test 48

Verdict:

input
10
0 0 1 -1 0 1 -1 0 0 -1

correct output
1

user output
2

Test 49

Verdict: ACCEPTED

input
10
-1 0 1 1 0 -1 1 0 -1 1

correct output
2

user output
2

Test 50

Verdict: ACCEPTED

input
10
-1 1 0 1 -1 -1 -1 -1 1 0

correct output
2

user output
2

Test 51

Verdict:

input
3
-10 -5 -2

correct output
-2

user output
17