結果

問題 No.1900 Don't be Powers of 2
ユーザー vwxyzvwxyz
提出日時 2023-06-13 06:28:28
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,036 ms / 2,000 ms
コード長 5,606 bytes
コンパイル時間 183 ms
コンパイル使用メモリ 82,248 KB
実行使用メモリ 336,432 KB
最終ジャッジ日時 2024-06-12 06:26:47
合計ジャッジ時間 14,676 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 151 ms
89,220 KB
testcase_01 AC 134 ms
89,328 KB
testcase_02 AC 132 ms
89,364 KB
testcase_03 AC 229 ms
92,500 KB
testcase_04 AC 234 ms
92,568 KB
testcase_05 AC 228 ms
92,568 KB
testcase_06 AC 223 ms
92,492 KB
testcase_07 AC 223 ms
92,784 KB
testcase_08 AC 226 ms
92,960 KB
testcase_09 AC 194 ms
92,864 KB
testcase_10 AC 177 ms
92,236 KB
testcase_11 AC 186 ms
92,280 KB
testcase_12 AC 253 ms
95,596 KB
testcase_13 AC 161 ms
90,060 KB
testcase_14 AC 215 ms
91,940 KB
testcase_15 AC 146 ms
89,980 KB
testcase_16 AC 148 ms
90,148 KB
testcase_17 AC 229 ms
92,572 KB
testcase_18 AC 222 ms
91,848 KB
testcase_19 AC 237 ms
91,920 KB
testcase_20 AC 212 ms
92,072 KB
testcase_21 AC 217 ms
91,896 KB
testcase_22 AC 221 ms
92,500 KB
testcase_23 AC 164 ms
91,908 KB
testcase_24 AC 169 ms
92,392 KB
testcase_25 AC 202 ms
92,276 KB
testcase_26 AC 1,036 ms
332,680 KB
testcase_27 AC 316 ms
117,936 KB
testcase_28 AC 252 ms
96,724 KB
testcase_29 AC 253 ms
96,004 KB
testcase_30 AC 207 ms
92,176 KB
testcase_31 AC 133 ms
89,508 KB
testcase_32 AC 140 ms
89,288 KB
testcase_33 AC 946 ms
330,848 KB
testcase_34 AC 999 ms
336,432 KB
testcase_35 AC 1,004 ms
336,100 KB
testcase_36 AC 808 ms
300,432 KB
testcase_37 AC 277 ms
95,520 KB
testcase_38 AC 318 ms
144,652 KB
testcase_39 AC 209 ms
115,400 KB
testcase_40 AC 271 ms
93,852 KB
testcase_41 AC 301 ms
96,384 KB
testcase_42 AC 139 ms
89,412 KB
testcase_43 AC 139 ms
89,416 KB
testcase_44 AC 132 ms
89,392 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
from typing import NamedTuple, Optional, List, cast

class MFGraph:
    class Edge(NamedTuple):
        src: int
        dst: int
        cap: int
        flow: int

    class _Edge:
        def __init__(self, dst: int, cap: int) -> None:
            self.dst = dst
            self.cap = cap
            self.rev: Optional[MFGraph._Edge] = None

    def __init__(self, n: int) -> None:
        self._n = n
        self._g: List[List[MFGraph._Edge]] = [[] for _ in range(n)]
        self._edges: List[MFGraph._Edge] = []

    def add_edge(self, src: int, dst: int, cap: int) -> int:
        assert 0 <= src < self._n
        assert 0 <= dst < self._n
        assert 0 <= cap
        m = len(self._edges)
        e = MFGraph._Edge(dst, cap)
        re = MFGraph._Edge(src, 0)
        e.rev = re
        re.rev = e
        self._g[src].append(e)
        self._g[dst].append(re)
        self._edges.append(e)
        return m

    def get_edge(self, i: int) -> Edge:
        assert 0 <= i < len(self._edges)
        e = self._edges[i]
        re = cast(MFGraph._Edge, e.rev)
        return MFGraph.Edge(
            re.dst,
            e.dst,
            e.cap + re.cap,
            re.cap
        )

    def edges(self) -> List[Edge]:
        return [self.get_edge(i) for i in range(len(self._edges))]

    def change_edge(self, i: int, new_cap: int, new_flow: int) -> None:
        assert 0 <= i < len(self._edges)
        assert 0 <= new_flow <= new_cap
        e = self._edges[i]
        e.cap = new_cap - new_flow
        assert e.rev is not None
        e.rev.cap = new_flow

    def flow(self, s: int, t: int, flow_limit: Optional[int] = None) -> int:
        assert 0 <= s < self._n
        assert 0 <= t < self._n
        assert s != t
        if flow_limit is None:
            flow_limit = cast(int, sum(e.cap for e in self._g[s]))

        current_edge = [0] * self._n
        level = [0] * self._n

        def fill(arr: List[int], value: int) -> None:
            for i in range(len(arr)):
                arr[i] = value

        def bfs() -> bool:
            fill(level, self._n)
            queue = []
            q_front = 0
            queue.append(s)
            level[s] = 0
            while q_front < len(queue):
                v = queue[q_front]
                q_front += 1
                next_level = level[v] + 1
                for e in self._g[v]:
                    if e.cap == 0 or level[e.dst] <= next_level:
                        continue
                    level[e.dst] = next_level
                    if e.dst == t:
                        return True
                    queue.append(e.dst)
            return False

        def dfs(lim: int) -> int:
            stack = []
            edge_stack: List[MFGraph._Edge] = []
            stack.append(t)
            while stack:
                v = stack[-1]
                if v == s:
                    flow = min(lim, min(e.cap for e in edge_stack))
                    for e in edge_stack:
                        e.cap -= flow
                        assert e.rev is not None
                        e.rev.cap += flow
                    return flow
                next_level = level[v] - 1
                while current_edge[v] < len(self._g[v]):
                    e = self._g[v][current_edge[v]]
                    re = cast(MFGraph._Edge, e.rev)
                    if level[e.dst] != next_level or re.cap == 0:
                        current_edge[v] += 1
                        continue
                    stack.append(e.dst)
                    edge_stack.append(re)
                    break
                else:
                    stack.pop()
                    if edge_stack:
                        edge_stack.pop()
                    level[v] = self._n
            return 0

        flow = 0
        while flow < flow_limit:
            if not bfs():
                break
            fill(current_edge, 0)
            while flow < flow_limit:
                f = dfs(flow_limit - flow)
                flow += f
                if f == 0:
                    break
        return flow

    def min_cut(self, s: int) -> List[bool]:
        visited = [False] * self._n
        stack = [s]
        visited[s] = True
        while stack:
            v = stack.pop()
            for e in self._g[v]:
                if e.cap > 0 and not visited[e.dst]:
                    visited[e.dst] = True
                    stack.append(e.dst)
        return visited

N=int(readline())
A=list(map(int,readline().split()))
pow2={1<<i for i in range(30)}
cnt=[sum(1 for b in range(30) if a&1<<b) for a in A]
MFG=MFGraph(N+2)
s=0
t=N+1
for i in range(N):
    if cnt[i]%2==0:
        MFG.add_edge(s,i+1,1)
    else:
        MFG.add_edge(i+1,t,1)
    if cnt[i]%2==0:
        for j in range(N):
            if cnt[j]%2 and A[i]^A[j] in pow2:
                MFG.add_edge(i+1,j+1,1)
flow=MFG.flow(s,t)
ans=N-flow
print(ans)
0