結果
問題 | No.1421 国勢調査 (Hard) |
ユーザー |
👑 |
提出日時 | 2021-03-05 21:51:56 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 190 ms / 2,000 ms |
コード長 | 3,205 bytes |
コンパイル時間 | 899 ms |
コンパイル使用メモリ | 122,812 KB |
実行使用メモリ | 14,280 KB |
最終ジャッジ日時 | 2024-06-22 10:59:27 |
合計ジャッジ時間 | 3,599 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 30 |
ソースコード
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; }real readReal() { return readToken.to!real; }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)); }enum E = 30;void main() {try {for (; ; ) {const N = readInt();const M = readInt();auto A = new int[M];auto B = new int[][M];auto Y = new int[M];foreach (i; 0 .. M) {A[i] = readInt();B[i] = new int[A[i]];foreach (a; 0 .. A[i]) {B[i][a] = readInt() - 1;}Y[i] = readInt();}auto ans = new int[N];foreach (e; 0 .. E) {auto c = new long[M];foreach (i; 0 .. M) {foreach (j; B[i]) {c[i] |= 1L << j;}c[i] |= ((Y[i] >> e) & 1L) << N;}int[] hs;int r;foreach (h; 0 .. N) {foreach (i; r .. M) {if ((c[i] >> h) & 1) {swap(c[r], c[i]);break;}}if (r < M && ((c[r] >> h) & 1)) {foreach (i; r + 1 .. M) {if ((c[i] >> h) & 1) {c[i] ^= c[r];}}hs ~= h;++r;}}bool ok = true;foreach (i; r .. M) {ok = ok && (!c[i]);}if (ok) {auto xs = new int[N];foreach_reverse (i; 0 .. r) {xs[hs[i]] = (c[i] >> N) & 1;foreach (j; hs[i] + 1 .. N) {if ((c[i] >> j) & 1) {xs[hs[i]] ^= xs[j];}}}foreach (j; 0 .. N) {ans[j] |= xs[j] << e;}} else {ans = null;break;}}if (ans) {foreach (j; 0 .. N) {writeln(ans[j]);}debug {foreach (i; 0 .. M) {long sum;foreach (j; B[i]) {sum ^= ans[j];}if (Y[i] != sum) {assert(false);}}}} else {writeln(-1);}}} catch (EOFException e) {}}