結果
問題 | No.2236 Lights Out On Simple Graph |
ユーザー | hiromi_ayase |
提出日時 | 2023-03-03 23:29:24 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,774 bytes |
コンパイル時間 | 3,803 ms |
コンパイル使用メモリ | 89,876 KB |
実行使用メモリ | 226,132 KB |
最終ジャッジ日時 | 2023-10-18 03:43:05 |
合計ジャッジ時間 | 48,256 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 81 ms
54,404 KB |
testcase_01 | AC | 80 ms
54,408 KB |
testcase_02 | AC | 80 ms
54,448 KB |
testcase_03 | AC | 1,171 ms
150,672 KB |
testcase_04 | WA | - |
testcase_05 | AC | 82 ms
54,392 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 80 ms
53,232 KB |
testcase_09 | AC | 80 ms
54,452 KB |
testcase_10 | AC | 638 ms
83,304 KB |
testcase_11 | AC | 207 ms
61,348 KB |
testcase_12 | AC | 737 ms
98,884 KB |
testcase_13 | AC | 196 ms
58,628 KB |
testcase_14 | AC | 1,178 ms
145,192 KB |
testcase_15 | AC | 167 ms
60,412 KB |
testcase_16 | AC | 204 ms
62,920 KB |
testcase_17 | AC | 300 ms
67,036 KB |
testcase_18 | AC | 98 ms
55,148 KB |
testcase_19 | AC | 282 ms
67,380 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 912 ms
133,540 KB |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | AC | 1,246 ms
140,648 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | AC | 1,145 ms
142,096 KB |
testcase_36 | AC | 588 ms
86,812 KB |
testcase_37 | AC | 1,156 ms
183,572 KB |
testcase_38 | AC | 572 ms
87,940 KB |
testcase_39 | AC | 466 ms
82,124 KB |
testcase_40 | AC | 864 ms
91,008 KB |
testcase_41 | AC | 304 ms
66,716 KB |
testcase_42 | AC | 580 ms
109,808 KB |
testcase_43 | AC | 161 ms
56,480 KB |
testcase_44 | AC | 1,066 ms
116,768 KB |
testcase_45 | WA | - |
testcase_46 | AC | 938 ms
141,108 KB |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | AC | 1,700 ms
226,132 KB |
testcase_50 | AC | 160 ms
58,112 KB |
testcase_51 | WA | - |
testcase_52 | AC | 155 ms
58,056 KB |
testcase_53 | AC | 83 ms
54,400 KB |
testcase_54 | AC | 846 ms
120,000 KB |
testcase_55 | AC | 505 ms
86,632 KB |
testcase_56 | AC | 587 ms
86,872 KB |
testcase_57 | AC | 716 ms
103,388 KB |
testcase_58 | AC | 600 ms
80,228 KB |
testcase_59 | AC | 537 ms
83,272 KB |
ソースコード
import java.util.*; @SuppressWarnings("unused") public class Main { private static void solve() { int n = ni(); int m = ni(); int[] a = new int[m]; int[] b = new int[m]; for (int i = 0; i < m; i++) { a[i] = ni() - 1; b[i] = ni() - 1; } int[] c = na(n); // long[] dp = func(a, b, c, 0, m); // int ret = Integer.MAX_VALUE / 2; // for (int i = 0; i < dp.length; i ++) { // if (dp[i] == 0) { // ret = Math.min(ret, Integer.bitCount(i)); // } // } // System.out.println(ret == Integer.MAX_VALUE / 2 ? -1 : ret); long[] dp1 = func(a, b, c, 0, m / 2); long[] dp2 = func(a, b, c, m / 2, m); Map<Long, Integer> map = new HashMap<>(); for (int i = 0; i < dp2.length; i ++) { long state = dp2[i]; int cnt = Integer.bitCount(i); int min = map.getOrDefault(state, Integer.MAX_VALUE / 2); map.put(state, Math.min(min, cnt)); } int m1 = m / 2; int ret = Integer.MAX_VALUE; long init = 0; for (int i = 0; i < n; i++) { if (c[i] == 1) { init |= 1L << i; } } for (int i = 0; i < 1 << m1; i ++) { long k = dp1[i] ^ init; ret = Math.min(ret, Integer.bitCount(i) + map.getOrDefault(k, Integer.MAX_VALUE / 2)); } System.out.println(ret >= Integer.MAX_VALUE / 2 ? -1 : ret); } private static long[] func(int[] a, int[] b, int[] c, int from, int to) { int m = to - from; long[] dp = new long[1 << m]; long init = 0; int n = c.length; for (int i = 0; i < n; i++) { if (c[i] == 1) { init |= 1L << i; } } for (int i = 0; i < (1 << m); i++) { long v = init; for (int j = 0; j < m; j++) { if ((i >> j & 1) == 1) { v ^= 1 << a[j + from]; v ^= 1 << b[j + from]; } } dp[i] = v; } return dp; } public static int[][] packU(int n, int[] from, int[] to) { return packU(n, from, to, from.length); } public static int[][] packU(int n, int[] from, int[] to, int sup) { int[][] g = new int[n][]; int[] p = new int[n]; for (int i = 0; i < sup; i++) p[from[i]]++; for (int i = 0; i < sup; i++) p[to[i]]++; for (int i = 0; i < n; i++) g[i] = new int[p[i]]; for (int i = 0; i < sup; i++) { g[from[i]][--p[from[i]]] = to[i]; g[to[i]][--p[to[i]]] = from[i]; } return g; } 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)); } }