結果

問題 No.1900 Don't be Powers of 2
ユーザー とりゐとりゐ
提出日時 2022-04-08 23:14:29
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,768 ms / 2,000 ms
コード長 2,946 bytes
コンパイル時間 295 ms
コンパイル使用メモリ 86,744 KB
実行使用メモリ 292,448 KB
最終ジャッジ日時 2023-08-19 01:51:13
合計ジャッジ時間 32,463 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 76 ms
71,748 KB
testcase_01 AC 77 ms
71,816 KB
testcase_02 AC 78 ms
71,472 KB
testcase_03 AC 1,191 ms
79,160 KB
testcase_04 AC 1,179 ms
78,872 KB
testcase_05 AC 1,181 ms
79,120 KB
testcase_06 AC 1,177 ms
78,816 KB
testcase_07 AC 1,184 ms
78,792 KB
testcase_08 AC 376 ms
80,448 KB
testcase_09 AC 235 ms
78,832 KB
testcase_10 AC 137 ms
78,408 KB
testcase_11 AC 173 ms
78,576 KB
testcase_12 AC 484 ms
81,656 KB
testcase_13 AC 100 ms
77,544 KB
testcase_14 AC 819 ms
78,768 KB
testcase_15 AC 102 ms
77,544 KB
testcase_16 AC 104 ms
77,540 KB
testcase_17 AC 1,077 ms
78,872 KB
testcase_18 AC 868 ms
79,008 KB
testcase_19 AC 1,169 ms
78,820 KB
testcase_20 AC 839 ms
78,816 KB
testcase_21 AC 790 ms
79,052 KB
testcase_22 AC 759 ms
78,628 KB
testcase_23 AC 352 ms
78,564 KB
testcase_24 AC 497 ms
78,692 KB
testcase_25 AC 618 ms
78,888 KB
testcase_26 AC 1,768 ms
292,448 KB
testcase_27 AC 736 ms
107,788 KB
testcase_28 AC 629 ms
82,712 KB
testcase_29 AC 584 ms
82,624 KB
testcase_30 AC 137 ms
78,080 KB
testcase_31 AC 76 ms
71,588 KB
testcase_32 AC 80 ms
71,428 KB
testcase_33 AC 1,683 ms
286,312 KB
testcase_34 AC 1,661 ms
286,240 KB
testcase_35 AC 1,744 ms
290,896 KB
testcase_36 AC 1,495 ms
264,928 KB
testcase_37 AC 795 ms
81,648 KB
testcase_38 AC 504 ms
133,612 KB
testcase_39 AC 381 ms
99,216 KB
testcase_40 AC 1,182 ms
80,484 KB
testcase_41 AC 1,184 ms
82,540 KB
testcase_42 AC 76 ms
71,752 KB
testcase_43 AC 77 ms
71,756 KB
testcase_44 AC 76 ms
71,268 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):
  return bin(m).count('1')
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