結果
問題 | No.1900 Don't be Powers of 2 |
ユーザー | tamato |
提出日時 | 2022-04-08 22:45:27 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,793 ms / 2,000 ms |
コード長 | 3,176 bytes |
コンパイル時間 | 165 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 322,844 KB |
最終ジャッジ日時 | 2024-05-06 08:23:39 |
合計ジャッジ時間 | 18,553 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
54,144 KB |
testcase_01 | AC | 42 ms
54,144 KB |
testcase_02 | AC | 47 ms
59,392 KB |
testcase_03 | AC | 328 ms
77,824 KB |
testcase_04 | AC | 307 ms
77,440 KB |
testcase_05 | AC | 337 ms
77,976 KB |
testcase_06 | AC | 332 ms
78,272 KB |
testcase_07 | AC | 323 ms
77,952 KB |
testcase_08 | AC | 246 ms
79,744 KB |
testcase_09 | AC | 175 ms
77,952 KB |
testcase_10 | AC | 107 ms
76,800 KB |
testcase_11 | AC | 132 ms
78,080 KB |
testcase_12 | AC | 275 ms
80,696 KB |
testcase_13 | AC | 65 ms
75,904 KB |
testcase_14 | AC | 234 ms
77,608 KB |
testcase_15 | AC | 62 ms
76,160 KB |
testcase_16 | AC | 63 ms
76,160 KB |
testcase_17 | AC | 312 ms
77,616 KB |
testcase_18 | AC | 287 ms
77,460 KB |
testcase_19 | AC | 323 ms
77,892 KB |
testcase_20 | AC | 262 ms
77,548 KB |
testcase_21 | AC | 275 ms
77,440 KB |
testcase_22 | AC | 249 ms
77,184 KB |
testcase_23 | AC | 55 ms
66,048 KB |
testcase_24 | AC | 56 ms
66,048 KB |
testcase_25 | AC | 352 ms
77,056 KB |
testcase_26 | AC | 1,793 ms
322,836 KB |
testcase_27 | AC | 598 ms
110,336 KB |
testcase_28 | AC | 327 ms
81,684 KB |
testcase_29 | AC | 322 ms
81,408 KB |
testcase_30 | AC | 123 ms
77,816 KB |
testcase_31 | AC | 42 ms
54,144 KB |
testcase_32 | AC | 42 ms
54,016 KB |
testcase_33 | AC | 1,615 ms
322,448 KB |
testcase_34 | AC | 1,608 ms
322,844 KB |
testcase_35 | AC | 1,698 ms
322,688 KB |
testcase_36 | AC | 1,443 ms
277,376 KB |
testcase_37 | AC | 397 ms
81,072 KB |
testcase_38 | AC | 352 ms
136,064 KB |
testcase_39 | AC | 173 ms
99,584 KB |
testcase_40 | AC | 365 ms
79,104 KB |
testcase_41 | AC | 460 ms
81,792 KB |
testcase_42 | AC | 42 ms
54,332 KB |
testcase_43 | AC | 42 ms
54,272 KB |
testcase_44 | AC | 42 ms
53,888 KB |
ソースコード
mod = 998244353 def main(): import sys input = sys.stdin.readline from collections import deque class Dinic: def __init__(self, N): self.N = N self.adj = [[] for _ in range(N + 1)] self.lv = None self.progress = None self.inf = 1 << 60 def add_edge(self, fr, to, cap): # [to, cap, rev] forward = [to, cap, None] backward = forward[2] = [fr, 0, forward] self.adj[fr].append(forward) self.adj[to].append(backward) def bfs(self, s, t): que = deque([s]) lv = [-1] * (self.N + 1) lv[s] = 0 while que: v = que.popleft() lvv = lv[v] for u, cap, _ in self.adj[v]: if cap and lv[u] == -1: que.append(u) lv[u] = lvv + 1 if u == t: break self.lv = lv def dfs(self, s, t, flow): st = deque([s]) st_f = deque([flow]) while st: v = st[-1] f = st_f[-1] if v == t: for i in range(len(st) - 1, 0, -1): p = st[i - 1] edge = self.adj[p][self.progress[p] - 1] edge[1] -= f edge[2][1] += f return f if self.progress[v] == len(self.adj[v]): st.pop() st_f.pop() continue else: adj_v = self.adj[v] for i in range(self.progress[v], len(adj_v)): i = self.progress[v] self.progress[v] = i + 1 u, cap, rev = adj_v[i] if not cap or self.lv[u] != self.lv[v] + 1: continue else: st.append(u) st_f.append(min(st_f[-1], cap)) break def max_flow(self, s, t): flow = 0 while True: self.bfs(s, t) if self.lv[t] < 0: return flow self.progress = [0] * (self.N + 1) flow_new = self.dfs(s, t, self.inf) while flow_new: flow += flow_new flow_new = self.dfs(s, t, self.inf) def popcount(n): res = 0 for i in range(30): res += n >> i & 1 return res N = int(input()) A = list(map(int, input().split())) D = Dinic(N + 2) s = N + 1 t = s + 1 for i, a in enumerate(A): k = popcount(a) if k & 1: D.add_edge(i + 1, t, 1) else: D.add_edge(s, i + 1, 1) for j, b in enumerate(A): if popcount(a ^ b) == 1: D.add_edge(i + 1, j + 1, 1) print(N - D.max_flow(s, t)) if __name__ == '__main__': main()