Submission #1976990

Source Code Expand

import java.util.Scanner;

public class Main {
    private static final int A_MAX_INT = 100000000;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int k = sc.nextInt();
        int[] a = new int[k];

        int aMax = 0;
        for (int i = 0; i < k; i++) {
            a[i] = sc.nextInt();
            if (aMax < a[i]) {
                aMax = a[i];
            }
        }

        int n = aMax;
        int nMin = A_MAX_INT;
        int nMax = -1;
        for (int i = n; i < A_MAX_INT; i++) {
            int nNow = i;
            boolean success = false;
            boolean failed = false;
            for (int j = 0; j < k; j++) {
                int g = nNow / a[j]; // できたグループ数
                nNow = g * a[j];
                // 失敗
                if (g <= 0) {
                    break;
                }
                // 成功 jがk-1のときにgが1の場合
                if (j == k - 1 && g == 1) {
                    success = true;
                }
            }
            if (success) {
                if (i < nMin) {
                    nMin = i;
                }
                if (nMax < i) {
                    nMax = i;
                }
            }
            if (failed) {
                break;
            }
        }
        if (nMin == A_MAX_INT) {
            System.out.println("-1");
        } else {
            System.out.println(nMin + " " + nMax);
        }
    }
}

Submission Info

Submission Time
Task B - Ice Rink Game
User ee07030
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 1549 Byte
Status WA
Exec Time 2109 ms
Memory 51088 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
TLE × 3
AC × 9
WA × 13
TLE × 11
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt
Case Name Status Exec Time Memory
sample_01.txt TLE 2108 ms 19412 KiB
sample_02.txt TLE 2108 ms 19796 KiB
sample_03.txt TLE 2108 ms 20052 KiB
subtask_1_01.txt AC 704 ms 20820 KiB
subtask_1_02.txt WA 749 ms 20692 KiB
subtask_1_03.txt AC 91 ms 18892 KiB
subtask_1_04.txt TLE 2108 ms 23764 KiB
subtask_1_05.txt TLE 2108 ms 18644 KiB
subtask_1_06.txt TLE 2109 ms 46168 KiB
subtask_1_07.txt AC 437 ms 48292 KiB
subtask_1_08.txt TLE 2108 ms 16980 KiB
subtask_1_09.txt WA 109 ms 20948 KiB
subtask_1_10.txt WA 163 ms 26056 KiB
subtask_1_11.txt WA 449 ms 46344 KiB
subtask_1_12.txt WA 459 ms 46060 KiB
subtask_1_13.txt TLE 2109 ms 48708 KiB
subtask_1_14.txt AC 459 ms 45236 KiB
subtask_1_15.txt AC 441 ms 45732 KiB
subtask_1_16.txt WA 186 ms 31584 KiB
subtask_1_17.txt WA 408 ms 48864 KiB
subtask_1_18.txt WA 402 ms 49132 KiB
subtask_1_19.txt AC 410 ms 49168 KiB
subtask_1_20.txt AC 418 ms 51088 KiB
subtask_1_21.txt AC 419 ms 48144 KiB
subtask_1_22.txt AC 412 ms 47720 KiB
subtask_1_23.txt WA 92 ms 20816 KiB
subtask_1_24.txt WA 128 ms 22484 KiB
subtask_1_25.txt WA 455 ms 47972 KiB
subtask_1_26.txt WA 125 ms 20436 KiB
subtask_1_27.txt WA 449 ms 43944 KiB