結果

問題 No.675 ドットちゃんたち
ユーザー むらためむらため
提出日時 2019-02-03 22:24:53
言語 Nim
(2.0.2)
結果
AC  
実行時間 27 ms / 2,000 ms
コード長 3,082 bytes
コンパイル時間 2,691 ms
コンパイル使用メモリ 77,464 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-01 11:17:31
合計ジャッジ時間 3,961 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 1 ms
6,944 KB
testcase_05 AC 21 ms
6,940 KB
testcase_06 AC 25 ms
6,940 KB
testcase_07 AC 23 ms
6,944 KB
testcase_08 AC 23 ms
6,944 KB
testcase_09 AC 27 ms
6,940 KB
testcase_10 AC 25 ms
6,940 KB
testcase_11 AC 26 ms
6,944 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(4, 1) Warning: template 'stopwatch' is implicitly redefined; this is deprecated, add an explicit .redefine pragma [ImplicitTemplateRedefinition]
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'sequtils' [UnusedImport]

ソースコード

diff # 

import sequtils,times
proc printf(formatstr: cstring){.header: "<stdio.h>", varargs.}
template stopwatch(body) = (let t1 = cpuTime();body;echo "TIME:",(cpuTime() - t1) * 1000,"ms")
template stopwatch(body) = body
template `+=`(x,y) = x = x + y

# GC_disableMarkAndSweep()

template useMatrix =
  type Matrix[T] = ref object
    w,h:int
    data: seq[T]
  proc `[]`[T](m:var Matrix[T],x,y:int):var T {.inline.} = m.data[x + y * m.w]
  proc `[]=`[T](m:var Matrix[T],x,y:int,val:T) {.inline.} = m.data[x + y * m.w] = val
  proc newMatrix[T](w,h:int):Matrix[T] =
    new(result)
    result.w = w
    result.h = h
    result.data = newSeq[T](w * h)
  proc identityMatrix[T](n:int):Matrix[T] =
    result = newMatrix[T](n,n)
    for i in 0..<n: result[i,i] = 1
  proc newMatrix[T](arr:seq[seq[T]]):Matrix[T] =
    new(result)
    result.w = arr[0].len
    result.h = arr.len
    result.data = newSeq[T](result.w * result.h)
    for x in 0..<result.w:
      for y in 0..<result.h:
        result[x,y] = arr[y][x]
  proc `*`[T](a,b:Matrix[T]): Matrix[T] =
    assert a.w == b.h
    result = newMatrix[T](a.h,b.w)
    for y in 0..<a.h:
      for x in 0..<b.w:
        var n : T
        for k in 0..<a.w:
          n += a[k,y] * b[x,k]
        result[x,y] = n

  proc `^`[T](m:Matrix[T],n:int) : Matrix[T] =
    assert m.w == m.h
    if n <= 0 : return identityMatrix[T](m.w)
    if n == 1 : return m
    let m2 = m^(n div 2)
    if n mod 2 == 0 : return m2 * m2
    return m2 * m2 * m
  proc `$`[T](m:Matrix[T]) : string =
    result = ""
    for y in 0..<m.h:
      result &= "["
      for x in 0..<m.w:
        result &= $m[x,y]
        if x != m.w - 1 : result &= ","
      result &= "]"
      if y != m.h - 1 : result &= "\n"
    result &= "\n"
  proc `*`[T](a:Matrix,b:seq[T]):seq[T] =
    assert a.w == b.len
    result = newSeq[T](b.len)
    for x in 0..<a.h:
      var n : T
      for k in 0..<a.w:
        n += a[k,x] * b[k]
      result[x] = n


useMatrix()

proc getchar_unlocked():char {. importc:"getchar_unlocked",header: "<stdio.h>" .}
proc scan(): int =
  var minus = false
  block:
    let k = getchar_unlocked()
    if k == '-' : minus = true
    else: result = 10 * result + k.ord - '0'.ord
  while true:
    let k = getchar_unlocked()
    if k < '0' or k > '9': break
    result = 10 * result + k.ord - '0'.ord
  if minus: result *= -1

stopwatch:
  let n = scan()
  let px = scan()
  let py = scan()
  var Q = newSeq[int](n)
  var V = newSeq[int](n)
  for i in 0..<n:
    Q[i] = scan()
    if Q[i] == 3 : continue
    V[i] = scan()
  var M = identityMatrix[int](3)
  var X = newSeq[int](n)
  var Y = newSeq[int](n)
stopwatch:
  let p = @[px,py,1]
  for i in (n-1).countdown(0):
    let q = Q[i]
    let v = V[i]
    if q == 3:
      for i in 0..<3:
        (M[0,i],M[1,i]) = (-M[1,i],M[0,i])
    elif q == 2:
      for i in 0..<3:
        M[2,i] += v * M[1,i]
    else:
      for i in 0..<3:
        M[2,i] += v * M[0,i]
    X[i] = M[0,0] * px + M[1,0] * py + M[2,0]
    Y[i] = M[0,1] * px + M[1,1] * py + M[2,1]
stopwatch:
  for i in 0..<n: printf("%d %d\n",X[i],Y[i])
0