結果
| 問題 | No.2687 所により大雨 |
| ユーザー |
 とりゐ
|
| 提出日時 | 2024-03-20 22:32:24 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 1,405 ms / 2,000 ms |
| コード長 | 4,938 bytes |
| コンパイル時間 | 464 ms |
| コンパイル使用メモリ | 81,700 KB |
| 実行使用メモリ | 105,332 KB |
| 最終ジャッジ日時 | 2024-04-04 05:28:24 |
| 合計ジャッジ時間 | 21,394 ms |
|
ジャッジサーバーID （参考情報） |
judge14 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 441 ms
89,708 KB |
| testcase_01 | AC | 444 ms
89,632 KB |
| testcase_02 | AC | 434 ms
89,636 KB |
| testcase_03 | AC | 436 ms
89,636 KB |
| testcase_04 | AC | 435 ms
89,636 KB |
| testcase_05 | AC | 62 ms
67,728 KB |
| testcase_06 | AC | 63 ms
67,728 KB |
| testcase_07 | AC | 63 ms
67,856 KB |
| testcase_08 | AC | 62 ms
67,728 KB |
| testcase_09 | AC | 62 ms
67,728 KB |
| testcase_10 | AC | 1,355 ms
105,204 KB |
| testcase_11 | AC | 1,313 ms
105,208 KB |
| testcase_12 | AC | 1,358 ms
105,208 KB |
| testcase_13 | AC | 1,366 ms
105,208 KB |
| testcase_14 | AC | 1,347 ms
105,200 KB |
| testcase_15 | AC | 1,336 ms
105,200 KB |
| testcase_16 | AC | 1,385 ms
105,208 KB |
| testcase_17 | AC | 1,399 ms
105,204 KB |
| testcase_18 | AC | 1,405 ms
105,332 KB |
| testcase_19 | AC | 1,332 ms
105,208 KB |
| testcase_20 | AC | 65 ms
67,856 KB |
| testcase_21 | AC | 65 ms
67,728 KB |
| testcase_22 | AC | 65 ms
67,856 KB |
| testcase_23 | AC | 66 ms
67,856 KB |
| testcase_24 | AC | 195 ms
78,668 KB |
| testcase_25 | AC | 202 ms
78,816 KB |
| testcase_26 | AC | 199 ms
78,792 KB |
| testcase_27 | AC | 202 ms
78,792 KB |
| testcase_28 | AC | 219 ms
79,468 KB |
ソースコード
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
T = TypeVar('T')
class SortedSet(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a=None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = self.size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
a = list(a)
if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):
a = sorted(set(a))
self._build(a)
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 __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedSet" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _find_bucket(self, x: T) -> List[T]:
"Find the bucket which should contain x. self must not be empty."
for a in self.a:
if x <= a[-1]: return a
return a
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a = self._find_bucket(x)
i = bisect_left(a, x)
return i != len(a) and a[i] == x
def add(self, x: T) -> bool:
"Add an element and return True if added. / O(√N)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return True
a = self._find_bucket(x)
i = bisect_left(a, x)
if i != len(a) and a[i] == x: return False
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
return True
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(√N)"
if self.size == 0: return False
a = self._find_bucket(x)
i = bisect_left(a, x)
if i == len(a) or a[i] != x: return False
a.pop(i)
self.size -= 1
if len(a) == 0: self._build()
return True
def lt(self, x: T) -> Union[T, None]:
"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) -> Union[T, None]:
"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) -> Union[T, None]:
"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) -> Union[T, None]:
"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, x: int) -> T:
"Return the x-th element, or IndexError if it doesn't exist."
if x < 0: x += self.size
if x < 0: raise IndexError
for a in self.a:
if x < len(a): return a[x]
x -= 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
n,m=map(int,input().split())
LR=[]
for i in range(n):
L,R=map(int,input().split())
LR.append([L,R])
flag=0
LR.sort()
for i in range(n-1):
if LR[i][1]>=LR[i+1][0]:
flag=1
LR2=[]
for i in range(m):
L,R=map(int,input().split())
LR2.append([L,R])
LR2.sort()
for i in range(m-1):
if LR2[i][1]>=LR2[i+1][0]:
flag=1
k=int(input())
if flag:
print(*[1]*k)
exit()
S=SortedSet()
d={}
for L,R in LR:
d[L]=R
S.add(L)
ans=[]
for p in list(map(int,input().split())):
for l2,r2 in LR2:
tL=l2-p
tR=r2-p
Lpos=p-tR
Rpos=p-tL
flag=0
X=S.le(Lpos)
if X!=None and d[X]>=Lpos:
flag=1
else:
Y=S.ge(Lpos)
if Y!=None and Lpos<=Y<=Rpos:
flag=1
if flag:
ans.append(1)
break
else:
ans.append(0)
print(*ans)