結果

問題 No.1900 Don't be Powers of 2
ユーザー aaaaaaaaaa2230aaaaaaaaaa2230
提出日時 2022-04-08 23:41:01
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,196 ms / 2,000 ms
コード長 2,878 bytes
コンパイル時間 281 ms
コンパイル使用メモリ 82,516 KB
実行使用メモリ 285,636 KB
最終ジャッジ日時 2024-11-28 14:57:23
合計ジャッジ時間 28,112 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 36 ms
55,976 KB
testcase_01 AC 37 ms
56,304 KB
testcase_02 AC 37 ms
56,104 KB
testcase_03 AC 1,176 ms
77,712 KB
testcase_04 AC 1,196 ms
78,168 KB
testcase_05 AC 1,114 ms
77,968 KB
testcase_06 AC 1,138 ms
77,824 KB
testcase_07 AC 1,170 ms
77,904 KB
testcase_08 AC 297 ms
79,928 KB
testcase_09 AC 184 ms
78,012 KB
testcase_10 AC 97 ms
77,464 KB
testcase_11 AC 122 ms
77,316 KB
testcase_12 AC 392 ms
80,464 KB
testcase_13 AC 60 ms
76,112 KB
testcase_14 AC 840 ms
77,680 KB
testcase_15 AC 65 ms
76,076 KB
testcase_16 AC 63 ms
76,048 KB
testcase_17 AC 1,112 ms
77,724 KB
testcase_18 AC 778 ms
77,664 KB
testcase_19 AC 1,189 ms
77,876 KB
testcase_20 AC 815 ms
77,816 KB
testcase_21 AC 751 ms
77,848 KB
testcase_22 AC 708 ms
77,456 KB
testcase_23 AC 537 ms
77,332 KB
testcase_24 AC 842 ms
77,512 KB
testcase_25 AC 590 ms
77,756 KB
testcase_26 AC 1,129 ms
284,888 KB
testcase_27 AC 614 ms
106,900 KB
testcase_28 AC 542 ms
81,980 KB
testcase_29 AC 471 ms
81,412 KB
testcase_30 AC 90 ms
77,048 KB
testcase_31 AC 35 ms
54,948 KB
testcase_32 AC 38 ms
56,224 KB
testcase_33 AC 1,067 ms
285,348 KB
testcase_34 AC 1,050 ms
285,636 KB
testcase_35 AC 1,130 ms
285,000 KB
testcase_36 AC 852 ms
260,404 KB
testcase_37 AC 676 ms
80,772 KB
testcase_38 AC 523 ms
131,912 KB
testcase_39 AC 480 ms
100,520 KB
testcase_40 AC 1,172 ms
79,612 KB
testcase_41 AC 1,133 ms
81,768 KB
testcase_42 AC 36 ms
55,084 KB
testcase_43 AC 35 ms
54,732 KB
testcase_44 AC 35 ms
54,732 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


n = int(input())
A = list(map(int,input().split()))
s = n
t = n+1
mf = MaxFlow(t+1)

for i in range(n):
    if bin(A[i]).count("1")%2 == 0:
        mf.add_edge(i,t,1)
        continue

    mf.add_edge(s,i,1)
    a = A[i]
    for j in range(n):
        if bin(a^A[j]).count("1") == 1:
            mf.add_edge(i,j,1)
        

ans = n - mf.flow(s,t)
print(ans)
0