結果
問題 | No.1900 Don't be Powers of 2 |
ユーザー | とりゐ |
提出日時 | 2022-04-08 23:08:14 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,854 ms / 2,000 ms |
コード長 | 2,955 bytes |
コンパイル時間 | 136 ms |
コンパイル使用メモリ | 82,072 KB |
実行使用メモリ | 290,532 KB |
最終ジャッジ日時 | 2024-11-28 14:15:05 |
合計ジャッジ時間 | 30,679 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
54,528 KB |
testcase_01 | AC | 39 ms
54,656 KB |
testcase_02 | AC | 41 ms
53,888 KB |
testcase_03 | AC | 1,156 ms
77,440 KB |
testcase_04 | AC | 1,164 ms
77,568 KB |
testcase_05 | AC | 1,179 ms
77,696 KB |
testcase_06 | AC | 1,160 ms
77,440 KB |
testcase_07 | AC | 1,163 ms
77,524 KB |
testcase_08 | AC | 310 ms
78,976 KB |
testcase_09 | AC | 185 ms
77,696 KB |
testcase_10 | AC | 97 ms
77,184 KB |
testcase_11 | AC | 134 ms
77,312 KB |
testcase_12 | AC | 418 ms
80,256 KB |
testcase_13 | AC | 67 ms
76,288 KB |
testcase_14 | AC | 823 ms
77,568 KB |
testcase_15 | AC | 67 ms
76,160 KB |
testcase_16 | AC | 71 ms
76,300 KB |
testcase_17 | AC | 1,076 ms
77,184 KB |
testcase_18 | AC | 859 ms
77,184 KB |
testcase_19 | AC | 1,153 ms
77,540 KB |
testcase_20 | AC | 811 ms
77,424 KB |
testcase_21 | AC | 777 ms
77,312 KB |
testcase_22 | AC | 729 ms
77,184 KB |
testcase_23 | AC | 318 ms
77,312 KB |
testcase_24 | AC | 476 ms
77,440 KB |
testcase_25 | AC | 604 ms
77,708 KB |
testcase_26 | AC | 1,854 ms
290,264 KB |
testcase_27 | AC | 678 ms
106,528 KB |
testcase_28 | AC | 536 ms
81,644 KB |
testcase_29 | AC | 499 ms
81,508 KB |
testcase_30 | AC | 100 ms
77,184 KB |
testcase_31 | AC | 38 ms
54,528 KB |
testcase_32 | AC | 37 ms
54,144 KB |
testcase_33 | AC | 1,741 ms
285,912 KB |
testcase_34 | AC | 1,773 ms
285,888 KB |
testcase_35 | AC | 1,815 ms
290,532 KB |
testcase_36 | AC | 1,499 ms
263,920 KB |
testcase_37 | AC | 666 ms
80,256 KB |
testcase_38 | AC | 481 ms
131,200 KB |
testcase_39 | AC | 363 ms
98,256 KB |
testcase_40 | AC | 1,181 ms
78,496 KB |
testcase_41 | AC | 1,180 ms
81,280 KB |
testcase_42 | AC | 38 ms
54,016 KB |
testcase_43 | AC | 36 ms
54,144 KB |
testcase_44 | AC | 36 ms
54,272 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=min(n,100) 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))