結果
問題 | No.1900 Don't be Powers of 2 |
ユーザー | とりゐ |
提出日時 | 2022-04-09 00:37:23 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,207 ms / 2,000 ms |
コード長 | 2,986 bytes |
コンパイル時間 | 259 ms |
コンパイル使用メモリ | 87,292 KB |
実行使用メモリ | 291,196 KB |
最終ジャッジ日時 | 2023-08-19 03:01:51 |
合計ジャッジ時間 | 15,384 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 77 ms
71,452 KB |
testcase_01 | AC | 77 ms
71,448 KB |
testcase_02 | AC | 81 ms
76,544 KB |
testcase_03 | AC | 313 ms
79,064 KB |
testcase_04 | AC | 313 ms
79,060 KB |
testcase_05 | AC | 310 ms
79,132 KB |
testcase_06 | AC | 312 ms
79,540 KB |
testcase_07 | AC | 317 ms
79,124 KB |
testcase_08 | AC | 185 ms
81,108 KB |
testcase_09 | AC | 145 ms
79,172 KB |
testcase_10 | AC | 112 ms
78,468 KB |
testcase_11 | AC | 126 ms
79,144 KB |
testcase_12 | AC | 211 ms
82,200 KB |
testcase_13 | AC | 89 ms
77,764 KB |
testcase_14 | AC | 241 ms
78,928 KB |
testcase_15 | AC | 88 ms
77,996 KB |
testcase_16 | AC | 89 ms
77,928 KB |
testcase_17 | AC | 291 ms
78,872 KB |
testcase_18 | AC | 250 ms
79,116 KB |
testcase_19 | AC | 292 ms
79,148 KB |
testcase_20 | AC | 238 ms
78,996 KB |
testcase_21 | AC | 234 ms
78,848 KB |
testcase_22 | AC | 225 ms
78,852 KB |
testcase_23 | AC | 98 ms
78,592 KB |
testcase_24 | AC | 172 ms
79,000 KB |
testcase_25 | AC | 198 ms
79,332 KB |
testcase_26 | AC | 1,108 ms
291,108 KB |
testcase_27 | AC | 354 ms
108,476 KB |
testcase_28 | AC | 237 ms
83,068 KB |
testcase_29 | AC | 240 ms
83,184 KB |
testcase_30 | AC | 112 ms
78,856 KB |
testcase_31 | AC | 76 ms
71,452 KB |
testcase_32 | AC | 76 ms
71,700 KB |
testcase_33 | AC | 1,039 ms
286,240 KB |
testcase_34 | AC | 1,084 ms
286,444 KB |
testcase_35 | AC | 1,207 ms
291,196 KB |
testcase_36 | AC | 986 ms
265,324 KB |
testcase_37 | AC | 283 ms
82,376 KB |
testcase_38 | AC | 315 ms
132,156 KB |
testcase_39 | AC | 220 ms
100,600 KB |
testcase_40 | AC | 339 ms
80,436 KB |
testcase_41 | AC | 349 ms
82,804 KB |
testcase_42 | AC | 76 ms
71,608 KB |
testcase_43 | AC | 77 ms
71,816 KB |
testcase_44 | AC | 76 ms
71,916 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): k=m cnt=0 while k: cnt+=k&1 k>>=1 return cnt 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))