結果
問題 | No.318 学学学学学 |
ユーザー | t8m8⛄️ |
提出日時 | 2017-06-09 15:57:32 |
言語 | Nim (2.0.2) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,497 bytes |
コンパイル時間 | 3,730 ms |
コンパイル使用メモリ | 70,304 KB |
実行使用メモリ | 26,788 KB |
最終ジャッジ日時 | 2023-09-12 12:56:35 |
合計ジャッジ時間 | 8,585 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 7 ms
4,796 KB |
testcase_01 | AC | 12 ms
6,508 KB |
testcase_02 | AC | 14 ms
6,516 KB |
testcase_03 | AC | 10 ms
6,024 KB |
testcase_04 | AC | 12 ms
6,448 KB |
testcase_05 | AC | 75 ms
26,788 KB |
testcase_06 | AC | 444 ms
21,452 KB |
testcase_07 | WA | - |
testcase_08 | AC | 141 ms
14,956 KB |
testcase_09 | AC | 70 ms
15,512 KB |
testcase_10 | AC | 43 ms
14,864 KB |
testcase_11 | AC | 71 ms
26,456 KB |
testcase_12 | AC | 58 ms
20,120 KB |
testcase_13 | AC | 52 ms
17,624 KB |
testcase_14 | AC | 47 ms
14,948 KB |
testcase_15 | AC | 45 ms
15,760 KB |
testcase_16 | AC | 43 ms
14,616 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 1,164 ms
23,328 KB |
testcase_20 | WA | - |
testcase_21 | AC | 1 ms
4,376 KB |
testcase_22 | AC | 2 ms
4,376 KB |
testcase_23 | AC | 1 ms
4,380 KB |
testcase_24 | AC | 2 ms
4,376 KB |
testcase_25 | AC | 2 ms
4,380 KB |
testcase_26 | AC | 1 ms
4,380 KB |
testcase_27 | AC | 1 ms
4,376 KB |
testcase_28 | AC | 1 ms
4,376 KB |
コンパイルメッセージ
/home/judge/data/code/Main.nim(1, 39) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated] /home/judge/data/code/Main.nim(94, 12) Warning: Deprecated since v0.20, use 'initHashSet'; initSet is deprecated [Deprecated]
ソースコード
import strutils, sequtils, algorithm, future, tables, sets type PrirorityQueue*[T] = ref object of RootObj elms: seq[T] cmp: (T, T) -> int proc newPriorityQueue*[T](cmp: (T, T) -> int): PrirorityQueue[T] = new(result) result.elms = newSeq[T]() 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: swap(self.elms[cur], self.elms[par]) (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 swap(self.elms[cur], self.elms[ch]) (cur, chl, chr) = (ch, childl(cur), childr(cur)) proc len*[T](self: PrirorityQueue[T]): int = self.elms.len proc peek*[T](self: var PrirorityQueue[T]): T = self.elms[0] proc push*[T](self: var PrirorityQueue[T], data: T) = var n = self.elms.len cur = n self.elms.setLen(n + 1) self.elms[cur] = data self.upHeap(cur) 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[cur] = self.elms[n-1] self.elms.del(n-1) self.downHeap(cur) proc delete*[T](self: var PrirorityQueue[T], data: T) = var n = self.elms.len idx = -1 for i in 0..<n: if self.elms[i] == data: idx = i break if idx == -1: return elif idx == n - 1: self.elms.del(idx) else: 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) used = initSet[int]() for i in 0..<n: lastIdx[a[i]] = i for i in 0..<n: if not used.contains(a[i]): pQ.push(a[i]) used.incl(a[i]) b[i] = pQ.peek() if i == lastIdx[a[i]]: pQ.delete(a[i]) used.excl(a[i]) echo b.join(" ")