結果

問題 No.2505 matriX cOnstRuction
ユーザー suisen
提出日時 2023-07-27 23:38:55
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,029 ms / 2,500 ms
コード長 4,308 bytes
コンパイル時間 357 ms
コンパイル使用メモリ 82,228 KB
実行使用メモリ 193,408 KB
最終ジャッジ日時 2024-09-15 14:07:21
合計ジャッジ時間 23,488 ms
ジャッジサーバーID
(参考情報)
judge6 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 64
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#
from itertools import product
import sys
from typing import List
def floor_pow2(n: int):
"""
2 ** (floor(log2(n)))
"""
x = 1
while (x << 1) <= n:
x <<= 1
return x
# nm
MAX_NM = 50000
BIT_NUM = 30
INF_COST = 1 << 30
# -------------- Binary Trie -------------- #
# :
# - N 3(n+m)
# - 1<=n 1<=m nm<=MAX_NM n+m MAX_NM + 1
# - () BIT_NUM
# ===> 3*(MAX_NM+1)*BIT_NUM+1 (+1 )
# 3. 2*BIT_NUM 3*(MAX_NM+1)*2*BIT_NUM+1
MAX_NODE_NUM = 3 * (MAX_NM + 1) * BIT_NUM + 1
# Binary Trie
# - child[0][i] = i (-1 )
# - child[1][i] = i (-1 )
# - weight[i] = i
child = [[-1] * MAX_NODE_NUM, [-1] * MAX_NODE_NUM]
weight = [0] * MAX_NODE_NUM
# Binary Trie
node_num = 0
def create_node() -> int:
global node_num
# ID
new_node = node_num
# ★
child[0][new_node] = -1 # Null
child[1][new_node] = -1 # Null
weight[new_node] = 0 # 0
node_num += 1
return new_node
def clear_trie() -> None:
global node_num
node_num = 0
# -------------- Binary Trie -------------- #
def solve(n: int, m: int, R: List[int], C: List[int], A: List[List[int]]):
for i, j in product(range(n), range(m)):
if A[0][0] ^ A[0][j] ^ A[i][0] ^ A[i][j]:
print(-1)
return
clear_trie()
root = create_node()
# f(X) += W * [X ^ Y > Z]
def add_weight(Y: int, Z: int, W: int):
YZ = Y ^ Z
cur = root
# Binary Trie Y^Z
for bit in reversed(range(BIT_NUM)):
ch = child[(YZ >> bit) & 1]
if ch[cur] == -1:
ch[cur] = create_node()
nxt = ch[cur]
# : Z bit 0 +W, -W
if not ((Z >> bit) & 1):
weight[cur] += W
weight[nxt] -= W
cur = nxt
for i in range(n):
Y = A[0][0] ^ A[i][0]
if R[i]:
add_weight(Y, 0, 1)
add_weight(Y, R[i], 1)
add_weight(Y, 2 * floor_pow2(R[i]) - 1, INF_COST)
else:
add_weight(Y, 0, INF_COST)
for j in range(m):
Y = A[0][j]
if C[j]:
add_weight(Y, 0, 1)
add_weight(Y, C[j], 1)
add_weight(Y, 2 * floor_pow2(C[j]) - 1, INF_COST)
else:
add_weight(Y, 0, INF_COST)
ans = INF_COST
#
# ★ Binary TrieID<IDID
for cur in range(node_num):
# nxt: cur
for nxt in (child[0][cur], child[1][cur]):
if nxt != -1:
#
weight[nxt] += weight[cur]
else:
# ==> ==>
ans = min(ans, weight[cur])
print(ans if ans < INF_COST else -1)
if __name__ == '__main__':
readline = sys.stdin.readline
T = int(readline())
for _ in range(T):
n, m = map(int, readline().split())
R = list(map(int, readline().split()))
C = list(map(int, readline().split()))
A = [list(map(int, readline().split())) for _ in range(n)]
solve(n, m, R, C, A)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0