結果
| 問題 | No.2731 Two Colors |
| ユーザー |
 PNJ
|
| 提出日時 | 2024-04-19 23:27:50 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 5,500 bytes |
| コンパイル時間 | 367 ms |
| コンパイル使用メモリ | 82,304 KB |
| 実行使用メモリ | 131,108 KB |
| 最終ジャッジ日時 | 2024-04-19 23:28:40 |
| 合計ジャッジ時間 | 38,741 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge6 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2,390 ms
122,156 KB |
| testcase_01 | AC | 2,404 ms
122,176 KB |
| testcase_02 | AC | 2,463 ms
121,924 KB |
| testcase_03 | AC | 136 ms
79,488 KB |
| testcase_04 | AC | 203 ms
80,876 KB |
| testcase_05 | AC | 211 ms
81,092 KB |
| testcase_06 | AC | 498 ms
88,124 KB |
| testcase_07 | AC | 338 ms
85,876 KB |
| testcase_08 | AC | 173 ms
80,468 KB |
| testcase_09 | AC | 1,192 ms
105,972 KB |
| testcase_10 | AC | 140 ms
79,744 KB |
| testcase_11 | TLE | - |
| testcase_12 | AC | 1,091 ms
104,992 KB |
| testcase_13 | AC | 2,544 ms
120,756 KB |
| testcase_14 | AC | 569 ms
92,160 KB |
| testcase_15 | AC | 195 ms
80,748 KB |
| testcase_16 | AC | 961 ms
97,412 KB |
| testcase_17 | AC | 1,056 ms
102,288 KB |
| testcase_18 | AC | 289 ms
83,156 KB |
| testcase_19 | AC | 1,063 ms
100,316 KB |
| testcase_20 | AC | 555 ms
93,460 KB |
| testcase_21 | AC | 309 ms
84,032 KB |
| testcase_22 | AC | 1,943 ms
116,836 KB |
| testcase_23 | AC | 531 ms
90,012 KB |
| testcase_24 | AC | 310 ms
84,464 KB |
| testcase_25 | AC | 136 ms
79,232 KB |
| testcase_26 | AC | 1,141 ms
104,148 KB |
| testcase_27 | AC | 1,623 ms
111,304 KB |
| testcase_28 | AC | 1,496 ms
108,960 KB |
| testcase_29 | AC | 453 ms
88,392 KB |
| testcase_30 | AC | 570 ms
91,396 KB |
| testcase_31 | AC | 602 ms
91,332 KB |
| testcase_32 | TLE | - |
| testcase_33 | AC | 57 ms
67,456 KB |
| testcase_34 | AC | 56 ms
67,712 KB |
| testcase_35 | AC | 55 ms
67,584 KB |
ソースコード
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedList(Generic[T]):
BUCKET_RATIO = 16
SPLIT_RATIO = 24
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
n = self.size = len(a)
if any(a[i] > a[i + 1] for i in range(n - 1)):
a.sort()
num_bucket = int(math.ceil(math.sqrt(n / self.BUCKET_RATIO)))
self.a = [a[n * i // num_bucket : n * (i + 1) // num_bucket] for i in range(num_bucket)]
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedMultiset" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int, int]:
"return the bucket, index of the bucket and position in which x should be. self must not be empty."
for i, a in enumerate(self.a):
if x <= a[-1]: break
return (a, i, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, _, i = self._position(x)
return i != len(a) and a[i] == x
def count(self, x: T) -> int:
"Count the number of x."
return self.index_right(x) - self.index(x)
def add(self, x: T) -> None:
"Add an element. / O(√N)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return
a, b, i = self._position(x)
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.SPLIT_RATIO:
mid = len(a) >> 1
self.a[b:b+1] = [a[:mid], a[mid:]]
def _pop(self, a: List[T], b: int, i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: del self.a[b]
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(√N)"
if self.size == 0: return False
a, b, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, b, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for b, a in enumerate(reversed(self.a)):
i += len(a)
if i >= 0: return self._pop(a, ~b, i)
else:
for b, a in enumerate(self.a):
if i < len(a): return self._pop(a, b, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
H,W = map(int,input().split())
A = [list(map(int,input().split())) for i in range(H)]
P = SortedList()
Q = SortedList()
C = [[-1 for j in range(W+1)] for i in range(H+1)]
C[0][0] = 1
C[H-1][W-1] = 0
P.add((-A[0][1],0,1))
P.add((-A[1][0],1,0))
Q.add((-A[H-1][W-2],H-1,W-2))
Q.add((-A[H-2][W-1],H-2,W-1))
D = [(1,0),(-1,0),(0,-1),(0,1)]
ans = 0
for _ in range(H*W):
ans += 1
if ans % 2:
a,i,j = P.pop()
while C[i][j] != -1:
a,i,j = P.pop()
else:
a,i,j = Q.pop()
while C[i][j] != -1:
a,i,j = Q.pop()
C[i][j] = ans % 2
for dx,dy in D:
if C[i+dx][j+dy] == (ans + 1) % 2:
print(ans)
exit()
if C[i+dx][j+dy] == -1:
if 0 <= i + dx < H and 0 <= j + dy < W:
if ans % 2:
P.add((-A[i+dx][j+dy],i+dx,j+dy))
else:
Q.add((-A[i+dx][j+dy],i+dx,j+dy))