結果
問題 | No.1969 XOR Equation |
ユーザー |
|
提出日時 | 2022-02-09 08:43:14 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,860 bytes |
コンパイル時間 | 290 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 65,920 KB |
最終ジャッジ日時 | 2024-09-21 02:23:33 |
合計ジャッジ時間 | 3,595 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | RE * 1 |
other | RE * 36 |
ソースコード
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] = 0low_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 + zerolow_sort[t] = [i for i in pre]"""for i in range(M)[::-1]:zero,one,two = 0,0,0for j in range(N):if A[j]>>i & 1:one += 1else:zero += 1if 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:breakfor j in range(1,N+1):next_up = low_sort[i-1][j-1]if A[next_up]>>i & 1:one -= 1two += 1else:zero -= 1one += 1if j!=N:next_next_up = low_sort[i-1][j]if A[next_up]%(1<<(t+1)) == A[next_next_up]%(1<<(t+1)):continueif 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 -1return dp[0][0]def brute(N,A,Y):ans = 2**61M = 1def dfs(d,tmp,up):nonlocal ansif d==61:if len(up)&1==0:return tmpelse:return 1<<61res = ansif tmp > res:return anszero,one,two = 0,set(),set()for i in range(N):if A[i]>>d & 1:if i in up:two.add(i)else:one.add(i)else:if i in up:one.add(i)else:zero += 1if len(one)&1==(Y>>d)&1:res = min(res,dfs(d+1,tmp,two))if (zero+len(two))&1==(Y>>d)&1 and res > tmp + (1<<d):n_up = set([i for i in one]+[j for j in two])res = min(res,dfs(d+1,tmp+(1<<d),n_up))ans = min(ans,res)return resres = dfs(0,0,set())if res < 2**61:return resreturn -1N,Y = map(int,input().split())A = list(map(int,input().split()))assert Y < 2**60assert max(A) < 2**60print(solve_mini(N,A,Y))