結果
| 問題 |
No.2643 Many Range Sums Problems
|
| コンテスト | |
| ユーザー |
shobonvip
|
| 提出日時 | 2024-02-13 15:06:31 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 681 ms / 8,000 ms |
| コード長 | 2,295 bytes |
| コンパイル時間 | 271 ms |
| コンパイル使用メモリ | 82,136 KB |
| 実行使用メモリ | 77,380 KB |
| 最終ジャッジ日時 | 2024-09-28 18:29:30 |
| 合計ジャッジ時間 | 11,347 ms |
|
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| other | AC * 34 |
ソースコード
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n")+(not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s:self.buffer.write(s.encode("ascii"))
self.read = lambda:self.buffer.read().decode("ascii")
self.readline = lambda:self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda:sys.stdin.readline().rstrip("\r\n")
n, k = map(int,input().split())
r = [0] * n
x = [0] * n
for i in range(n):
r[i], x[i] = map(int,input().split())
tmp_x = x[::]
tmp_v = [0] * n
tmp_rx = [0] * (n + 1)
tmp_rv = [0] * (n + 1)
for st in range(n):
tmp_x[st] = 0
tmp_v[st] = 1
mode = 1
m_lb = - 10 ** 18
m_ub = 10 ** 18
for i in range(n-1,-1,-1):
tmp_rx[i] = tmp_rx[r[i]] + tmp_x[i]
tmp_rv[i] = tmp_rv[r[i]] + tmp_v[i]
tar_x = tmp_rx[i] - tmp_rx[i+1]
tar_v = tmp_rv[i] - tmp_rv[i+1]
# 0 <= tar_x + tar_v * M <= K
if tar_v == 0:
if not 0 <= tar_x <= k:
mode = 0
elif tar_v == 1:
m_lb = max(m_lb, - tar_x)
m_ub = min(m_ub, k - tar_x)
else:
m_lb = max(m_lb, tar_x - k)
m_ub = min(m_ub, tar_x)
if not m_lb <= m_ub:
mode = 0
if mode:
print("Yes")
else:
print("No")
tmp_x[st] = x[st]
tmp_v[st] = 0
shobonvip