CSES - KILO 2017 4/5

Submission details
Task:	Sticky Situation
Sender:	TEAM-Patonki
Submission time:	2017-09-26 17:52:08 +0300
Language:	Java
Status:	READY
Result:	ACCEPTED

Test results
test	verdict	time
#1	ACCEPTED	0.12 s	details
#2	ACCEPTED	0.14 s	details
#3	ACCEPTED	0.13 s	details
#4	ACCEPTED	0.12 s	details
#5	ACCEPTED	0.17 s	details
#6	ACCEPTED	0.13 s	details
#7	ACCEPTED	0.12 s	details
#8	ACCEPTED	0.11 s	details
#9	ACCEPTED	0.11 s	details
#10	ACCEPTED	0.12 s	details
#11	ACCEPTED	0.12 s	details
#12	ACCEPTED	0.14 s	details
#13	ACCEPTED	0.14 s	details
#14	ACCEPTED	0.12 s	details
#15	ACCEPTED	0.14 s	details
#16	ACCEPTED	0.11 s	details
#17	ACCEPTED	0.16 s	details
#18	ACCEPTED	0.16 s	details
#19	ACCEPTED	0.15 s	details
#20	ACCEPTED	0.15 s	details
#21	ACCEPTED	0.15 s	details
#22	ACCEPTED	0.15 s	details
#23	ACCEPTED	0.14 s	details
#24	ACCEPTED	0.12 s	details
#25	ACCEPTED	0.12 s	details
#26	ACCEPTED	0.11 s	details
#27	ACCEPTED	0.17 s	details
#28	ACCEPTED	0.15 s	details
#29	ACCEPTED	0.13 s	details
#30	ACCEPTED	0.14 s	details
#31	ACCEPTED	0.14 s	details
#32	ACCEPTED	0.13 s	details
#33	ACCEPTED	0.13 s	details
#34	ACCEPTED	0.14 s	details
#35	ACCEPTED	0.20 s	details
#36	ACCEPTED	0.17 s	details
#37	ACCEPTED	0.12 s	details
#38	ACCEPTED	0.20 s	details
#39	ACCEPTED	0.16 s	details

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();
        long[] table = new long[n];
        for (int i = 0; i < n; i++) {
            table[i] = io.nextLong();
        }
        Arrays.sort(table);
        boolean poss = false;
        for (int i = 2; i < n; i++) {
            if (table[i] < table[i - 1] + table[i - 2]) {
                poss = true;
            }
        }

        if (poss) {
            io.print("possible");
        } else {
            io.print("impossible");
        }

        io.close(); // TÄYTYY KUTSUA LOPUKSI, muuten tuloste voi jäädä kirjoittamatta

    }

}
//import java.util.ArrayDeque;
//import java.util.ArrayList;
//import java.util.Arrays;
//import java.util.Deque;
//import java.util.PriorityQueue;
//import java.util.Queue;
//
//public class Kilpalaatikko {
//
//    public static void main(String[] args) {
//        IO io = new IO();
//        int n = io.nextInt();
//        int m = io.nextInt();
//        ArrayList<pari>[] arraylist = new ArrayList[n + 1];
//        for (int i = 0; i < n + 1; i++) {
//            arraylist[i] = new ArrayList<>();
//        }
//        Queue<pari> jono = new PriorityQueue<pari>();
//        for (int i = 0; i < m; i++) {
//            int a = io.nextInt();
//            int b = io.nextInt();
//            int c = io.nextInt();
//
//            arraylist[a].add(new pari(b, c, 0));
//            arraylist[b].add(new pari(a, c, 0));
//        }
//        boolean[] visited = new boolean[n + 1];
//        int[] d = new int[n + 1];
//        for (int i = 0; i < n + 1; i++) {
//            d[i] = Integer.MAX_VALUE;
//        }
//
//        int[] monta = new int[n + 1];
//        monta[1] = 1;
//
//        d[1] = 0;
//        jono.add(new pari(1, 0, 0));
//
//        while (!jono.isEmpty()) {
//            pari aa = jono.poll();
//            visited[aa.x] = true;
//            if (aa.y == d[aa.x]) {
//                monta[aa.x] += monta[aa.z];
//
//            }
//            for (pari pp : arraylist[aa.x]) {
//                if (!visited[pp.x]) {
//                    jono.add(new pari(pp.x, d[aa.x] + pp.y, aa.x));
//                    if (d[pp.x] >= pp.y + d[aa.x]) {
//                        d[pp.x] = pp.y + d[aa.x];
//                    }
//
//                }
//
//            }
//
//        }
//
//        io.print(monta[n] * 2 * d[n]);
//
//        io.close(); // TÄYTYY KUTSUA LOPUKSI, muuten tuloste voi jäädä kirjoittamatta
//
//    }
//
//}
//
//class pari implements Comparable<pari> {
//
//    int x;
//    int y;
//    int z;
//
//    public pari(int x, int y, int z) {
//        this.x = x;
//        this.y = y;
//        this.z = z;
//    }
//
//    public int getX() {
//        return x;
//    }
//
//    public void setX(int x) {
//        this.x = x;
//    }
//
//    public int getY() {
//        return y;
//    }
//
//    public void setY(int y) {
//        this.y = y;
//    }
//
//    @Override
//    public int compareTo(pari o) {
//        return -o.y + this.y;
//    }
//
//}

