結果

問題 No.1900 Don't be Powers of 2
ユーザー chineristACchineristAC
提出日時 2022-04-08 21:38:54
言語 PyPy3
(7.3.13)
結果
AC  
実行時間 1,189 ms / 2,000 ms
コード長 2,229 bytes
コンパイル時間 245 ms
コンパイル使用メモリ 86,976 KB
実行使用メモリ 332,940 KB
最終ジャッジ日時 2023-08-19 00:18:31
合計ジャッジ時間 13,987 ms
ジャッジサーバーID
(参考情報)
judge14 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 90 ms
73,196 KB
testcase_01 AC 91 ms
73,060 KB
testcase_02 AC 98 ms
73,468 KB
testcase_03 AC 200 ms
81,348 KB
testcase_04 AC 193 ms
81,296 KB
testcase_05 AC 198 ms
81,532 KB
testcase_06 AC 204 ms
81,352 KB
testcase_07 AC 195 ms
81,168 KB
testcase_08 AC 174 ms
81,928 KB
testcase_09 AC 143 ms
81,456 KB
testcase_10 AC 123 ms
81,060 KB
testcase_11 AC 134 ms
81,056 KB
testcase_12 AC 185 ms
81,840 KB
testcase_13 AC 98 ms
78,880 KB
testcase_14 AC 166 ms
81,232 KB
testcase_15 AC 96 ms
78,852 KB
testcase_16 AC 97 ms
78,732 KB
testcase_17 AC 188 ms
81,544 KB
testcase_18 AC 181 ms
80,992 KB
testcase_19 AC 199 ms
81,344 KB
testcase_20 AC 175 ms
81,212 KB
testcase_21 AC 174 ms
81,388 KB
testcase_22 AC 163 ms
80,972 KB
testcase_23 AC 177 ms
81,144 KB
testcase_24 AC 185 ms
81,124 KB
testcase_25 AC 185 ms
81,380 KB
testcase_26 AC 1,189 ms
331,920 KB
testcase_27 AC 342 ms
110,380 KB
testcase_28 AC 205 ms
82,456 KB
testcase_29 AC 195 ms
82,368 KB
testcase_30 AC 125 ms
80,656 KB
testcase_31 AC 90 ms
73,352 KB
testcase_32 AC 90 ms
73,392 KB
testcase_33 AC 1,094 ms
332,596 KB
testcase_34 AC 1,094 ms
332,624 KB
testcase_35 AC 1,152 ms
332,940 KB
testcase_36 AC 854 ms
274,868 KB
testcase_37 AC 232 ms
84,604 KB
testcase_38 AC 343 ms
130,900 KB
testcase_39 AC 201 ms
99,356 KB
testcase_40 AC 241 ms
83,008 KB
testcase_41 AC 255 ms
85,192 KB
testcase_42 AC 90 ms
73,368 KB
testcase_43 AC 90 ms
73,452 KB
testcase_44 AC 88 ms
73,068 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

from collections import deque
class Dinic:
    def __init__(self, N):
        self.N = N
        self.G = [[] for i in range(N)]

    def add_edge(self, fr, to, cap):
        forward = [to, cap, None]
        forward[2] = backward = [fr, 0, forward]
        self.G[fr].append(forward)
        self.G[to].append(backward)

    def add_multi_edge(self, v1, v2, cap1, cap2):
        edge1 = [v2, cap1, None]
        edge1[2] = edge2 = [v1, cap2, edge1]
        self.G[v1].append(edge1)
        self.G[v2].append(edge2)

    def bfs(self, s, t):
        self.level = level = [None]*self.N
        deq = deque([s])
        level[s] = 0
        G = self.G
        while deq:
            v = deq.popleft()
            lv = level[v] + 1
            for w, cap, _ in G[v]:
                if cap and level[w] is None:
                    level[w] = lv
                    deq.append(w)
        return level[t] is not None

    def dfs(self, v, t, f):
        if v == t:
            return f
        level = self.level
        for e in self.it[v]:
            w, cap, rev = e
            if cap and level[v] < level[w]:
                d = self.dfs(w, t, min(f, cap))
                if d:
                    e[1] -= d
                    rev[1] += d
                    return d
        return 0

    def flow(self, s, t):
        flow = 0
        INF = 10**9 + 7
        G = self.G
        while self.bfs(s, t):
            *self.it, = map(iter, self.G)
            f = INF
            while f:
                f = self.dfs(s, t, INF)
                flow += f
        return flow

import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import log,gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

S = set([1<<i for i in range(31)])

N = int(input())
A = li()

G = Dinic(N+2)
for i in range(N):
    if bin(A[i]).count("1")&1:
        G.add_edge(N,i,1)
    else:
        G.add_edge(i,N+1,1)

for i in range(N):
    t = bin(A[i]).count("1")
    for j in range(N):
        if A[i]^A[j] in S:
            if t&1:
                G.add_edge(i,j,1)

F = G.flow(N,N+1)
print(N-F)
0