結果
問題 | No.1900 Don't be Powers of 2 |
ユーザー | 👑 tamato |
提出日時 | 2022-04-08 22:45:27 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,176 bytes |
コンパイル時間 | 327 ms |
コンパイル使用メモリ | 86,940 KB |
実行使用メモリ | 323,756 KB |
最終ジャッジ日時 | 2023-08-19 01:14:30 |
合計ジャッジ時間 | 25,753 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 103 ms
71,696 KB |
testcase_01 | AC | 100 ms
71,860 KB |
testcase_02 | AC | 104 ms
76,476 KB |
testcase_03 | AC | 449 ms
79,388 KB |
testcase_04 | AC | 461 ms
79,112 KB |
testcase_05 | AC | 530 ms
79,076 KB |
testcase_06 | AC | 510 ms
79,488 KB |
testcase_07 | AC | 496 ms
79,184 KB |
testcase_08 | AC | 358 ms
81,112 KB |
testcase_09 | AC | 231 ms
79,588 KB |
testcase_10 | AC | 156 ms
78,328 KB |
testcase_11 | AC | 188 ms
78,816 KB |
testcase_12 | AC | 412 ms
82,220 KB |
testcase_13 | AC | 128 ms
77,676 KB |
testcase_14 | AC | 372 ms
79,692 KB |
testcase_15 | AC | 129 ms
77,040 KB |
testcase_16 | AC | 128 ms
77,272 KB |
testcase_17 | AC | 453 ms
79,228 KB |
testcase_18 | AC | 413 ms
78,780 KB |
testcase_19 | AC | 489 ms
79,084 KB |
testcase_20 | AC | 409 ms
78,860 KB |
testcase_21 | AC | 347 ms
79,288 KB |
testcase_22 | AC | 326 ms
78,976 KB |
testcase_23 | AC | 107 ms
77,900 KB |
testcase_24 | AC | 114 ms
77,860 KB |
testcase_25 | AC | 438 ms
78,792 KB |
testcase_26 | TLE | - |
testcase_27 | AC | 748 ms
111,688 KB |
testcase_28 | AC | 477 ms
83,180 KB |
testcase_29 | AC | 493 ms
82,748 KB |
testcase_30 | AC | 192 ms
78,740 KB |
testcase_31 | AC | 109 ms
71,596 KB |
testcase_32 | AC | 106 ms
71,648 KB |
testcase_33 | TLE | - |
testcase_34 | AC | 1,852 ms
323,596 KB |
testcase_35 | TLE | - |
testcase_36 | AC | 1,855 ms
279,492 KB |
testcase_37 | AC | 584 ms
82,464 KB |
testcase_38 | AC | 510 ms
137,680 KB |
testcase_39 | AC | 215 ms
97,680 KB |
testcase_40 | AC | 477 ms
80,584 KB |
testcase_41 | AC | 598 ms
83,644 KB |
testcase_42 | AC | 105 ms
71,720 KB |
testcase_43 | AC | 108 ms
71,596 KB |
testcase_44 | AC | 104 ms
71,772 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()