結果

問題 No.318 学学学学学
ユーザー t8m8⛄️t8m8⛄️
提出日時 2017-06-10 15:01:05
言語 Nim
(2.0.2)
結果
WA  
実行時間 -
コード長 2,919 bytes
コンパイル時間 4,098 ms
コンパイル使用メモリ 70,320 KB
実行使用メモリ 26,956 KB
最終ジャッジ日時 2023-09-12 12:58:08
合計ジャッジ時間 6,598 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 7 ms
4,692 KB
testcase_01 AC 12 ms
6,448 KB
testcase_02 AC 14 ms
6,588 KB
testcase_03 AC 11 ms
6,028 KB
testcase_04 AC 12 ms
6,436 KB
testcase_05 AC 76 ms
26,492 KB
testcase_06 AC 78 ms
24,120 KB
testcase_07 WA -
testcase_08 AC 55 ms
14,884 KB
testcase_09 AC 51 ms
15,656 KB
testcase_10 AC 45 ms
14,668 KB
testcase_11 AC 76 ms
26,248 KB
testcase_12 AC 62 ms
20,568 KB
testcase_13 AC 56 ms
17,080 KB
testcase_14 AC 50 ms
16,092 KB
testcase_15 AC 46 ms
15,972 KB
testcase_16 AC 43 ms
14,620 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 61 ms
25,252 KB
testcase_20 WA -
testcase_21 AC 1 ms
4,380 KB
testcase_22 AC 2 ms
4,380 KB
testcase_23 AC 2 ms
4,376 KB
testcase_24 AC 1 ms
4,380 KB
testcase_25 AC 2 ms
4,380 KB
testcase_26 AC 1 ms
4,380 KB
testcase_27 AC 1 ms
4,380 KB
testcase_28 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(1, 39) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated]

ソースコード

diff # 

import strutils, sequtils, algorithm, future, tables, sets

type
  PrirorityQueue*[T] = ref object of RootObj
    elms: seq[T]
    idxs: TableRef[T, int]
    cmp: (T, T) -> int

proc newPriorityQueue*[T](cmp: (T, T) -> int): PrirorityQueue[T] =
  new(result)
  result.elms = newSeq[T]()
  result.idxs = newTable[T, int]()
  result.cmp = cmp

template parent(cur: int): int =
  (cur - 1) div 2

template childl(cur: int): int =
  cur * 2 + 1

template childr(cur: int): int =
  cur * 2 + 2

proc upHeap[T](self: var PrirorityQueue[T], cur: var int) =
  var par = parent(cur)

  while par >= 0 and self.cmp(self.elms[cur], self.elms[par]) < 0:
    let (curval, parval) = (self.elms[cur], self.elms[par])
    swap(self.elms[cur], self.elms[par])
    swap(self.idxs[curval], self.idxs[parval])
    (cur, par) = (par, parent(par))

proc downHeap[T](self: var PrirorityQueue[T], cur: var int) =
  var (chl, chr) = (childl(cur), childr(cur))

  while chl < self.elms.len:
    var ch =
      if chr >= self.elms.len or self.cmp(self.elms[chl], self.elms[chr]) < 0: chl
      else: chr

    if self.cmp(self.elms[cur], self.elms[ch]) < 0:
      break

    let (curval, chval) = (self.elms[cur], self.elms[ch])
    swap(self.elms[cur], self.elms[ch])
    swap(self.idxs[curval], self.idxs[chval])
    (cur, chl, chr) = (ch, childl(cur), childr(cur))

proc len*[T](self: PrirorityQueue[T]): int =
  assert self.elms.len == self.idxs.len
  self.elms.len

proc push*[T](self: var PrirorityQueue[T], data: T): bool {.discardable.} =
  if self.idxs.contains(data):
    return false
  var
    n = self.elms.len
    cur = n
  self.elms.setLen(n + 1)
  self.elms[cur] = data
  self.idxs[data] = cur
  self.upHeap(cur)
  return true

proc peek*[T](self: var PrirorityQueue[T]): T =
  self.elms[0]

proc pop*[T](self: var PrirorityQueue[T]): T =
  assert self.elms.len > 0
  var
    n = self.elms.len
    cur = 0
  result = self.elms[0]
  self.elms[0] = self.elms[n-1]
  self.idxs[self.elms[n-1]] = 0
  self.elms.del(n-1)
  self.idxs.del(result)
  self.downHeap(cur)

proc del*[T](self: var PrirorityQueue[T], data: T) =
  if not self.idxs.contains(data):
    return
  let n = self.elms.len
  var idx = self.idxs[data]
  if idx == n - 1:
    self.idxs.del(self.elms[n-1])
    self.elms.del(n-1)
  else:
    self.idxs.del(self.elms[idx])
    self.idxs[self.elms[n-1]] = idx
    self.elms[idx] = self.elms[n-1]
    self.elms.del(n-1)
    self.downHeap(idx)
    self.upHeap(idx)

# ==============================================================================

when isMainModule:
  var
    n = stdin.readLine.parseInt
    a = stdin.readLine.split.map(parseInt)
    b = newSeq[int](n)
    lastIdx = newTable[int, int]()
    pQ = newPriorityQueue[int]((x: int, y: int) => y - x)

  for i in 0..<n:
    lastIdx[a[i]] = i

  for i in 0..<n:
    pQ.push(a[i])
    b[i] = pQ.peek()
    if i == lastIdx[a[i]]:
      pQ.del(a[i])

  echo b.join(" ")
0