結果
問題 | No.1816 MUL-DIV Game |
ユーザー | shojin_pro |
提出日時 | 2022-01-21 21:48:14 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 275 ms / 2,000 ms |
コード長 | 3,522 bytes |
コンパイル時間 | 4,316 ms |
コンパイル使用メモリ | 75,024 KB |
実行使用メモリ | 58,828 KB |
最終ジャッジ日時 | 2023-08-17 05:35:36 |
合計ジャッジ時間 | 8,517 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
49,724 KB |
testcase_01 | AC | 45 ms
49,908 KB |
testcase_02 | AC | 45 ms
49,792 KB |
testcase_03 | AC | 44 ms
49,844 KB |
testcase_04 | AC | 44 ms
49,848 KB |
testcase_05 | AC | 45 ms
50,236 KB |
testcase_06 | AC | 46 ms
49,740 KB |
testcase_07 | AC | 46 ms
49,920 KB |
testcase_08 | AC | 44 ms
49,796 KB |
testcase_09 | AC | 120 ms
52,792 KB |
testcase_10 | AC | 215 ms
56,636 KB |
testcase_11 | AC | 194 ms
56,616 KB |
testcase_12 | AC | 177 ms
55,852 KB |
testcase_13 | AC | 244 ms
56,448 KB |
testcase_14 | AC | 189 ms
55,840 KB |
testcase_15 | AC | 217 ms
56,488 KB |
testcase_16 | AC | 135 ms
55,280 KB |
testcase_17 | AC | 250 ms
58,636 KB |
testcase_18 | AC | 266 ms
56,612 KB |
testcase_19 | AC | 190 ms
56,288 KB |
testcase_20 | AC | 249 ms
58,804 KB |
testcase_21 | AC | 171 ms
55,840 KB |
testcase_22 | AC | 152 ms
55,816 KB |
testcase_23 | AC | 43 ms
49,844 KB |
testcase_24 | AC | 44 ms
49,848 KB |
testcase_25 | AC | 275 ms
58,708 KB |
testcase_26 | AC | 271 ms
58,628 KB |
testcase_27 | AC | 269 ms
58,632 KB |
testcase_28 | AC | 270 ms
58,828 KB |
testcase_29 | AC | 273 ms
58,712 KB |
ソースコード
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; } }