結果
問題 | No.1594 Three Classes |
ユーザー | hiromi_ayase |
提出日時 | 2021-07-10 01:35:22 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 131 ms / 2,000 ms |
コード長 | 3,140 bytes |
コンパイル時間 | 4,018 ms |
コンパイル使用メモリ | 78,408 KB |
実行使用メモリ | 54,984 KB |
最終ジャッジ日時 | 2023-08-10 06:58:01 |
合計ジャッジ時間 | 7,063 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 129 ms
53,248 KB |
testcase_01 | AC | 68 ms
50,772 KB |
testcase_02 | AC | 67 ms
50,856 KB |
testcase_03 | AC | 80 ms
52,612 KB |
testcase_04 | AC | 123 ms
53,068 KB |
testcase_05 | AC | 126 ms
52,992 KB |
testcase_06 | AC | 79 ms
52,312 KB |
testcase_07 | AC | 80 ms
52,624 KB |
testcase_08 | AC | 131 ms
52,748 KB |
testcase_09 | AC | 125 ms
54,984 KB |
testcase_10 | AC | 119 ms
53,320 KB |
testcase_11 | AC | 126 ms
53,020 KB |
testcase_12 | AC | 120 ms
52,792 KB |
testcase_13 | AC | 65 ms
51,368 KB |
testcase_14 | AC | 83 ms
52,400 KB |
testcase_15 | AC | 78 ms
52,664 KB |
testcase_16 | AC | 78 ms
52,568 KB |
testcase_17 | AC | 77 ms
52,608 KB |
testcase_18 | AC | 68 ms
50,744 KB |
testcase_19 | AC | 66 ms
50,928 KB |
testcase_20 | AC | 67 ms
50,952 KB |
ソースコード
import java.util.*; @SuppressWarnings("unused") public class Main { private static void solve() { int n = ni(); int[] e = na(n); for (int i = 0; i < (1 << n); i ++) { int pa = 0; for (int j = 0; j < n; j ++) { if ((i >> j & 1) == 0) { pa += e[j]; } } int j = i; while (true) { int pb = 0; int pc = 0; for (int k = 0; k < n; k ++) { if ((i >> k & 1) == 0) continue; if ((j >> k & 1) == 0) { pb += e[k]; } else { pc += e[k]; } } if (pa == pb && pb == pc) { System.out.println("Yes"); return; } if (j == 0) break; j = (j - 1) & i; } } System.out.println("No"); } 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)); } }