結果

問題 No.1816 MUL-DIV Game
ユーザー shojin_proshojin_pro
提出日時 2022-01-21 21:48:14
言語 Java21
(openjdk 21)
結果
AC  
実行時間 257 ms / 2,000 ms
コード長 3,522 bytes
コンパイル時間 2,086 ms
コンパイル使用メモリ 78,880 KB
実行使用メモリ 47,680 KB
最終ジャッジ日時 2024-05-04 12:32:15
合計ジャッジ時間 7,537 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
37,372 KB
testcase_01 AC 49 ms
37,404 KB
testcase_02 AC 50 ms
37,488 KB
testcase_03 AC 50 ms
37,328 KB
testcase_04 AC 49 ms
37,448 KB
testcase_05 AC 49 ms
37,272 KB
testcase_06 AC 48 ms
36,964 KB
testcase_07 AC 48 ms
37,580 KB
testcase_08 AC 48 ms
36,972 KB
testcase_09 AC 117 ms
40,124 KB
testcase_10 AC 209 ms
45,188 KB
testcase_11 AC 194 ms
45,132 KB
testcase_12 AC 160 ms
43,600 KB
testcase_13 AC 234 ms
45,660 KB
testcase_14 AC 175 ms
43,916 KB
testcase_15 AC 207 ms
44,160 KB
testcase_16 AC 124 ms
41,192 KB
testcase_17 AC 229 ms
46,792 KB
testcase_18 AC 236 ms
45,964 KB
testcase_19 AC 178 ms
45,148 KB
testcase_20 AC 240 ms
46,880 KB
testcase_21 AC 161 ms
42,888 KB
testcase_22 AC 152 ms
43,356 KB
testcase_23 AC 48 ms
37,472 KB
testcase_24 AC 48 ms
37,548 KB
testcase_25 AC 235 ms
47,640 KB
testcase_26 AC 256 ms
47,428 KB
testcase_27 AC 257 ms
47,600 KB
testcase_28 AC 255 ms
47,412 KB
testcase_29 AC 252 ms
47,680 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    static long mod = (long) 1e9 + 7;

    public static void main(String[] args) throws Exception {
        solve();
        pw.flush();
    }

    public static void solve() {
        int n = sc.nextInt();
        long[] a = sc.nextLongArray(n);
        GeekInteger.save_sort(a);
        if(n == 1){
            pw.println(a[0]);
        }else if(n == 2){
            pw.println(a[0] * a[1]);
        }else{
            pw.println(n % 2 == 0 ? Math.min(a[0]*a[1],a[2]) : 1);
        }
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
0