#377053 (Nim) No.876 Range Compress Query

• 問題: No.876 Range Compress Query
• ユーザー: むらため
• 提出日時: 2019-09-07 08:34:08
• 言語: Nim (2.0.2)
• 結果: WA
• 実行時間: -
• コード長: 1,559 bytes
• コンパイル時間: 2,395 ms
• コンパイル使用メモリ: 61,372 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-02 16:07:10
• 合計ジャッジ時間: 3,626 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	WA	-
testcase_08	AC	2 ms; 5,376 KB
testcase_09	WA	-
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	81 ms; 5,376 KB
testcase_12	AC	69 ms; 5,376 KB
testcase_13	AC	74 ms; 5,376 KB
testcase_14	AC	82 ms; 5,376 KB
testcase_15	AC	55 ms; 5,376 KB
testcase_16	AC	73 ms; 5,376 KB
testcase_17	AC	75 ms; 5,376 KB
testcase_18	AC	87 ms; 5,376 KB

コンパイルメッセージ

/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'sequtils' [UnusedImport]

ソースコード

import sequtils
template times*(n:int,body) = (for _ in 0..<n: body)
proc getchar_unlocked():char {. importc:"getchar_unlocked",header: "<stdio.h>",discardable .}
proc scan(): int =
  while true:
    var k = getchar_unlocked()
    if k < '0' or k > '9': break
    result = 10 * result + k.ord - '0'.ord

type BinaryIndexedTree[T] = ref object
  data: seq[T]
proc newBinaryIndexedTree[T](n:int):BinaryIndexedTree[T] =
  new(result)
  result.data = newSeq[T](n)
proc len[T](self:BinaryIndexedTree[T]): int = self.data.len()
proc plus[T](self:var BinaryIndexedTree[T],i:int,val:T) =
  var i = i
  while i < self.len():
    self.data[i] += val
    i = i or (i + 1)
proc `[]`[T](self:BinaryIndexedTree[T],i:int): T =
  var i = i
  while i >= 0:
    result += self.data[i]
    i = (i and (i + 1)) - 1
proc `$`[T](self:BinaryIndexedTree[T]): string =
  result = "["
  for i in 0..<self.len.min(100): result &= $(self[i]) & ", "
  return result[0..result.len()-2] & (if self.len > 100 : " ...]" else: "]")


let n = scan()
let q = scan()
var A = newSeq[int](n+2)
var B = newSeq[int](n+2)
var bit = newBinaryIndexedTree[int](n+2)
for i in 1..n: A[i] = scan()
for i in 1..n:
  B[i] = A[i+1] - A[i]
  if B[i] != 0 : bit.plus i, 1
q.times:
  if scan() == 1:
    let (l,r,x) = (scan()-1,scan(),scan())
    if l >= 1:
      if B[l] != 0: bit.plus l, -1
      B[l] += x
      if B[l] != 0: bit.plus l,  1
    if r < n:
      if B[r] != 0: bit.plus r, -1
      B[r] += x
      if B[r] != 0: bit.plus r,  1
  else:
    let (l,r) = (scan()-1,scan()-1)
    echo bit[r]-bit[l]+1