結果
問題 | No.1900 Don't be Powers of 2 |
ユーザー | aaaaaaaaaa2230 |
提出日時 | 2022-04-08 23:41:01 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,515 ms / 2,000 ms |
コード長 | 2,878 bytes |
コンパイル時間 | 265 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 285,568 KB |
最終ジャッジ日時 | 2024-05-06 09:24:46 |
合計ジャッジ時間 | 33,703 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
53,888 KB |
testcase_01 | AC | 47 ms
54,016 KB |
testcase_02 | AC | 48 ms
54,272 KB |
testcase_03 | AC | 1,345 ms
77,696 KB |
testcase_04 | AC | 1,371 ms
77,952 KB |
testcase_05 | AC | 1,261 ms
77,912 KB |
testcase_06 | AC | 1,316 ms
77,824 KB |
testcase_07 | AC | 1,347 ms
78,100 KB |
testcase_08 | AC | 357 ms
79,616 KB |
testcase_09 | AC | 219 ms
77,568 KB |
testcase_10 | AC | 122 ms
77,440 KB |
testcase_11 | AC | 150 ms
77,468 KB |
testcase_12 | AC | 466 ms
80,256 KB |
testcase_13 | AC | 75 ms
75,904 KB |
testcase_14 | AC | 967 ms
77,568 KB |
testcase_15 | AC | 88 ms
75,904 KB |
testcase_16 | AC | 88 ms
76,032 KB |
testcase_17 | AC | 1,263 ms
77,824 KB |
testcase_18 | AC | 906 ms
77,568 KB |
testcase_19 | AC | 1,369 ms
77,952 KB |
testcase_20 | AC | 938 ms
77,516 KB |
testcase_21 | AC | 875 ms
77,740 KB |
testcase_22 | AC | 836 ms
77,568 KB |
testcase_23 | AC | 671 ms
77,568 KB |
testcase_24 | AC | 1,016 ms
78,012 KB |
testcase_25 | AC | 704 ms
77,696 KB |
testcase_26 | AC | 1,472 ms
285,056 KB |
testcase_27 | AC | 771 ms
106,776 KB |
testcase_28 | AC | 636 ms
81,772 KB |
testcase_29 | AC | 566 ms
81,640 KB |
testcase_30 | AC | 109 ms
76,928 KB |
testcase_31 | AC | 45 ms
54,272 KB |
testcase_32 | AC | 42 ms
54,016 KB |
testcase_33 | AC | 1,329 ms
285,568 KB |
testcase_34 | AC | 1,383 ms
285,384 KB |
testcase_35 | AC | 1,515 ms
284,996 KB |
testcase_36 | AC | 1,199 ms
260,480 KB |
testcase_37 | AC | 831 ms
80,524 KB |
testcase_38 | AC | 662 ms
131,936 KB |
testcase_39 | AC | 595 ms
100,096 KB |
testcase_40 | AC | 1,371 ms
79,260 KB |
testcase_41 | AC | 1,330 ms
81,792 KB |
testcase_42 | AC | 48 ms
54,528 KB |
testcase_43 | AC | 48 ms
54,272 KB |
testcase_44 | AC | 48 ms
54,016 KB |
ソースコード
from collections import deque class MaxFlow: inf = 10**18 class E: def __init__(self,to,cap): self.to = to self.cap = cap self.rev = None def __init__(self,n): self.n = n self.graph = [[] for _ in range(n)] def add_edge(self, fr, to, cap): graph = self.graph edge = self.E(to,cap) edge2 = self.E(fr,0) edge.rev = edge2 edge2.rev = edge graph[fr].append(edge) graph[to].append(edge2) def bfs(self, s, t): level = self.level = [self.n]*self.n q = deque([s]) level[s] = 0 while q: now = q.popleft() lw = level[now]+1 for e in self.graph[now]: if e.cap and level[e.to]> lw: level[e.to] = lw if e.to == t: return True q.append(e.to) return False def dfs(self, s, t, up): graph = self.graph it = self.it level = self.level st = deque([t]) while st: v = st[-1] if v == s: st.pop() flow = up for w in st: e = graph[w][it[w]].rev flow = min(flow, e.cap) for w in st: e = graph[w][it[w]] e.cap += flow e.rev.cap -= flow return flow lv = level[v]-1 while it[v] < len(graph[v]): e = graph[v][it[v]] re = e.rev if re.cap == 0 or lv != level[e.to]: it[v] += 1 continue st.append(e.to) break if it[v] == len(graph[v]): st.pop() level[v] = self.n return 0 def flow(self,s,t,flow_limit=inf): flow = 0 while flow < flow_limit and self.bfs(s,t): self.it = [0]*self.n while flow < flow_limit: f = self.dfs(s,t,flow_limit-flow) if f == 0: break flow += f return flow def min_cut(self,s): visited = [0]*self.n q = deque([s]) while q: v = q.pop() visited[v] = 1 for e in self.graph[v]: if e.cap and not visited[e.to]: q.append(e.to) return visited n = int(input()) A = list(map(int,input().split())) s = n t = n+1 mf = MaxFlow(t+1) for i in range(n): if bin(A[i]).count("1")%2 == 0: mf.add_edge(i,t,1) continue mf.add_edge(s,i,1) a = A[i] for j in range(n): if bin(a^A[j]).count("1") == 1: mf.add_edge(i,j,1) ans = n - mf.flow(s,t) print(ans)