結果

問題 No.1969 XOR Equation
ユーザー chineristACchineristAC
提出日時 2022-02-09 00:24:47
言語 PyPy3
(7.3.15)
結果
RE  
(最新)
AC  
(最初)
実行時間 -
コード長 1,794 bytes
コンパイル時間 161 ms
コンパイル使用メモリ 82,440 KB
実行使用メモリ 67,772 KB
最終ジャッジ日時 2024-09-21 02:23:11
合計ジャッジ時間 3,817 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample RE * 1
other RE * 36
権限があれば一括ダウンロードができます

ソースコード

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

def solve_mini(N,A,Y,M=60):
dp = [[1<<(M+1) for j in range(N+1)] for i in range(M+1)]
for j in range(Y>>M,N+1,2):
dp[M][j] = 0
low_sort = [[i for i in range(N)] for _ in range(M)]
"""
for t in range(M):
low_sort[t].sort(key=lambda i:A[i]%(1<<(t+1)),reverse=True)
"""
pre = [i for i in range(N)]
for t in range(M):
zero,one = [],[]
for i in pre:
if A[i]>>t & 1:
one.append(i)
else:
zero.append(i)
pre = one + zero
low_sort[t] = [i for i in pre]
for i in range(M)[::-1]:
zero,one,two = 0,0,0
for j in range(N):
if A[j]>>i & 1:
one += 1
else:
zero += 1
if one&1==(Y>>i & 1):
dp[i][0] = min(dp[i][0], 2*dp[i+1][two])
if (zero+two)&1==(Y>>i & 1):
dp[i][0] = min(dp[i][0], 2*dp[i+1][one+two]+1)
if i==0:
break
for j in range(1,N+1):
next_up = low_sort[i-1][j-1]
if A[next_up]>>i & 1:
one -= 1
two += 1
else:
zero -= 1
one += 1
if j!=N:
next_next_up = low_sort[i-1][j]
if A[next_up]%(1<<(t+1)) == A[next_next_up]%(1<<(t+1)):
continue
if one&1==(Y>>i & 1):
dp[i][j] = min(dp[i][j], 2*dp[i+1][two])
if (zero+two)&1==(Y>>i & 1):
dp[i][j] = min(dp[i][j], 2*dp[i+1][one+two]+1)
if dp[0][0]==1<<(M+1):
return -1
return dp[0][0]
N,Y = map(int,input().split())
A = list(map(int,input().split()))
print(solve_mini(N,A,Y))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0