結果
| 問題 | No.2809 Sort Query |
| ユーザー |
👑  seekworser
|
| 提出日時 | 2024-07-12 23:58:44 |
| 言語 | Nim (2.0.2) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 18,884 bytes |
| コンパイル時間 | 6,248 ms |
| コンパイル使用メモリ | 94,152 KB |
| 実行使用メモリ | 35,996 KB |
| 最終ジャッジ日時 | 2024-07-13 00:00:40 |
| 合計ジャッジ時間 | 62,666 ms |
|
ジャッジサーバーID （参考情報） |
judge6 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,812 KB |
| testcase_01 | TLE | - |
| testcase_02 | TLE | - |
| testcase_03 | RE | - |
| testcase_04 | TLE | - |
| testcase_05 | RE | - |
| testcase_06 | TLE | - |
| testcase_07 | TLE | - |
| testcase_08 | RE | - |
| testcase_09 | RE | - |
| testcase_10 | RE | - |
| testcase_11 | RE | - |
| testcase_12 | TLE | - |
| testcase_13 | RE | - |
| testcase_14 | RE | - |
| testcase_15 | RE | - |
| testcase_16 | RE | - |
| testcase_17 | RE | - |
| testcase_18 | RE | - |
| testcase_19 | RE | - |
| testcase_20 | RE | - |
| testcase_21 | RE | - |
| testcase_22 | TLE | - |
| testcase_23 | RE | - |
| testcase_24 | TLE | - |
| testcase_25 | RE | - |
| testcase_26 | TLE | - |
| testcase_27 | RE | - |
| testcase_28 | RE | - |
| testcase_29 | RE | - |
| testcase_30 | RE | - |
| testcase_31 | TLE | - |
| testcase_32 | RE | - |
| testcase_33 | RE | - |
| testcase_34 | RE | - |
| testcase_35 | RE | - |
| testcase_36 | RE | - |
| testcase_37 | RE | - |
| testcase_38 | RE | - |
| testcase_39 | RE | - |
| testcase_40 | RE | - |
| testcase_41 | WA | - |
| testcase_42 | WA | - |
| testcase_43 | WA | - |
| testcase_44 | WA | - |
| testcase_45 | WA | - |
| testcase_46 | WA | - |
| testcase_47 | WA | - |
| testcase_48 | WA | - |
| testcase_49 | WA | - |
| testcase_50 | WA | - |
| testcase_51 | AC | 508 ms
35,368 KB |
| testcase_52 | AC | 437 ms
35,400 KB |
| testcase_53 | AC | 479 ms
35,388 KB |
| testcase_54 | AC | 462 ms
35,480 KB |
| testcase_55 | AC | 391 ms
35,456 KB |
| testcase_56 | RE | - |
| testcase_57 | RE | - |
| testcase_58 | RE | - |
| testcase_59 | RE | - |
| testcase_60 | WA | - |
| testcase_61 | RE | - |
| testcase_62 | RE | - |
| testcase_63 | RE | - |
| testcase_64 | WA | - |
| testcase_65 | WA | - |
| testcase_66 | RE | - |
| testcase_67 | RE | - |
| testcase_68 | WA | - |
| testcase_69 | RE | - |
| testcase_70 | AC | 2 ms
6,944 KB |
ソースコード
import macros;macro ImportExpand(s:untyped):untyped = parseStmt($s[2])
# source: https://github.com/kemuniku/cplib/tree/main/src/cplib/tmpl/citrus.nim
ImportExpand "cplib/tmpl/citrus" <=== "when not declared CPLIB_TMPL_CITRUS:\n const CPLIB_TMPL_CITRUS* = 1\n {.warning[UnusedImport]: off.}\n {.hint[XDeclaredButNotUsed]: off.}\n import os\n import algorithm\n import sequtils\n import tables\n import macros\n import std/math\n import sets\n import strutils\n import strformat\n import sugar\n import streams\n import deques\n import bitops\n import heapqueue\n import options\n import hashes\n const MODINT998244353* = 998244353\n const MODINT1000000007* = 1000000007\n when not declared CPLIB_UTILS_CONSTANTS:\n const CPLIB_UTILS_CONSTANTS* = 1\n const INF32*: int32 = 100100111.int32\n const INF64*: int = int(3300300300300300491)\n \n const INFL = INF64\n type double* = float64\n let readNext = iterator(getsChar: bool = false): string {.closure.} =\n while true:\n var si: string\n try: si = stdin.readLine\n except EOFError: yield \"\"\n for s in si.split:\n if getsChar:\n for i in 0..<s.len():\n yield s[i..i]\n else:\n if s.isEmptyOrWhitespace: continue\n yield s\n proc input*(t: typedesc[string]): string = readNext()\n proc input*(t: typedesc[char]): char = readNext(true)[0]\n proc input*(t: typedesc[int]): int = readNext().parseInt\n proc input*(t: typedesc[float]): float = readNext().parseFloat\n macro input*(t: typedesc, n: varargs[int]): untyped =\n var repStr = \"\"\n for arg in n:\n repStr &= &\"({arg.repr}).newSeqWith \"\n parseExpr(&\"{repStr}input({t})\")\n macro input*(ts: varargs[auto]): untyped =\n var tupStr = \"\"\n for t in ts:\n tupStr &= &\"input({t.repr}),\"\n parseExpr(&\"({tupStr})\")\n macro input*(n: int, ts: varargs[auto]): untyped =\n for typ in ts:\n if typ.typeKind != ntyAnything:\n error(\"Expected typedesc, got \" & typ.repr, typ)\n parseExpr(&\"({n.repr}).newSeqWith input({ts.repr})\")\n proc `fmtprint`*(x: int or string or char or bool): string = return $x\n proc `fmtprint`*(x: float or float32 or float64): string = return &\"{x:.16f}\"\n proc `fmtprint`*[T](x: seq[T] or Deque[T] or HashSet[T] or set[T]): string = return x.toSeq.join(\" \")\n proc `fmtprint`*[T, N](x: array[T, N]): string = return x.toSeq.join(\" \")\n proc `fmtprint`*[T](x: HeapQueue[T]): string =\n var q = x\n while q.len != 0:\n result &= &\"{q.pop()}\"\n if q.len != 0: result &= \" \"\n proc `fmtprint`*[T](x: CountTable[T]): string =\n result = x.pairs.toSeq.mapIt(&\"{it[0]}: {it[1]}\").join(\" \")\n proc `fmtprint`*[K, V](x: Table[K, V]): string =\n result = x.pairs.toSeq.mapIt(&\"{it[0]}: {it[1]}\").join(\" \")\n proc print*(prop: tuple[f: File, sepc: string, endc: string, flush: bool], args: varargs[string, `fmtprint`]) =\n for i in 0..<len(args):\n prop.f.write(&\"{args[i]}\")\n if i != len(args) - 1: prop.f.write(prop.sepc) else: prop.f.write(prop.endc)\n if prop.flush: prop.f.flushFile()\n proc print*(args: varargs[string, `fmtprint`]) = print((f: stdout, sepc: \" \", endc: \"\\n\", flush: false), args)\n const LOCAL_DEBUG{.booldefine.} = false\n macro getSymbolName(x: typed): string = x.toStrLit\n macro debug*(args: varargs[untyped]): untyped =\n when LOCAL_DEBUG:\n result = newNimNode(nnkStmtList, args)\n template prop(e: string = \"\"): untyped = (f: stderr, sepc: \"\", endc: e, flush: true)\n for i, arg in args:\n if arg.kind == nnkStrLit:\n result.add(quote do: print(prop(), \"\\\"\", `arg`, \"\\\"\"))\n else:\n result.add(quote do: print(prop(\": \"), getSymbolName(`arg`)))\n result.add(quote do: print(prop(), `arg`))\n if i != args.len - 1: result.add(quote do: print(prop(), \", \"))\n else: result.add(quote do: print(prop(), \"\\n\"))\n else:\n return (quote do: discard)\n proc `%`*(x: SomeInteger, y: SomeInteger): int =\n result = x mod y\n if y > 0 and result < 0: result += y\n if y < 0 and result > 0: result += y\n proc `//`*(x: SomeInteger, y: SomeInteger): int =\n result = x div y\n if y > 0 and result * y > x: result -= 1\n if y < 0 and result * y < x: result -= 1\n proc `^`*(x: SomeInteger, y: SomeInteger): int = x xor y\n proc `&`*(x: SomeInteger, y: SomeInteger): int = x and y\n proc `|`*(x: SomeInteger, y: SomeInteger): int = x or y\n proc `>>`*(x: SomeInteger, y: SomeInteger): int = x shr y\n proc `<<`*(x: SomeInteger, y: SomeInteger): int = x shl y\n proc `%=`*(x: var SomeInteger, y: SomeInteger): void = x = x % y\n proc `//=`*(x: var SomeInteger, y: SomeInteger): void = x = x // y\n proc `^=`*(x: var SomeInteger, y: SomeInteger): void = x = x ^ y\n proc `&=`*(x: var SomeInteger, y: SomeInteger): void = x = x & y\n proc `|=`*(x: var SomeInteger, y: SomeInteger): void = x = x | y\n proc `>>=`*(x: var SomeInteger, y: SomeInteger): void = x = x >> y\n proc `<<=`*(x: var SomeInteger, y: SomeInteger): void = x = x << y\n proc `[]`*(x, n: int): bool = (x and (1 shl n)) != 0\n proc `[]=`*(x: var int, n: int, i: bool) =\n if i: x = x or (1 << n)\n else: (if x[n]: x = x xor (1 << n))\n proc pow*(a, n: int, m = INF64): int =\n var\n rev = 1\n a = a\n n = n\n while n > 0:\n if n % 2 != 0: rev = (rev * a) mod m\n if n > 1: a = (a * a) mod m\n n >>= 1\n return rev\n when not declared CPLIB_MATH_ISQRT:\n const CPLIB_MATH_ISQRT* = 1\n proc isqrt*(n: int): int =\n var x = n\n var y = (x + 1) shr 1\n while y < x:\n x = y\n y = (x + n div x) shr 1\n return x\n \n proc chmax*[T](x: var T, y: T): bool {.discardable.} = (if x < y: (x = y; return true; ) return false)\n proc chmin*[T](x: var T, y: T): bool {.discardable.} = (if x > y: (x = y; return true; ) return false)\n proc `max=`*[T](x: var T, y: T) = x = max(x, y)\n proc `min=`*[T](x: var T, y: T) = x = min(x, y)\n proc at*(x: char, a = '0'): int = int(x) - int(a)\n proc Yes*(b: bool = true): void = print(if b: \"Yes\" else: \"No\")\n proc No*(b: bool = true): void = Yes(not b)\n proc YES_upper*(b: bool = true): void = print(if b: \"YES\" else: \"NO\")\n proc NO_upper*(b: bool = true): void = Yes_upper(not b)\n const DXY* = [(0, -1), (0, 1), (-1, 0), (1, 0)]\n const DDXY* = [(1, -1), (1, 0), (1, 1), (0, -1), (0, 1), (-1, -1), (-1, 0), (-1, 1)]\n macro exit*(statement: untyped): untyped = (quote do: (`statement`; quit()))\n proc initHashSet[T](): Hashset[T] = initHashSet[T](0)\n"
# source: https://github.com/kemuniku/cplib/tree/main/src/cplib/collections/tatyamset.nim
ImportExpand "cplib/collections/tatyamset" <=== "# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py\nwhen not declared CPLIB_COLLECTIONS_TATYAMSET:\n import algorithm\n import math\n import sequtils\n import sugar\n import options\n const CPLIB_COLLECTIONS_TATYAMSET* = 1\n\n const BUCKET_RATIO = 8\n const SPLIT_RATIO = 12\n type SortedMultiSet*[T] = ref object\n size: int\n arr*: seq[seq[T]]\n proc initSortedMultiset*[T](v: seq[T] = @[]): SortedMultiSet[T] =\n #Make a new SortedMultiset from seq. / O(N) if sorted / O(N log N)\n var v = v\n if not isSorted(v):\n v.sort()\n var n = len(v)\n var bucket_size = int(ceil(sqrt(n/BUCKET_RATIO)))\n var arr = collect(newseq): (for i in 0..<bucket_size: v[(n*i div bucket_size) ..< (n*(i+1) div bucket_size)])\n result = SortedMultiSet[T](size: n, arr: arr)\n\n proc len*(self: SortedMultiSet): int =\n return self.size\n\n proc position[T](self: SortedMultiSet[T], x: T): (int, int) =\n #\"return the bucket, index of the bucket and position in which x should be. self must not be empty.\"\n for i in 0..<self.arr.len:\n if x <= self.arr[i][^1]:\n return (i, self.arr[i].lowerBound(x))\n return (len(self.arr)-1, self.arr[^1].lowerBound(x))\n\n proc contains*[T](self: SortedMultiSet[T], x: T): bool =\n if self.size == 0: return false\n var (i, j) = self.position(x)\n return j != len(self.arr[i]) and self.arr[i][j] == x\n\n proc incl*[T](self: SortedMultiSet[T], x: T) =\n #\"Add an element. / O(√N)\"\n if self.size == 0:\n self.arr = @[@[x]]\n self.size = 1\n return\n var (b, i) = self.position(x)\n self.arr[b].insert(x, i)\n self.size += 1\n if len(self.arr[b]) > len(self.arr) * SPLIT_RATIO:\n var mid = len(self.arr[b]) shr 1\n self.arr.insert(self.arr[b][mid..<len(self.arr[b])], b+1)\n self.arr[b] = self.arr[b][0..<mid]\n\n proc innerpop[T](self: SortedMultiSet[T], b: int, i: int): T{.discardable.} =\n var b = b\n if b < 0:\n b = self.size + b\n var ans = self.arr[b][i]\n self.arr[b].delete(i)\n self.size -= 1\n if len(self.arr[b]) == 0: self.arr.delete(b)\n return ans\n\n proc excl*[T](self: SortedMultiSet[T], x: T): bool{.discardable.} =\n #\"Remove an element and return True if removed. / O(√N)\"\n if self.size == 0: return false\n var (b, i) = self.position(x)\n if i == len(self.arr[b]) or self.arr[b][i] != x: return false\n self.innerpop(b, i)\n return true\n\n proc lt*[T](self: SortedMultiSet[T], x: T): Option[T] =\n #\"Find the largest element < x, or None if it doesn't exist.\"\n for i in countdown(len(self.arr)-1, 0, 1):\n if self.arr[i][0] < x:\n return some(self.arr[i][lowerBound(self.arr[i], x) - 1])\n return none(T)\n\n proc le*[T](self: SortedMultiSet[T], x: T): Option[T] =\n #\"Find the largest element <= x, or None if it doesn't exist.\"\n for i in countdown(len(self.arr)-1, 0, 1):\n if self.arr[i][0] <= x:\n return some(self.arr[i][upperBound(self.arr[i], x) - 1])\n return none(T)\n\n proc gt*[T](self: SortedMultiSet[T], x: T): Option[T] =\n #\"Find the smallest element > x, or None if it doesn't exist.\"\n for i in 0..<len(self.arr):\n if self.arr[i][^1] > x:\n return some(self.arr[i][upperBound(self.arr[i], x)])\n return none(T)\n\n proc ge*[T](self: SortedMultiSet[T], x: T): Option[T] =\n #\"Find the smallest element >= x, or None if it doesn't exist.\"\n for i in 0..<len(self.arr):\n if self.arr[i][^1] >= x:\n return some(self.arr[i][lowerBound(self.arr[i], x)])\n return none(T)\n\n proc `[]`*[T](self: SortedMultiSet[T], i: int): T =\n var i = i\n #\"Return the i-th element.\"\n if i < 0:\n for j in countdown(len(self.arr)-1, 0, 1):\n i += len(self.arr[j])\n if i >= 0: return self.arr[j][i]\n else:\n for j in 0..<len(self.arr):\n if i < len(self.arr[j]): return self.arr[j][i]\n i -= len(self.arr[j])\n raise newException(IndexDefect, \"index \" & $i & \" not in 0 .. \" & $(self.size-1))\n\n proc pop*[T](self: SortedMultiSet[T], i: int = -1): T =\n #\"Pop and return the i-th element.\"\n var i = i\n if i < 0:\n for b in countdown(len(self.arr)-1, 0, 1):\n i += len(self.arr[b])\n if i >= 0: return self.innerpop(not b, i)\n else:\n for b in 0..<len(self.arr):\n if i < len(self.arr[b]): return self.innerpop(b, i)\n i -= len(self.arr[b])\n raise newException(IndexDefect, \"index \" & $i & \" not in 0 .. \" & $(self.size-1))\n\n proc index*[T](self: SortedMultiSet[T], x: T): int =\n #\"Count the number of elements < x.\"\n for i in 0..<len(self.arr):\n if self.arr[i][^1] >= x:\n return result + lowerBound(self.arr[i], x)\n result += len(self.arr[i])\n\n proc index_right*[T](self: SortedMultiSet[T], x: T): int =\n #\"Count the number of elements <= x.\"\n for i in 0..<len(self.arr):\n if self.arr[i][^1] > x:\n return result + upperBound(self.arr[i], x)\n result += len(self.arr[i])\n proc count*[T](self: SortedMultiSet[T], x: T): int =\n #\"Count the number of x.\"\n return self.index_right(x) - self.index(x)\n\n iterator items*[T](self: SortedMultiSet[T]): T =\n for i in 0..<len(self.arr):\n for j in self.arr[i]:\n yield j\n"
# source: https://github.com/kemuniku/cplib/tree/main/src/cplib/collections/segtree.nim
ImportExpand "cplib/collections/segtree" <=== "when not declared CPLIB_COLLECTIONS_SEGTREE:\n const CPLIB_COLLECTIONS_SEGTREE* = 1\n import algorithm\n import strutils\n type SegmentTree*[T] = ref object\n default: T\n merge: proc(x: T, y: T): T\n arr*: seq[T]\n lastnode: int\n length: int\n proc initSegmentTree*[T](v: seq[T], merge: proc(x: T, y: T): T, default: T): SegmentTree[T] =\n var lastnode = 1\n while lastnode < len(v):\n lastnode*=2\n var arr = newSeq[T](2*lastnode)\n arr.fill(default)\n var self = SegmentTree[T](default: default, merge: merge, arr: arr, lastnode: lastnode, length: len(v))\n #1-indexedで作成する\n for i in 0..<len(v):\n self.arr[self.lastnode+i] = v[i]\n for i in countdown(lastnode-1, 1):\n self.arr[i] = self.merge(self.arr[2*i], self.arr[2*i+1])\n return self\n\n proc update*[T](self: SegmentTree[T], x: Natural, val: T) =\n assert x < self.length\n var x = x\n x += self.lastnode\n self.arr[x] = val\n while x > 1:\n x = x shr 1\n self.arr[x] = self.merge(self.arr[2*x], self.arr[2*x+1])\n proc get*[T](self: SegmentTree[T], q_left: Natural, q_right: Natural): T =\n assert q_left <= q_right and 0 <= q_left and q_right <= self.length\n var q_left = q_left\n var q_right = q_right\n q_left += self.lastnode\n q_right += self.lastnode\n var (lres, rres) = (self.default, self.default)\n while q_left < q_right:\n if (q_left and 1) > 0:\n lres = self.merge(lres, self.arr[q_left])\n q_left += 1\n if (q_right and 1) > 0:\n q_right -= 1\n rres = self.merge(self.arr[q_right], rres)\n q_left = q_left shr 1\n q_right = q_right shr 1\n return self.merge(lres, rres)\n proc get*[T](self: SegmentTree[T], segment: HSlice[int, int]): T =\n assert segment.a <= segment.b + 1 and 0 <= segment.a and segment.b+1 <= self.length\n return self.get(segment.a, segment.b+1)\n proc `[]`*[T](self: SegmentTree[T], segment: HSlice[int, int]): T = self.get(segment)\n proc `[]`*[T](self: SegmentTree[T], index: Natural): T =\n assert index < self.length\n return self.arr[index+self.lastnode]\n proc `[]=`*[T](self: SegmentTree[T], index: Natural, val: T) =\n assert index < self.length\n self.update(index, val)\n proc get_all*[T](self: SegmentTree[T]): T =\n return self.arr[1]\n proc len*[T](self: SegmentTree[T]): int =\n return self.length\n proc `$`*[T](self: SegmentTree[T]): string =\n var s = self.arr.len div 2\n return self.arr[s..<s+self.len].join(\" \")\n template newSegWith*(V, merge, default: untyped): untyped =\n initSegmentTree(V, proc (l{.inject.}, r{.inject.}: typeof(default)): typeof(default) = merge, default)\n proc max_right*[T](self: SegmentTree[T], l: int, f: proc(l: T): bool): int =\n assert 0 <= l and l <= self.len\n assert f(self.default)\n if l == self.len: return self.len\n var l = l\n l += self.lastnode\n var sm = self.default\n while true:\n while l mod 2 == 0: l = (l shr 1)\n if not f(self.merge(sm, self.arr[l])):\n while l < self.lastnode:\n l *= 2\n if f(self.merge(sm, self.arr[l])):\n sm = self.merge(sm, self.arr[l])\n l += 1\n return l - self.lastnode\n sm = self.merge(sm, self.arr[l])\n l += 1\n if (l and -l) == l: break\n return self.len\n proc min_left*[T](self: SegmentTree[T], r: int, f: proc(l: T): bool): int =\n assert 0 <= r and r <= self.len\n assert f(self.default)\n if r == 0: return 0\n var r = r\n r += self.lastnode\n var sm = self.default\n while true:\n r -= 1\n while (r > 1 and r mod 2 != 0): r = (r shr 1)\n if not f(self.merge(self.arr[r], sm)):\n while r < self.lastnode:\n r = 2 * r + 1\n if f(self.merge(self.arr[r], sm)):\n sm = self.merge(self.arr[r], sm)\n r -= 1\n return r + 1 - self.lastnode\n if (r and -r) == r: break\n return 0\n"
# {.checks: off.}
var n, q = input(int)
var a = input(int, n)
var query = newSeq[(int, int, int)]()
for i in 0..<q:
var t = input(int)
if t == 1:
var k, x = input(int)
query.add((t, k-1, x))
elif t == 2:
query.add((t, 0, 0))
else:
var k = input(int)
query.add((t, k-1, 0))
var cnt = newSegWith(newSeqWith(n, 1), l+r, 1)
var up = (0..<n).toSeq
var st = initSortedMultiset[int]()
for i in 0..<q:
var (t, k, x) = query[i]
if t == 1:
if cnt[k] != 1:
var p = k - cnt[0..<k]
discard st.pop(p)
cnt[k] = 1
up.add(k)
a[i] = x
elif t == 2:
for j in up:
cnt[j] = 0
st.incl(a[i])
up = newSeq[int]()
else:
if cnt[k] == 1:
print(a[k])
else:
var p = k - cnt[0..<k]
print(st[p])