結果
問題 | No.2236 Lights Out On Simple Graph |
ユーザー | 👑 hos.lyric |
提出日時 | 2023-03-03 21:45:02 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 635 ms / 4,000 ms |
コード長 | 2,476 bytes |
コンパイル時間 | 1,744 ms |
コンパイル使用メモリ | 114,912 KB |
実行使用メモリ | 39,224 KB |
最終ジャッジ日時 | 2023-09-04 19:56:17 |
合計ジャッジ時間 | 19,155 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 394 ms
36,372 KB |
testcase_04 | AC | 241 ms
29,764 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 352 ms
39,188 KB |
testcase_07 | AC | 400 ms
37,692 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 1 ms
4,376 KB |
testcase_10 | AC | 98 ms
12,720 KB |
testcase_11 | AC | 72 ms
8,260 KB |
testcase_12 | AC | 121 ms
16,376 KB |
testcase_13 | AC | 13 ms
5,412 KB |
testcase_14 | AC | 259 ms
30,544 KB |
testcase_15 | AC | 8 ms
4,384 KB |
testcase_16 | AC | 14 ms
4,884 KB |
testcase_17 | AC | 53 ms
7,716 KB |
testcase_18 | AC | 2 ms
4,376 KB |
testcase_19 | AC | 29 ms
5,628 KB |
testcase_20 | AC | 198 ms
19,840 KB |
testcase_21 | AC | 30 ms
6,264 KB |
testcase_22 | AC | 394 ms
37,956 KB |
testcase_23 | AC | 429 ms
36,572 KB |
testcase_24 | AC | 286 ms
28,552 KB |
testcase_25 | AC | 58 ms
10,564 KB |
testcase_26 | AC | 382 ms
36,920 KB |
testcase_27 | AC | 203 ms
20,532 KB |
testcase_28 | AC | 276 ms
29,692 KB |
testcase_29 | AC | 28 ms
5,940 KB |
testcase_30 | AC | 395 ms
39,212 KB |
testcase_31 | AC | 406 ms
37,672 KB |
testcase_32 | AC | 385 ms
38,200 KB |
testcase_33 | AC | 395 ms
36,116 KB |
testcase_34 | AC | 387 ms
36,100 KB |
testcase_35 | AC | 433 ms
35,784 KB |
testcase_36 | AC | 559 ms
36,360 KB |
testcase_37 | AC | 411 ms
36,872 KB |
testcase_38 | AC | 635 ms
37,100 KB |
testcase_39 | AC | 589 ms
39,224 KB |
testcase_40 | AC | 243 ms
19,224 KB |
testcase_41 | AC | 29 ms
5,596 KB |
testcase_42 | AC | 127 ms
16,056 KB |
testcase_43 | AC | 12 ms
4,880 KB |
testcase_44 | AC | 444 ms
36,360 KB |
testcase_45 | AC | 410 ms
35,788 KB |
testcase_46 | AC | 375 ms
35,584 KB |
testcase_47 | AC | 416 ms
37,896 KB |
testcase_48 | AC | 410 ms
37,952 KB |
testcase_49 | AC | 396 ms
38,724 KB |
testcase_50 | AC | 11 ms
4,380 KB |
testcase_51 | AC | 98 ms
12,400 KB |
testcase_52 | AC | 9 ms
4,380 KB |
testcase_53 | AC | 1 ms
4,380 KB |
testcase_54 | AC | 269 ms
29,532 KB |
testcase_55 | AC | 522 ms
37,920 KB |
testcase_56 | AC | 446 ms
36,316 KB |
testcase_57 | AC | 614 ms
38,724 KB |
testcase_58 | AC | 496 ms
35,604 KB |
testcase_59 | AC | 517 ms
36,100 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const N = readInt; const M = readInt; auto A = new int[M]; auto B = new int[M]; foreach (i; 0 .. M) { A[i] = readInt - 1; B[i] = readInt - 1; } auto C = new int[N]; foreach (u; 0 .. N) { C[u] = readInt; } long ini; foreach (u; 0 .. N) if (C[u]) { ini |= 1L << u; } const half = M / 2; alias Entry = Tuple!(long, "on", int, "cost"); auto fs = new Entry[1 << half]; foreach (i; 0 .. half) { foreach (h; 0 .. 1 << i) { fs[h | 1 << i].on = fs[h].on ^ (1L << A[i]) ^ (1L << B[i]); fs[h | 1 << i].cost = fs[h].cost + 1; } } fs.sort; auto gs = new Entry[1 << (M - half)]; foreach (i; 0 .. M - half) { foreach (h; 0 .. 1 << i) { gs[h | 1 << i].on = gs[h].on ^ (1L << A[half + i]) ^ (1L << B[half + i]); gs[h | 1 << i].cost = gs[h].cost + 1; } } int ans = M + 1; foreach (ref g; gs) { const tar = ini ^ g.on; const pos = fs.lowerBound(Entry(tar, -1)); if (pos < fs.length && fs[pos].on == tar) { chmin(ans, fs[pos].cost + g.cost); } } writeln((ans <= M) ? ans : -1); } } catch (EOFException e) { } }