結果
問題 | No.803 Very Limited Xor Subset |
ユーザー | 👑 rin204 |
提出日時 | 2023-11-23 18:15:18 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 55 ms / 2,000 ms |
コード長 | 1,931 bytes |
コンパイル時間 | 466 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 66,368 KB |
最終ジャッジ日時 | 2023-11-23 18:15:23 |
合計ジャッジ時間 | 4,984 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
53,460 KB |
testcase_01 | AC | 37 ms
53,460 KB |
testcase_02 | AC | 36 ms
53,460 KB |
testcase_03 | AC | 38 ms
53,460 KB |
testcase_04 | AC | 37 ms
53,460 KB |
testcase_05 | AC | 38 ms
53,460 KB |
testcase_06 | AC | 38 ms
53,460 KB |
testcase_07 | AC | 37 ms
53,460 KB |
testcase_08 | AC | 37 ms
53,460 KB |
testcase_09 | AC | 37 ms
53,460 KB |
testcase_10 | AC | 38 ms
53,460 KB |
testcase_11 | AC | 38 ms
53,460 KB |
testcase_12 | AC | 38 ms
53,460 KB |
testcase_13 | AC | 38 ms
53,460 KB |
testcase_14 | AC | 54 ms
66,352 KB |
testcase_15 | AC | 52 ms
64,156 KB |
testcase_16 | AC | 54 ms
66,240 KB |
testcase_17 | AC | 53 ms
66,368 KB |
testcase_18 | AC | 52 ms
64,168 KB |
testcase_19 | AC | 52 ms
64,168 KB |
testcase_20 | AC | 54 ms
66,360 KB |
testcase_21 | AC | 53 ms
66,356 KB |
testcase_22 | AC | 52 ms
64,164 KB |
testcase_23 | AC | 43 ms
55,600 KB |
testcase_24 | AC | 54 ms
66,100 KB |
testcase_25 | AC | 53 ms
63,772 KB |
testcase_26 | AC | 52 ms
63,768 KB |
testcase_27 | AC | 55 ms
66,356 KB |
testcase_28 | AC | 55 ms
66,356 KB |
testcase_29 | AC | 54 ms
66,224 KB |
testcase_30 | AC | 55 ms
66,232 KB |
testcase_31 | AC | 51 ms
63,768 KB |
testcase_32 | AC | 53 ms
65,836 KB |
testcase_33 | AC | 53 ms
65,960 KB |
testcase_34 | AC | 41 ms
58,956 KB |
testcase_35 | AC | 53 ms
63,772 KB |
testcase_36 | AC | 46 ms
61,668 KB |
testcase_37 | AC | 49 ms
63,908 KB |
testcase_38 | AC | 46 ms
61,404 KB |
testcase_39 | AC | 46 ms
61,404 KB |
testcase_40 | AC | 54 ms
65,976 KB |
testcase_41 | AC | 43 ms
55,600 KB |
testcase_42 | AC | 53 ms
66,100 KB |
testcase_43 | AC | 43 ms
55,600 KB |
testcase_44 | AC | 36 ms
53,460 KB |
testcase_45 | AC | 37 ms
53,460 KB |
testcase_46 | AC | 41 ms
58,956 KB |
ソースコード
class UnionFind: def __init__(self, n): self.n = n self.par = [-1] * n self.group_ = n def find(self, x): if self.par[x] < 0: return x lst = [] while self.par[x] >= 0: lst.append(x) x = self.par[x] for y in lst: self.par[y] = x return x def unite(self, x, y): x = self.find(x) y = self.find(y) if x == y: return False if self.par[x] > self.par[y]: x, y = y, x self.par[x] += self.par[y] self.par[y] = x self.group_ -= 1 return True def size(self, x): return -self.par[self.find(x)] def same(self, x, y): return self.find(x) == self.find(y) @property def group(self): return self.group_ n, m, x = map(int, input().split()) A = list(map(int, input().split())) T = [0] * m L = [0] * m R = [0] * m n += 1 UF = UnionFind(2 * n) for i in range(m): T[i], L[i], R[i] = map(int, input().split()) L[i] -= 1 if T[i] == 0: UF.unite(L[i], R[i]) UF.unite(L[i] + n, R[i] + n) else: UF.unite(L[i], R[i] + n) UF.unite(L[i] + n, R[i]) for i in range(n): if UF.same(i, i + n): print(0) exit() pari = [False] * n for i in range(n): pari[i] = UF.find(i) < n for i in range(n - 1): if pari[i] != pari[i + 1]: x ^= A[i] for i in range(n): UF.unite(i, i + n) X = {} for i in range(n): if UF.same(i, 0): continue r = UF.find(i) if i != 0: X[r] = X.get(r, 0) ^ A[i - 1] if i != n - 1: X[r] = X.get(r, 0) ^ A[i] bases = [] z = 0 for v in X.values(): for b in bases: v = min(v, v ^ b) if v == 0: z += 1 else: bases.append(v) for b in bases: x = min(x, x ^ b) if x == 0: print(pow(2, z, 10**9 + 7)) else: print(0)