Test details

Test 1

Verdict: ACCEPTED

input
`44 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 2

Verdict: ACCEPTED

input
`506 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 3

Verdict: ACCEPTED

input
`349 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 4

Verdict: ACCEPTED

input
`555 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 5

Verdict: ACCEPTED

input
`210 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 6

Verdict: ACCEPTED

input
`757 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 7

Verdict: ACCEPTED

input
`503 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 8

Verdict: ACCEPTED

input
`419 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 9

Verdict: ACCEPTED

input
`19 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 10

Verdict: ACCEPTED

input
`515 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 11

Verdict: ACCEPTED

input
`718 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 12

Verdict: ACCEPTED

input
`204 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 13

Verdict: ACCEPTED

input
`330 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 14

Verdict: ACCEPTED

input
`862 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 15

Verdict: ACCEPTED

input
`982 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 16

Verdict: ACCEPTED

input
`494 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 17

Verdict: ACCEPTED

input
`4 413658328434492816 42131811934...` view save

correct output
`impossible` view save

user output
`impossible` view save

Test 18

Verdict: ACCEPTED

input
`967 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 19

Verdict: ACCEPTED

input
`838 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 20

Verdict: ACCEPTED

input
`449 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 21

Verdict: ACCEPTED

input
`458 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 22

Verdict: ACCEPTED

input
`635 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 23

Verdict: ACCEPTED

input
`911 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 24

Verdict: ACCEPTED

input
`156 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 25

Verdict: ACCEPTED

input
`295 413658328434492816 42131811934...` view save

correct output
`possible` view save

user output
`possible` view save

Test 26

Verdict: ACCEPTED

input
`88 1 1 2 3 5 8 13 21 34 55 89 144...` view save

correct output
`impossible` view save

user output
`impossible` view save

Test 27

Verdict: ACCEPTED

input
`88 21 10610209857723 1836311903 7...` view save

correct output
`impossible` view save

user output
`impossible` view save

Test 28

Verdict: ACCEPTED

input
`4 688138922692403404 53826514650...` view save

correct output
`impossible` view save

user output
`impossible` view save

Test 29

Verdict: ACCEPTED

input
`6 1051054321739242054 6730047734...` view save

correct output
`impossible` view save

user output
`impossible` view save

Test 30

Verdict: ACCEPTED

input
`8 3450451668468094 1119558431635...` view save

correct output
`impossible` view save

user output
`impossible` view save

Test 31

Verdict: ACCEPTED

input
`10 43884608503565000 302405275242...` view save

correct output
`impossible` view save

user output
`impossible` view save

Test 32

Verdict: ACCEPTED

input
`12 385129830092889 35573055922474...` view save

correct output
`impossible` view save

user output
`impossible` view save

Test 33

Verdict: ACCEPTED

input
`14 3525644022645 589629197579404 ...` view save

correct output
`impossible` view save

user output
`impossible` view save

Test 34

Verdict: ACCEPTED

input
`16 17995284407142 114231612799405...` view save

correct output
`impossible` view save

user output
`impossible` view save

Test 35

Verdict: ACCEPTED

input
`18 6170861631849362 2060967377839...` view save

correct output
`impossible` view save

user output
`impossible` view save

Test 36

Verdict: ACCEPTED

input
`61 1 4398046511104 8388608 687194...` view save

correct output
`impossible` view save

user output
`impossible` view save

Test 37

Verdict: ACCEPTED

input
`89 1 1 2 3 5 8 13 21 34 55 89 144...` view save

correct output
`possible` view save

user output
`possible` view save

Test 38

Verdict: ACCEPTED

input
`20000 1 1 2 3 5 8 13 21 34 55 89 144...` view save

correct output
`possible` view save

user output
`possible` view save

Test 39

Verdict: ACCEPTED

input
`200 1 1125899906842624 1 109951162...` view save

correct output
`possible` view save

user output
`possible` view save

KILO 2017 4/5

Sticky Situation

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Tasks

Submissions (TEAM-Patonki)