結果

問題 No.1226 I hate Robot Arms
ユーザー tyawanmusityawanmusi
提出日時 2020-08-30 02:18:32
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,211 ms / 2,000 ms
コード長 4,161 bytes
コンパイル時間 320 ms
コンパイル使用メモリ 87,088 KB
実行使用メモリ 121,932 KB
最終ジャッジ日時 2023-08-30 09:36:32
合計ジャッジ時間 25,782 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 74 ms
71,780 KB
testcase_01 AC 76 ms
71,936 KB
testcase_02 AC 633 ms
89,064 KB
testcase_03 AC 607 ms
93,344 KB
testcase_04 AC 713 ms
103,628 KB
testcase_05 AC 659 ms
101,680 KB
testcase_06 AC 1,131 ms
118,896 KB
testcase_07 AC 548 ms
90,364 KB
testcase_08 AC 434 ms
93,720 KB
testcase_09 AC 851 ms
100,088 KB
testcase_10 AC 394 ms
84,668 KB
testcase_11 AC 734 ms
102,252 KB
testcase_12 AC 565 ms
95,036 KB
testcase_13 AC 525 ms
96,112 KB
testcase_14 AC 920 ms
103,004 KB
testcase_15 AC 358 ms
91,976 KB
testcase_16 AC 1,065 ms
120,932 KB
testcase_17 AC 540 ms
90,928 KB
testcase_18 AC 477 ms
89,356 KB
testcase_19 AC 733 ms
105,284 KB
testcase_20 AC 729 ms
105,376 KB
testcase_21 AC 800 ms
106,712 KB
testcase_22 AC 1,114 ms
121,824 KB
testcase_23 AC 1,145 ms
121,932 KB
testcase_24 AC 1,158 ms
121,264 KB
testcase_25 AC 1,166 ms
121,460 KB
testcase_26 AC 1,149 ms
121,700 KB
testcase_27 AC 1,175 ms
120,920 KB
testcase_28 AC 1,211 ms
120,592 KB
testcase_29 AC 1,156 ms
121,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from math import cos, sin, radians
import sys
input = lambda: sys.stdin.readline().rstrip()

# SegmentTree
class SegmentTree:

  def __init__(self, n, p, unit, f, g, h):
    num = 2**((n-1).bit_length())
    seg = [unit]*(num*2)
    self.lazy = [None]*(num*2)
    for i in range(n):
      seg[num+i] = p[i]
    for i in range(num-1, 0, -1):
      seg[i] = f(seg[i << 1], seg[(i << 1)+1])
    self.num = num
    self.seg = seg
    self.unit = unit
    self.flag = False
    self.f = f
    self.g = g
    self.h = h

  def gindex(self, l, r):
    l += self.num
    r += self.num
    lm = (l//(l & -l)) >> 1
    rm = (r//(r & -r)) >> 1
    mm = max(lm, rm)
    r -= 1
    while l < r:
      if r <= rm:
        yield r
      if l <= lm:
        yield l
      l >>= 1
      r >>= 1
    while l:
      if l <= mm:
        yield l
      l >>= 1

  def propagates(self, ids):
    num = self.num
    g = self.g
    h = self.h
    for i in reversed(ids):
      v = self.lazy[i]
      if v is None:
        continue
      # ここ！！！！！！！！！！！！！
      # ここ！！！！！！！！！！！！！

      newv = v

      # ここ！！！！！！！！！！！！！
      # ここ！！！！！！！！！！！！！
      if (i << 1) < num:
        self.lazy[i << 1] = h(self.lazy[i << 1], newv)
        self.lazy[(i << 1)+1] = h(self.lazy[(i << 1)+1], newv)
      self.seg[i << 1] = g(self.seg[i << 1], newv)
      self.seg[(i << 1)+1] = g(self.seg[(i << 1)+1], newv)
      self.lazy[i] = None

  def query(self, l, r):
    f = self.f
    if self.flag:
      *ids, = self.gindex(l, r)
      self.propagates(ids)
    ansl = ansr = self.unit
    l += self.num
    r += self.num-1
    if l == r:
      return self.seg[l]
    while l < r:
      if l & 1:
        ansl = f(ansl, self.seg[l])
        l += 1
      if r & 1 == 0:
        ansr = f(self.seg[r], ansr)
        r -= 1
      l >>= 1
      r >>= 1
    if l == r:
      ansl = f(ansl, self.seg[l])
    return f(ansl, ansr)

  def update1(self, i, x):
    if self.flag:
      *ids, = self.gindex(i, i+1)
      self.propagates(ids)
    i += self.num
    f = self.f
    # 変更済み
    self.seg[i] = (self.seg[i][0]*x,self.seg[i][1]*x)
    while i:
      i >>= 1
      self.seg[i] = f(self.seg[i << 1], self.seg[(i << 1)+1])

  def update2(self, l, r, x):
    self.flag = True
    *ids, = self.gindex(l, r)
    self.propagates(ids)
    num = self.num
    f = self.f
    g = self.g
    h = self.h
    l += num
    r += num-1
    if l == r:
      self.seg[l] = g(self.seg[l], x)
      for i in ids:
        self.seg[i] = f(self.seg[i << 1], self.seg[(i << 1)+1])
      return
    while l < r:
      if l & 1:
        if l < num:
          self.lazy[l] = h(self.lazy[l], x)
        self.seg[l] = g(self.seg[l], x)
        l += 1
      if r & 1 == 0:
        if r < num:
          self.lazy[r] = h(self.lazy[r], x)
        self.seg[r] = g(self.seg[r], x)
        r -= 1
      l >>= 1
      r >>= 1
      # 変更済み
      x = x
    if l == r:
      self.lazy[l] = h(self.lazy[l], x)
      self.seg[l] = g(self.seg[l], x)
    for i in ids:
      self.seg[i] = f(self.seg[i << 1], self.seg[(i << 1)+1])
  
  def update(self, i, x):
    if type(i) is int:
      self.update1(i, x)
    else:
      self.update2(i[0], i[1], x)

def f(x, y):
  return (x[0]+y[0], x[1]+y[1])
def g(x, y):
  a = rotate[y]
  return (x[0]*a[0][0] + x[1]*a[0][1], x[0]*a[1][0] + x[1]*a[1][1])
def h(x,y):
  if x is None:
    return y
  return (x+y) % 360

n, q = map(int, input().split())

num = 2**((n-1).bit_length())
rotate = [None]*360
for i in range(360):
  rotate[i]=(
    (cos(radians(i)), -sin(radians(i))),
    (sin(radians(i)), cos(radians(i)))
  )

seg = SegmentTree(n, [(1, 0)]*n, (0, 0), f, g, h)
theta = [0]*n
length = [1]*n

for _ in range(q):
  query = tuple(map(int, input().split()))

  if query[0] == 0:
    _, i, x=query

    seg.update((i-1, n), (x-theta[i-1]) % 360)
    theta[i-1] = x

  elif query[0] == 1:
    _, i, x = query

    seg.update(i-1, x/length[i-1])
    length[i-1] = x
  
  else:
    _, i = query

    x, y = seg.query(0, i)
    print('{:.9f}'.format(x), '{:.9f}'.format(y))
0