結果
問題 | No.803 Very Limited Xor Subset |
ユーザー | maspy |
提出日時 | 2020-04-14 22:22:09 |
言語 | Python3 (3.11.6 + numpy 1.26.0 + scipy 1.11.3) |
結果 |
AC
|
実行時間 | 128 ms / 2,000 ms |
コード長 | 1,539 bytes |
コンパイル時間 | 165 ms |
コンパイル使用メモリ | 10,972 KB |
実行使用メモリ | 30,264 KB |
最終ジャッジ日時 | 2023-07-24 22:33:46 |
合計ジャッジ時間 | 11,169 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 114 ms
29,988 KB |
testcase_01 | AC | 112 ms
29,900 KB |
testcase_02 | AC | 109 ms
29,712 KB |
testcase_03 | AC | 111 ms
30,068 KB |
testcase_04 | AC | 114 ms
29,936 KB |
testcase_05 | AC | 111 ms
29,936 KB |
testcase_06 | AC | 127 ms
30,012 KB |
testcase_07 | AC | 128 ms
30,100 KB |
testcase_08 | AC | 117 ms
30,024 KB |
testcase_09 | AC | 116 ms
30,052 KB |
testcase_10 | AC | 119 ms
30,104 KB |
testcase_11 | AC | 122 ms
30,076 KB |
testcase_12 | AC | 115 ms
30,128 KB |
testcase_13 | AC | 111 ms
29,996 KB |
testcase_14 | AC | 113 ms
30,192 KB |
testcase_15 | AC | 114 ms
30,156 KB |
testcase_16 | AC | 113 ms
30,128 KB |
testcase_17 | AC | 114 ms
30,220 KB |
testcase_18 | AC | 116 ms
30,232 KB |
testcase_19 | AC | 117 ms
30,196 KB |
testcase_20 | AC | 114 ms
30,176 KB |
testcase_21 | AC | 116 ms
30,192 KB |
testcase_22 | AC | 114 ms
30,204 KB |
testcase_23 | AC | 111 ms
29,800 KB |
testcase_24 | AC | 111 ms
30,100 KB |
testcase_25 | AC | 114 ms
30,136 KB |
testcase_26 | AC | 114 ms
30,240 KB |
testcase_27 | AC | 113 ms
30,168 KB |
testcase_28 | AC | 112 ms
30,072 KB |
testcase_29 | AC | 113 ms
30,188 KB |
testcase_30 | AC | 113 ms
30,128 KB |
testcase_31 | AC | 111 ms
30,096 KB |
testcase_32 | AC | 115 ms
30,264 KB |
testcase_33 | AC | 112 ms
30,052 KB |
testcase_34 | AC | 112 ms
30,120 KB |
testcase_35 | AC | 112 ms
30,228 KB |
testcase_36 | AC | 113 ms
30,100 KB |
testcase_37 | AC | 112 ms
30,176 KB |
testcase_38 | AC | 111 ms
29,852 KB |
testcase_39 | AC | 114 ms
29,864 KB |
testcase_40 | AC | 115 ms
30,136 KB |
testcase_41 | AC | 115 ms
29,916 KB |
testcase_42 | AC | 112 ms
30,232 KB |
testcase_43 | AC | 116 ms
29,900 KB |
testcase_44 | AC | 114 ms
29,756 KB |
testcase_45 | AC | 111 ms
29,876 KB |
testcase_46 | AC | 116 ms
30,048 KB |
ソースコード
import sys read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines import numpy as np N, M, X = map(int, readline().split()) A = list(map(int, readline().split())) + [0] A = [0] + [x ^ y for x, y in zip(A, A[1:])] m = map(int, read().split()) graph = [[] for _ in range(N + 1)] for t, x, y in zip(m, m, m): x -= 1 graph[x].append((y, t)) graph[y].append((x, t)) C = [0] * (N + 1) root = [-1] * (N + 1) is_ng = False for v in range(N + 1): if root[v] != -1: continue stack = [v] root[v] = v while stack: v = stack.pop() for w, x in graph[v]: if root[w] == -1: root[w] = root[v] C[w] = C[v] ^ x stack.append(w) continue if C[w] != C[v] ^ x: is_ng = True if is_ng: print(0) exit() for v in range(N + 1): X ^= C[v] * A[v] if v != root[v]: A[root[v]] ^= A[v] def row_transform_over_F2(A, highest=60): for k in range(highest, -1, -1): I = np.where((A >> k) == 1)[0] if len(I) == 0: continue i = I[0] x = A[i] A ^= ((A >> k) & 1) * x A[i] = x nums = np.array([A[v] for v in range(N + 1) if v == root[v] != 0], np.int32) row_transform_over_F2(nums, 31) nums.sort() nums = nums[::-1] for x in nums: if x <= X: X ^= x if X != 0: print(0) else: MOD = 10 ** 9 + 7 free = int(np.sum(nums == 0)) print(pow(2, free, MOD))