Submission #856092


Source Code Expand

Copy
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
import java.util.stream.IntStream;
import java.util.stream.Stream;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int A = sc.nextInt();
        int[] x = new int[N];
        for (int i = 0; i < N; i++) {
            x[i] = sc.nextInt();
        }
        System.out.println(solve(N, A, x));
    }

    private static long solve(int n, int a, int[] x) {
        int[] y = Arrays.stream(x).map(i -> i - a).toArray();
        return brute(n - 1, 0, y);
    }

    private static long brute(final int i, final int n, final int[] y) {
        if (i < 0) return 0;
        return (n + y[i] == 0 ? 1 : 0) + brute(i - 1, n, y) + brute(i - 1, n + y[i], y);
    }
}

Submission Info

Submission Time
Task C - Tak and Cards
User nes_in_it
Language Java8 (OpenJDK 1.8.0)
Score 200
Code Size 858 Byte
Status TLE
Exec Time 2108 ms
Memory 15308 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 0 / 100
Status
AC × 3
TLE × 1
AC × 12
AC × 12
TLE × 12
Set Name Test Cases
Sample example_01.txt, example_02.txt, example_03.txt, example_04.txt
Subtask1 example_01.txt, example_02.txt, example_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt
All example_01.txt, example_02.txt, example_03.txt, example_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt
Case Name Status Exec Time Memory
example_01.txt AC 415 ms 15180 KB
example_02.txt AC 306 ms 14668 KB
example_03.txt AC 314 ms 14668 KB
example_04.txt TLE 2104 ms 14664 KB
subtask1_01.txt AC 314 ms 14796 KB
subtask1_02.txt AC 322 ms 14800 KB
subtask1_03.txt AC 326 ms 14668 KB
subtask1_04.txt AC 326 ms 15304 KB
subtask1_05.txt AC 330 ms 14668 KB
subtask1_06.txt AC 318 ms 15308 KB
subtask1_07.txt AC 314 ms 15052 KB
subtask1_08.txt AC 310 ms 14664 KB
subtask1_09.txt AC 318 ms 14668 KB
subtask2_01.txt TLE 2107 ms 14536 KB
subtask2_02.txt TLE 2104 ms 14672 KB
subtask2_03.txt TLE 2108 ms 14672 KB
subtask2_04.txt TLE 2108 ms 15056 KB
subtask2_05.txt TLE 2107 ms 14676 KB
subtask2_06.txt TLE 2104 ms 15056 KB
subtask2_07.txt TLE 2104 ms 14672 KB
subtask2_08.txt TLE 2104 ms 14544 KB
subtask2_09.txt TLE 2104 ms 14800 KB
subtask2_10.txt TLE 2107 ms 14536 KB
subtask2_11.txt TLE 2104 ms 14660 KB