結果

問題 No.1900 Don't be Powers of 2
ユーザー ShirotsumeShirotsume
提出日時 2022-04-08 23:51:35
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,784 ms / 2,000 ms
コード長 3,016 bytes
コンパイル時間 714 ms
コンパイル使用メモリ 87,096 KB
実行使用メモリ 293,508 KB
最終ジャッジ日時 2023-08-19 02:23:29
合計ジャッジ時間 26,088 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 77 ms
71,552 KB
testcase_01 AC 79 ms
71,728 KB
testcase_02 AC 82 ms
76,256 KB
testcase_03 AC 641 ms
79,196 KB
testcase_04 AC 732 ms
79,124 KB
testcase_05 AC 670 ms
78,884 KB
testcase_06 AC 728 ms
79,188 KB
testcase_07 AC 674 ms
79,140 KB
testcase_08 AC 300 ms
80,796 KB
testcase_09 AC 213 ms
79,452 KB
testcase_10 AC 132 ms
78,388 KB
testcase_11 AC 164 ms
78,760 KB
testcase_12 AC 381 ms
81,476 KB
testcase_13 AC 100 ms
77,660 KB
testcase_14 AC 524 ms
78,748 KB
testcase_15 AC 101 ms
77,824 KB
testcase_16 AC 101 ms
77,756 KB
testcase_17 AC 611 ms
79,088 KB
testcase_18 AC 544 ms
78,772 KB
testcase_19 AC 732 ms
79,208 KB
testcase_20 AC 532 ms
78,696 KB
testcase_21 AC 443 ms
79,020 KB
testcase_22 AC 429 ms
78,896 KB
testcase_23 AC 614 ms
78,500 KB
testcase_24 AC 543 ms
78,576 KB
testcase_25 AC 511 ms
78,884 KB
testcase_26 AC 1,784 ms
293,112 KB
testcase_27 AC 670 ms
108,964 KB
testcase_28 AC 459 ms
83,468 KB
testcase_29 AC 436 ms
82,732 KB
testcase_30 AC 128 ms
78,680 KB
testcase_31 AC 74 ms
71,580 KB
testcase_32 AC 76 ms
71,548 KB
testcase_33 AC 1,357 ms
290,444 KB
testcase_34 AC 1,511 ms
288,804 KB
testcase_35 AC 1,511 ms
293,508 KB
testcase_36 AC 1,363 ms
266,432 KB
testcase_37 AC 562 ms
82,340 KB
testcase_38 AC 389 ms
133,704 KB
testcase_39 AC 259 ms
99,940 KB
testcase_40 AC 635 ms
80,208 KB
testcase_41 AC 626 ms
82,944 KB
testcase_42 AC 75 ms
71,544 KB
testcase_43 AC 76 ms
71,428 KB
testcase_44 AC 76 ms
71,692 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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):
    cnt = 0
    for i in range(30):
        if 1 & (m >> i):
            cnt += 1
    return cnt
n=int(input())
a=list(map(int,input().split()))

s,t=n,n+1
g=MaxFlow(n+2)
inf=1

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))
0