CSES - Datatähti 2017 alku

CSES - Datatähti 2017 alku - Results

Submission details
Task:	Kolikot
Sender:	planckcons
Submission time:	2016-10-08 12:41:02 +0300
Language:	Java
Status:	READY
Result:	22

Feedback
group	verdict	score
#1	ACCEPTED	22
#2	TIME LIMIT EXCEEDED	0
#3	RUNTIME ERROR	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.14 s	1	details
#2	ACCEPTED	0.15 s	1	details
#3	ACCEPTED	0.14 s	1	details
#4	ACCEPTED	0.13 s	1	details
#5	ACCEPTED	0.17 s	1	details
#6	ACCEPTED	0.18 s	2	details
#7	ACCEPTED	0.17 s	2	details
#8	ACCEPTED	0.17 s	2	details
#9	ACCEPTED	0.17 s	2	details
#10	TIME LIMIT EXCEEDED	--	2	details
#11	RUNTIME ERROR	1.23 s	3	details
#12	ACCEPTED	0.53 s	3	details
#13	ACCEPTED	0.60 s	3	details
#14	RUNTIME ERROR	1.11 s	3	details
#15	RUNTIME ERROR	1.10 s	3	details
#16	RUNTIME ERROR	1.10 s	3	details

Code

import java.util.Scanner;

public class Kolikot {
    
    public static void main(String[] args) 
    {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] arr = new int[n];
        
        for(int i = 0; i < n; i++)
        {
            arr[i] = scan.nextInt();
        }

//        int[] arr = {1, 2, 3, 9};
//        int n = arr.length;
        int k = 1;
	boolean swch = true;
        while(isSubsetSum1(arr, n, k))
        {
            if(swch)
            {
                k += n;
                swch = false;
            }
            else
            {
                k -= n;
                k++;
                swch = true;
            }
        }
        System.out.print(k);
    }
    
    static boolean isSubsetSum1(int arr[], int n, int sum) {

        boolean[][] subset = new boolean[sum + 1][n + 1];
        int i, j;

        for (i = 0; i <= n; i++) {
            subset[0][i] = true;
        }

        for (i = 1; i <= sum; i++) {
            subset[i][0] = false;
        }

        for (i = 1; i <= sum; i++) {
            for (j = 1; j <= n; j++) {
                subset[i][j] = subset[i][j - 1];

                if (i >= arr[j - 1]) {
                    subset[i][j] = subset[i][j] || subset[i - arr[j - 1]][j - 1];
                }
            }
        }
        return subset[sum][n];
    } 
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`10 5 3 1 4 5 1 3 2 2 3` view save

correct output
`30` view save

user output
`30` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`10 3 5 5 4 5 4 5 5 5 3` view save

correct output
`1` view save

user output
`1` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`10 10 9 2 8 7 10 7 1 5 2` view save

correct output
`62` view save

user output
`62` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`10 7 4 6 3 9 7 4 4 7 7` view save

correct output
`1` view save

user output
`1` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`10 8 2 1 7 9 7 5 2 4 5` view save

correct output
`51` view save

user output
`51` view save

Test 6

Group: 2

Verdict: ACCEPTED

input
`100 3 3 1 4 2 1 2 1 3 1 2 5 1 5 1 ...` view save

correct output
`269` view save

user output
`269` view save

Test 7

Group: 2

Verdict: ACCEPTED

input
`100 3 3 2 3 4 5 4 4 4 4 2 2 4 4 4 ...` view save

correct output
`1` view save

user output
`1` view save

Test 8

Group: 2

Verdict: ACCEPTED

input
`100 678 999 374 759 437 390 832 54...` view save

correct output
`1` view save

user output
`1` view save

Test 9

Group: 2

Verdict: ACCEPTED

input
`100 862 537 633 807 666 248 237 5 ...` view save

correct output
`30` view save

user output
`30` view save

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`100 874 302 384 920 76 28 762 163 ...` view save

correct output
`41765` view save

user output
(empty)

Test 11

Group: 3

Verdict: RUNTIME ERROR

input
`100000 4 2 5 3 2 3 5 2 2 2 3 4 3 3 2 ...` view save

correct output
`299640` view save

user output
(empty)

Error:

Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
	at Kolikot.isSubsetSum1(Kolikot.java:39)
	at Kolikot.main(Kolikot.java:20)

Test 12

Group: 3

Verdict: ACCEPTED

input
`100000 2 5 5 5 5 2 4 4 3 2 3 2 5 5 3 ...` view save

correct output
`1` view save

user output
`1` view save

Test 13

Group: 3

Verdict: ACCEPTED

input
`100000 98146842 766872135 84108268 28...` view save

correct output
`1` view save

user output
`1` view save

Test 14

Group: 3

Verdict: RUNTIME ERROR

input
`100000 932032495 1 849176169 78948957...` view save

correct output
`29970` view save

user output
(empty)

Error:

Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
	at Kolikot.isSubsetSum1(Kolikot.java:39)
	at Kolikot.main(Kolikot.java:20)

Test 15

Group: 3

Verdict: RUNTIME ERROR

input
`100000 35894853 796619259 699878597 4...` view save

correct output
`44965249639582` view save

user output
(empty)

Error:

Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
	at Kolikot.isSubsetSum1(Kolikot.java:39)
	at Kolikot.main(Kolikot.java:20)

Test 16

Group: 3

Verdict: RUNTIME ERROR

input
`100000 930494676 960662779 904422858 ...` view save

correct output
`800020001` view save

user output
(empty)

Error:

Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
	at Kolikot.isSubsetSum1(Kolikot.java:39)
	at Kolikot.main(Kolikot.java:20)

Datatähti 2017 alku

Kolikot

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

Tasks

Submissions (planckcons)