結果
| 問題 | No.1900 Don't be Powers of 2 |
| ユーザー |
 とりゐ
|
| 提出日時 | 2022-04-08 23:11:54 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 6,678 bytes |
| コンパイル時間 | 316 ms |
| コンパイル使用メモリ | 82,432 KB |
| 実行使用メモリ | 361,440 KB |
| 最終ジャッジ日時 | 2024-05-06 08:57:02 |
| 合計ジャッジ時間 | 38,355 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 38 ms
53,620 KB |
| testcase_01 | AC | 43 ms
52,992 KB |
| testcase_02 | AC | 39 ms
53,376 KB |
| testcase_03 | AC | 1,320 ms
77,824 KB |
| testcase_04 | AC | 1,312 ms
77,732 KB |
| testcase_05 | AC | 1,319 ms
77,696 KB |
| testcase_06 | AC | 1,315 ms
77,696 KB |
| testcase_07 | AC | 1,308 ms
77,692 KB |
| testcase_08 | AC | 376 ms
79,420 KB |
| testcase_09 | AC | 233 ms
78,428 KB |
| testcase_10 | AC | 122 ms
76,800 KB |
| testcase_11 | AC | 161 ms
77,900 KB |
| testcase_12 | AC | 484 ms
80,640 KB |
| testcase_13 | AC | 80 ms
76,032 KB |
| testcase_14 | AC | 916 ms
77,388 KB |
| testcase_15 | AC | 78 ms
75,888 KB |
| testcase_16 | AC | 77 ms
76,288 KB |
| testcase_17 | AC | 1,203 ms
77,824 KB |
| testcase_18 | AC | 972 ms
77,452 KB |
| testcase_19 | AC | 1,309 ms
77,696 KB |
| testcase_20 | AC | 927 ms
77,508 KB |
| testcase_21 | AC | 882 ms
77,688 KB |
| testcase_22 | AC | 843 ms
77,312 KB |
| testcase_23 | AC | 371 ms
77,440 KB |
| testcase_24 | AC | 536 ms
77,156 KB |
| testcase_25 | AC | 690 ms
77,444 KB |
| testcase_26 | TLE | - |
| testcase_27 | AC | 851 ms
120,160 KB |
| testcase_28 | AC | 632 ms
82,944 KB |
| testcase_29 | AC | 584 ms
83,016 KB |
| testcase_30 | AC | 119 ms
77,048 KB |
| testcase_31 | AC | 39 ms
52,864 KB |
| testcase_32 | AC | 40 ms
53,120 KB |
| testcase_33 | TLE | - |
| testcase_34 | TLE | - |
| testcase_35 | TLE | - |
| testcase_36 | AC | 1,902 ms
297,744 KB |
| testcase_37 | AC | 794 ms
82,048 KB |
| testcase_38 | AC | 737 ms
154,456 KB |
| testcase_39 | AC | 492 ms
107,928 KB |
| testcase_40 | AC | 1,353 ms
78,848 KB |
| testcase_41 | AC | 1,327 ms
82,132 KB |
| testcase_42 | AC | 39 ms
52,992 KB |
| testcase_43 | AC | 39 ms
53,248 KB |
| testcase_44 | AC | 43 ms
52,736 KB |
ソースコード
class mf_graph:
"""It solves maximum flow problem.
"""
def __init__(self, n):
"""It creates a graph of n vertices and 0 edges.
Constraints
-----------
> 0 <= n <= 10 ** 8
Complexity
----------
> O(n)
"""
self.n = n
self.g = [[] for _ in range(self.n)]
self.pos = []
def add_edge(self, from_, to, cap):
"""It adds an edge oriented from the vertex `from_` to the vertex `to`
with the capacity `cap` and the flow amount 0.
It returns an integer k such that this is the k-th edge that is added.
Constraints
-----------
> 0 <= from_, to < n
> 0 <= cap
Complexity
----------
> O(1) amortized
"""
# assert 0 <= from_ < self.n
# assert 0 <= to < self.n
# assert 0 <= cap
m = len(self.pos)
self.pos.append((from_, len(self.g[from_])))
self.g[from_].append(self.__class__._edge(to, len(self.g[to]), cap))
self.g[to].append(self.__class__._edge(from_, len(self.g[from_]) - 1, 0))
return m
class edge:
def __init__(self, from_, to, cap, flow):
self.from_ = from_
self.to = to
self.cap = cap
self.flow = flow
def get_edge(self, i):
"""It returns the current internal state of the edges.
The edges are ordered in the same order as added by add_edge.
Complexity
----------
> O(1)
"""
# assert 0 <= i < len(self.pos)
_e = self.g[self.pos[i][0]][self.pos[i][1]]
_re = self.g[_e.to][_e.rev]
return self.__class__.edge(self.pos[i][0], _e.to, _e.cap + _re.cap, _re.cap)
def edges(self):
"""It returns the current internal state of the edges.
The edges are ordered in the same order as added by add_edge.
Complexity
----------
> O(m), where m is the number of added edges.
"""
result = []
for i in range(len(self.pos)):
_e = self.g[self.pos[i][0]][self.pos[i][1]]
_re = self.g[_e.to][_e.rev]
result.append(self.__class__.edge(self.pos[i][0], _e.to, _e.cap + _re.cap, _re.cap))
return result
def change_edge(self, i, new_cap, new_flow):
"""It changes the capacity and the flow amount of the ii-th edge to new_cap and new_flow, respectively. It doesn't change the capacity or the flow amount of other edges. See Appendix for further details.
Constraints
-----------
> 0 <= newflow <= newcap
Complexity
----------
> O(1)
"""
# assert 0 <= i < len(self.pos)
# assert 0 <= new_flow <= new_cap
_e = self.g[self.pos[i][0]][self.pos[i][1]]
_re = self.g[_e.to][_e.rev]
_e.cap = new_cap - new_flow
_re.cap = new_flow
def _bfs(self, s, t):
self.level = [-1] * self.n
self.level[s] = 0
q = [s]
while q:
nq = []
for v in q:
for e in self.g[v]:
if e.cap and self.level[e.to] == -1:
self.level[e.to] = self.level[v] + 1
if e.to == t:
return True
nq.append(e.to)
q = nq
return False
def _dfs(self, s, t, up):
st = [t]
while st:
v = st[-1]
if v == s:
st.pop()
flow = up
for w in st:
e = self.g[w][self.it[w]]
flow = min(flow, self.g[e.to][e.rev].cap)
for w in st:
e = self.g[w][self.it[w]]
e.cap += flow
self.g[e.to][e.rev].cap -= flow
return flow
while self.it[v] < len(self.g[v]):
e = self.g[v][self.it[v]]
w = e.to
cap = self.g[e.to][e.rev].cap
if cap and self.level[v] > self.level[w]:
st.append(w)
break
self.it[v] += 1
else:
st.pop()
self.level[v] = self.n
return 0
def flow(self, s, t, flow_limit=float('inf')):
"""It augments the flow from s to t as much as possible.
It returns the amount of the flow augmented.
You may call it multiple times.
See Appendix in the document of AC Library for further details.
Constraints
-----------
> s != t
Complexity
----------
> O(min(n^(2/3)m, m^(3/2))) (if all the capacities are 1) or
> O(n^2 m) (general),
where m is the number of added edges.
"""
# assert 0 <= s < self.n
# assert 0 <= t < self.n
# assert s != t
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 not f:
break
flow += f
return flow
def min_cut(self, s):
"""It returns a vector of length n,
such that the i-th element is true if and only if there is a directed path from s to i in the residual network.
The returned vector corresponds to a s−t minimum cut after calling flow(s, t) exactly once without flow_limit.
See Appendix in the document of AC Library for further details.
Complexity
----------
> O(n + m), where m is the number of added edges.
"""
visited = [False] * self.n
q = [s]
while q:
nq = []
for p in q:
visited[p] = True
for e in self.g[p]:
if e.cap and not visited[e.to]:
nq.append(e.to)
q = nq
return visited
class _edge:
def __init__(self, to, rev, cap):
self.to = to
self.rev = rev
self.cap = cap
def popcount(m):
return bin(m).count('1')
n=int(input())
a=list(map(int,input().split()))
s,t=n,n+1
g=mf_graph(n+2)
inf=min(n,100)
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))