結果
問題 | No.1226 I hate Robot Arms |
ユーザー |
|
提出日時 | 2020-09-12 08:38:33 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 939 ms / 2,000 ms |
コード長 | 2,076 bytes |
コンパイル時間 | 152 ms |
コンパイル使用メモリ | 82,760 KB |
実行使用メモリ | 119,064 KB |
最終ジャッジ日時 | 2025-01-01 23:44:10 |
合計ジャッジ時間 | 24,011 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 28 |
ソースコード
from math import sin, cos, pip = pi / 180class SegmentTree:def __init__(self, a, func=max, one=-10 ** 18):self.logn = (len(a) - 1).bit_length()self.n = 1 << self.lognself.func = funcself.one = oneself.b = [self.one] * (2 * self.n - 1)for i, j in enumerate(a):self.b[i + self.n - 1] = jfor i in reversed(range(self.n - 1)):self.b[i] = self.func(self.b[i * 2 + 1], self.b[i * 2 + 2])def get_item(self, i):return self.b[i + self.n - 1]def update(self, index, x):i = index + self.n - 1self.b[i] = xwhile i != 0:i = (i - 1) // 2self.b[i] = self.func(self.b[i * 2 + 1], self.b[i * 2 + 2])def update_func(self, index, x):i = index + self.n - 1self.b[i] = self.func(self.b[i], x)while i != 0:i = (i - 1) // 2self.b[i] = self.func(self.b[i * 2 + 1], self.b[i * 2 + 2])def get_segment(self, l, r):l += self.nr += self.ns = self.onet = self.onewhile l < r:if l & 1:s = self.func(s, self.b[l - 1])l += 1if r & 1:r -= 1t = self.func(self.b[r - 1], t)l >>= 1r >>= 1return self.func(s, t)n, q = map(int, input().split())def merge(a, b):(x1, y1), t1 = a(x2, y2), t2 = bx = x1 + x2*cos(t1*p) - y2*sin(t1*p)y = y1 + x2*sin(t1*p) + y2 * cos(t1*p)return (x, y), t1+t2seg = SegmentTree([((1, 0), 0) for _ in range(n)], merge, [[0, 0], 0])d = [1] * nth = [0] * nfor _ in range(q):qu, *x = map(int, input().split())if qu == 2:print(*seg.get_segment(0, x[0])[0])else:a, b = xif qu == 0:th[a-1] = bc = ((d[a-1] * cos(b*p), d[a-1] * sin(b*p)), b)else:d[a-1] = be = th[a-1]c = ((b * cos(e*p), b * sin(e*p)), e)seg.update(a-1, c)