結果
問題 |
No.1900 Don't be Powers of 2
|
ユーザー |
|
提出日時 | 2022-04-08 21:38:54 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,353 ms / 2,000 ms |
コード長 | 2,229 bytes |
コンパイル時間 | 169 ms |
コンパイル使用メモリ | 82,560 KB |
実行使用メモリ | 333,504 KB |
最終ジャッジ日時 | 2024-11-28 12:15:52 |
合計ジャッジ時間 | 13,848 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 42 |
ソースコード
from collections import deque class Dinic: def __init__(self, N): self.N = N self.G = [[] for i in range(N)] def add_edge(self, fr, to, cap): forward = [to, cap, None] forward[2] = backward = [fr, 0, forward] self.G[fr].append(forward) self.G[to].append(backward) def add_multi_edge(self, v1, v2, cap1, cap2): edge1 = [v2, cap1, None] edge1[2] = edge2 = [v1, cap2, edge1] self.G[v1].append(edge1) self.G[v2].append(edge2) def bfs(self, s, t): self.level = level = [None]*self.N deq = deque([s]) level[s] = 0 G = self.G while deq: v = deq.popleft() lv = level[v] + 1 for w, cap, _ in G[v]: if cap and level[w] is None: level[w] = lv deq.append(w) return level[t] is not None def dfs(self, v, t, f): if v == t: return f level = self.level for e in self.it[v]: w, cap, rev = e if cap and level[v] < level[w]: d = self.dfs(w, t, min(f, cap)) if d: e[1] -= d rev[1] += d return d return 0 def flow(self, s, t): flow = 0 INF = 10**9 + 7 G = self.G while self.bfs(s, t): *self.it, = map(iter, self.G) f = INF while f: f = self.dfs(s, t, INF) flow += f return flow import sys,random,bisect from collections import deque,defaultdict from heapq import heapify,heappop,heappush from itertools import permutations from math import log,gcd input = lambda :sys.stdin.readline().rstrip() mi = lambda :map(int,input().split()) li = lambda :list(mi()) S = set([1<<i for i in range(31)]) N = int(input()) A = li() G = Dinic(N+2) for i in range(N): if bin(A[i]).count("1")&1: G.add_edge(N,i,1) else: G.add_edge(i,N+1,1) for i in range(N): t = bin(A[i]).count("1") for j in range(N): if A[i]^A[j] in S: if t&1: G.add_edge(i,j,1) F = G.flow(N,N+1) print(N-F)