結果
問題 | No.1900 Don't be Powers of 2 |
ユーザー | とりゐ |
提出日時 | 2022-04-08 23:07:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,889 ms / 2,000 ms |
コード長 | 2,949 bytes |
コンパイル時間 | 443 ms |
コンパイル使用メモリ | 87,076 KB |
実行使用メモリ | 292,088 KB |
最終ジャッジ日時 | 2023-08-19 01:41:12 |
合計ジャッジ時間 | 33,853 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 82 ms
71,464 KB |
testcase_01 | AC | 77 ms
71,556 KB |
testcase_02 | AC | 85 ms
71,676 KB |
testcase_03 | AC | 1,202 ms
79,120 KB |
testcase_04 | AC | 1,203 ms
79,028 KB |
testcase_05 | AC | 1,197 ms
78,776 KB |
testcase_06 | AC | 1,224 ms
79,032 KB |
testcase_07 | AC | 1,198 ms
78,768 KB |
testcase_08 | AC | 393 ms
80,520 KB |
testcase_09 | AC | 243 ms
78,988 KB |
testcase_10 | AC | 141 ms
78,096 KB |
testcase_11 | AC | 186 ms
78,524 KB |
testcase_12 | AC | 524 ms
81,868 KB |
testcase_13 | AC | 105 ms
77,504 KB |
testcase_14 | AC | 875 ms
78,704 KB |
testcase_15 | AC | 108 ms
77,092 KB |
testcase_16 | AC | 107 ms
77,096 KB |
testcase_17 | AC | 1,146 ms
78,908 KB |
testcase_18 | AC | 929 ms
78,732 KB |
testcase_19 | AC | 1,204 ms
78,872 KB |
testcase_20 | AC | 851 ms
78,764 KB |
testcase_21 | AC | 815 ms
78,740 KB |
testcase_22 | AC | 778 ms
78,812 KB |
testcase_23 | AC | 355 ms
78,724 KB |
testcase_24 | AC | 504 ms
78,460 KB |
testcase_25 | AC | 635 ms
78,768 KB |
testcase_26 | AC | 1,889 ms
292,088 KB |
testcase_27 | AC | 787 ms
107,800 KB |
testcase_28 | AC | 653 ms
82,556 KB |
testcase_29 | AC | 632 ms
82,876 KB |
testcase_30 | AC | 153 ms
78,160 KB |
testcase_31 | AC | 83 ms
71,564 KB |
testcase_32 | AC | 84 ms
71,768 KB |
testcase_33 | AC | 1,731 ms
286,112 KB |
testcase_34 | AC | 1,718 ms
286,152 KB |
testcase_35 | AC | 1,841 ms
290,916 KB |
testcase_36 | AC | 1,556 ms
265,120 KB |
testcase_37 | AC | 808 ms
81,680 KB |
testcase_38 | AC | 520 ms
133,512 KB |
testcase_39 | AC | 393 ms
99,484 KB |
testcase_40 | AC | 1,218 ms
80,648 KB |
testcase_41 | AC | 1,192 ms
82,736 KB |
testcase_42 | AC | 80 ms
71,264 KB |
testcase_43 | AC | 83 ms
71,560 KB |
testcase_44 | AC | 82 ms
71,728 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 def popcount(m): return bin(m).count('1') n=int(input()) a=list(map(int,input().split())) s,t=n,n+1 g=MaxFlow(n+2) inf=n+10 for i in range(n): if popcount(a[i])%2==0: g.add_edge(s,i,1) else: g.add_edge(i,t,1) for i in range(n): for j in range(i+1,n): if popcount(a[i]^a[j])==1: if popcount(a[i])%2==0: g.add_edge(i,j,inf) else: g.add_edge(j,i,inf) print(n-g.flow(s,t))