結果
問題 | No.1900 Don't be Powers of 2 |
ユーザー | vwxyz |
提出日時 | 2023-06-13 06:25:08 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 5,481 bytes |
コンパイル時間 | 310 ms |
コンパイル使用メモリ | 86,976 KB |
実行使用メモリ | 571,288 KB |
最終ジャッジ日時 | 2023-09-03 00:33:39 |
合計ジャッジ時間 | 31,051 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 285 ms
97,168 KB |
testcase_01 | AC | 289 ms
97,468 KB |
testcase_02 | AC | 287 ms
97,592 KB |
testcase_03 | AC | 409 ms
104,064 KB |
testcase_04 | AC | 405 ms
104,232 KB |
testcase_05 | AC | 405 ms
104,052 KB |
testcase_06 | AC | 408 ms
104,072 KB |
testcase_07 | AC | 406 ms
103,988 KB |
testcase_08 | AC | 423 ms
107,164 KB |
testcase_09 | AC | 380 ms
104,640 KB |
testcase_10 | AC | 344 ms
103,304 KB |
testcase_11 | AC | 354 ms
103,616 KB |
testcase_12 | AC | 431 ms
108,328 KB |
testcase_13 | AC | 300 ms
98,648 KB |
testcase_14 | AC | 379 ms
103,524 KB |
testcase_15 | AC | 296 ms
98,904 KB |
testcase_16 | AC | 303 ms
98,784 KB |
testcase_17 | AC | 396 ms
103,876 KB |
testcase_18 | AC | 387 ms
103,632 KB |
testcase_19 | AC | 404 ms
104,260 KB |
testcase_20 | AC | 384 ms
103,872 KB |
testcase_21 | AC | 372 ms
103,868 KB |
testcase_22 | AC | 366 ms
103,816 KB |
testcase_23 | AC | 381 ms
103,876 KB |
testcase_24 | AC | 393 ms
103,904 KB |
testcase_25 | AC | 390 ms
103,968 KB |
testcase_26 | TLE | - |
testcase_27 | AC | 760 ms
162,040 KB |
testcase_28 | AC | 461 ms
111,400 KB |
testcase_29 | AC | 455 ms
111,160 KB |
testcase_30 | AC | 346 ms
103,120 KB |
testcase_31 | AC | 295 ms
97,384 KB |
testcase_32 | AC | 287 ms
97,332 KB |
testcase_33 | TLE | - |
testcase_34 | TLE | - |
testcase_35 | TLE | - |
testcase_36 | AC | 1,841 ms
454,612 KB |
testcase_37 | AC | 472 ms
109,560 KB |
testcase_38 | AC | 710 ms
213,360 KB |
testcase_39 | AC | 489 ms
140,072 KB |
testcase_40 | AC | 455 ms
105,872 KB |
testcase_41 | AC | 500 ms
111,228 KB |
testcase_42 | AC | 290 ms
97,328 KB |
testcase_43 | AC | 288 ms
97,480 KB |
testcase_44 | AC | 292 ms
97,340 KB |
ソースコード
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)} MFG=MFGraph(2*N+2) s=0 t=2*N+1 for i in range(N): MFG.add_edge(s,i+1,1) MFG.add_edge(i+N+1,t,1) for j in range(N): if A[i]^A[j] in pow2: MFG.add_edge(i+1,j+N+1,1) flow=MFG.flow(s,t) ans=N-flow//2 print(ans)