結果

問題 No.1226 I hate Robot Arms
ユーザー mkawa2mkawa2
提出日時 2021-07-16 17:55:04
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,569 ms / 2,000 ms
コード長 4,728 bytes
コンパイル時間 264 ms
コンパイル使用メモリ 87,376 KB
実行使用メモリ 146,608 KB
最終ジャッジ日時 2023-09-20 09:11:11
合計ジャッジ時間 39,420 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 170 ms
81,200 KB
testcase_01 AC 174 ms
81,180 KB
testcase_02 AC 845 ms
100,300 KB
testcase_03 AC 874 ms
104,688 KB
testcase_04 AC 917 ms
120,616 KB
testcase_05 AC 829 ms
118,172 KB
testcase_06 AC 1,534 ms
143,408 KB
testcase_07 AC 820 ms
100,272 KB
testcase_08 AC 535 ms
109,032 KB
testcase_09 AC 1,151 ms
114,548 KB
testcase_10 AC 483 ms
89,148 KB
testcase_11 AC 945 ms
121,236 KB
testcase_12 AC 720 ms
106,108 KB
testcase_13 AC 627 ms
109,904 KB
testcase_14 AC 1,284 ms
118,452 KB
testcase_15 AC 436 ms
105,048 KB
testcase_16 AC 1,517 ms
143,288 KB
testcase_17 AC 763 ms
101,928 KB
testcase_18 AC 601 ms
96,936 KB
testcase_19 AC 970 ms
123,476 KB
testcase_20 AC 923 ms
120,844 KB
testcase_21 AC 1,149 ms
127,792 KB
testcase_22 AC 1,565 ms
145,628 KB
testcase_23 AC 1,529 ms
145,232 KB
testcase_24 AC 1,561 ms
146,172 KB
testcase_25 AC 1,544 ms
145,772 KB
testcase_26 AC 1,569 ms
146,608 KB
testcase_27 AC 1,356 ms
137,048 KB
testcase_28 AC 1,423 ms
135,644 KB
testcase_29 AC 1,412 ms
136,300 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
md = 998244353
# md = 10**9+7

import typing

class SegTree:
    def __init__(self,
                 op: typing.Callable[[typing.Any, typing.Any], typing.Any],
                 e: typing.Any,
                 v: typing.Union[int, typing.List[typing.Any]]) -> None:
        self._op = op
        self._e = e

        if isinstance(v, int):
            v = [e]*v

        self._n = len(v)
        self._log = (self._n-1).bit_length()
        self._size = 1 << self._log
        self._d = [e]*(2*self._size)

        for i in range(self._n):
            self._d[self._size+i] = v[i]
        for i in range(self._size-1, 0, -1):
            self._update(i)

    def set(self, p: int, x: typing.Any) -> None:
        assert 0 <= p < self._n

        p += self._size
        self._d[p] = x
        for i in range(1, self._log+1):
            self._update(p >> i)

    def get(self, p: int) -> typing.Any:
        assert 0 <= p < self._n

        return self._d[p+self._size]

    def prod(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n
        sml = self._e
        smr = self._e
        left += self._size
        right += self._size

        while left < right:
            if left & 1:
                sml = self._op(sml, self._d[left])
                left += 1
            if right & 1:
                right -= 1
                smr = self._op(self._d[right], smr)
            left >>= 1
            right >>= 1

        return self._op(sml, smr)

    def all_prod(self) -> typing.Any:
        return self._d[1]

    def max_right(self, left: int,
                  f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= left <= self._n
        assert f(self._e)

        if left == self._n:
            return self._n

        left += self._size
        sm = self._e

        first = True
        while first or (left & -left) != left:
            first = False
            while left%2 == 0:
                left >>= 1
            if not f(self._op(sm, self._d[left])):
                while left < self._size:
                    left *= 2
                    if f(self._op(sm, self._d[left])):
                        sm = self._op(sm, self._d[left])
                        left += 1
                return left-self._size
            sm = self._op(sm, self._d[left])
            left += 1

        return self._n

    def min_left(self, right: int,
                 f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= right <= self._n
        assert f(self._e)

        if right == 0:
            return 0

        right += self._size
        sm = self._e

        first = True
        while first or (right & -right) != right:
            first = False
            right -= 1
            while right > 1 and right%2:
                right >>= 1
            if not f(self._op(self._d[right], sm)):
                while right < self._size:
                    right = 2*right+1
                    if f(self._op(self._d[right], sm)):
                        sm = self._op(self._d[right], sm)
                        right -= 1
                return right+1-self._size
            sm = self._op(self._d[right], sm)

        return 0

    def _update(self, k: int) -> None:
        self._d[k] = self._op(self._d[2*k], self._d[2*k+1])

from math import sin, cos, pi, atan2, radians, degrees

n, q = LI()
def op(L, R):
    d0, rad0, s0 = L
    d1, rad1, s1 = R
    x = d0*cos(rad0)+d1*cos(s0+rad1)
    y = d0*sin(rad0)+d1*sin(s0+rad1)
    rad = atan2(y, x)
    d = (x**2+y**2)**0.5
    return d, rad, s0+s1

e = (0, 0, 0)

seg = SegTree(op, e, [(1, 0, 0) for _ in range(n)])

for _ in range(q):
    tix = LI()
    if tix[0] == 0:
        _, i, x = tix
        i -= 1
        d, _, _ = seg.get(i)
        rad = radians(x)
        seg.set(i, (d, rad, rad))

    elif tix[0] == 1:
        _, i, x = tix
        i -= 1
        _, rad, _ = seg.get(i)
        seg.set(i, (x, rad, rad))

    else:
        _, i = tix
        d, rad, _ = seg.prod(0, i)
        # print(i, d, degrees(rad))
        x = d*cos(rad)
        y = d*sin(rad)
        print("{:.6f} {:.6f}".format(x, y))
0