結果
問題 | No.983 Convolution |
ユーザー | hiromi_ayase |
提出日時 | 2020-02-11 15:19:07 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,528 ms / 2,000 ms |
コード長 | 4,064 bytes |
コンパイル時間 | 2,587 ms |
コンパイル使用メモリ | 82,836 KB |
実行使用メモリ | 107,912 KB |
最終ジャッジ日時 | 2024-04-08 15:21:45 |
合計ジャッジ時間 | 28,173 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 429 ms
59,176 KB |
testcase_01 | AC | 461 ms
61,728 KB |
testcase_02 | AC | 453 ms
61,728 KB |
testcase_03 | AC | 526 ms
78,176 KB |
testcase_04 | AC | 591 ms
83,708 KB |
testcase_05 | AC | 558 ms
72,388 KB |
testcase_06 | AC | 637 ms
81,056 KB |
testcase_07 | AC | 623 ms
75,220 KB |
testcase_08 | AC | 490 ms
66,224 KB |
testcase_09 | AC | 421 ms
65,204 KB |
testcase_10 | AC | 458 ms
65,956 KB |
testcase_11 | AC | 519 ms
68,248 KB |
testcase_12 | AC | 570 ms
69,860 KB |
testcase_13 | AC | 511 ms
69,756 KB |
testcase_14 | AC | 550 ms
69,096 KB |
testcase_15 | AC | 620 ms
70,804 KB |
testcase_16 | AC | 532 ms
68,204 KB |
testcase_17 | AC | 661 ms
72,256 KB |
testcase_18 | AC | 478 ms
65,840 KB |
testcase_19 | AC | 655 ms
72,652 KB |
testcase_20 | AC | 667 ms
75,324 KB |
testcase_21 | AC | 613 ms
84,380 KB |
testcase_22 | AC | 477 ms
65,720 KB |
testcase_23 | AC | 576 ms
65,260 KB |
testcase_24 | AC | 522 ms
64,540 KB |
testcase_25 | AC | 505 ms
64,280 KB |
testcase_26 | AC | 584 ms
65,168 KB |
testcase_27 | AC | 562 ms
65,236 KB |
testcase_28 | AC | 1,137 ms
90,152 KB |
testcase_29 | AC | 1,528 ms
107,912 KB |
testcase_30 | AC | 1,274 ms
90,564 KB |
testcase_31 | AC | 1,028 ms
79,876 KB |
testcase_32 | AC | 1,280 ms
92,360 KB |
testcase_33 | AC | 412 ms
61,184 KB |
testcase_34 | AC | 434 ms
61,136 KB |
testcase_35 | AC | 428 ms
59,244 KB |
ソースコード
import java.math.BigInteger; public class Main { private static void solve() { int n = ni(); long[] a = nal(n); int m = 20; BigInteger[] b = new BigInteger[1 << m]; for (int i = 0; i < (1 << m); i++) { if (i < n) { b[i] = BigInteger.valueOf(a[i]); } else { b[i] = BigInteger.ZERO; } } for (int j = 0; j < m; j++) { for (int i = 0; i < (1 << m); i++) { if (b[i].compareTo(BigInteger.ZERO) < 0) continue; if (((i >> j) & 1) == 0) { if (b[i ^ (1 << j)].compareTo(BigInteger.ZERO) < 0) { b[i] = BigInteger.valueOf(-1); break; } b[i] = b[i].add(b[i ^ (1 << j)]); } } } for (int i = 0; i < (1 << m); i++) { if (b[i].compareTo(BigInteger.ZERO) < 0) continue; b[i] = b[i].multiply(b[i]); } for (int j = 0; j < m; j++) { for (int i = 0; i < (1 << m); i++) { if (b[i].compareTo(BigInteger.ZERO) < 0) continue; if (((i >> j) & 1) == 0) { if (b[i ^ (1 << j)].compareTo(BigInteger.ZERO) < 0) { b[i] = BigInteger.valueOf(-1); break; } b[i] = b[i].subtract(b[i ^ (1 << j)]); } } } BigInteger ret = BigInteger.valueOf(-1); for (int i = 0; i < n; i++) { if (b[i].compareTo(BigInteger.ZERO) <= 0) continue; if (ret.compareTo(BigInteger.ZERO) < 0) { ret = b[i]; } else { ret = ret.gcd(b[i]); } } System.out.println(ret); } public static long gcd(long a, long b) { while (b > 0) { long c = a; a = b; b = c % b; } return a; } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }