結果
| 問題 |
No.3094 Stapler
|
| ユーザー |
👑  seekworser
|
| 提出日時 | 2025-04-06 17:45:31 |
| 言語 | Nim (2.2.0) |
| 結果 |
AC
|
| 実行時間 | 392 ms / 2,000 ms |
| コード長 | 14,425 bytes |
| コンパイル時間 | 6,094 ms |
| コンパイル使用メモリ | 94,612 KB |
| 実行使用メモリ | 76,116 KB |
| 最終ジャッジ日時 | 2025-06-20 02:32:37 |
| 合計ジャッジ時間 | 26,366 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 72 |
ソースコード
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/lazysegtree.nim
ImportExpand "cplib/collections/lazysegtree" <=== "when not declared CPLIB_COLLECTIONS_LAZYSEGTREE:\n const CPLIB_COLLECTIONS_LAZYSEGTREE* = 1\n import algorithm\n import sequtils\n import bitops\n import strutils\n type LazySegmentTree*[S, F] = ref object\n default: S\n merge: proc(x: S, y: S): S\n arr*: seq[S]\n lazy*: seq[F]\n mapping: proc(f: F, x: S): S\n composition: proc(f, g: F): F\n id: F\n lastnode: int\n log: int\n length: int\n proc initLazySegmentTree*[S, F](v_or_n: int or seq[S], merge: proc(x: S, y: S): S, default: S, mapping: proc(f: F, x: S): S, composition: proc(f, g: F): F, id: F): LazySegmentTree[S, F] =\n var v: seq[S]\n var n: int\n when v_or_n is seq[S]:\n v = v_or_n\n n = len(v)\n else:\n n = v_or_n\n var lastnode = 1\n while lastnode < n:\n lastnode*=2\n var log = countTrailingZeroBits(lastnode)\n var arr = newSeqWith(2*lastnode, default)\n var lazy = newSeqWith(lastnode, id)\n var self = LazySegmentTree[S, F](default: default, merge: merge, arr: arr, lazy: lazy, mapping: mapping, composition: composition, id: id, lastnode: lastnode, log: log, length: n)\n when v_or_n is seq[S]:\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 template all_apply(self, p, f: untyped) =\n self.arr[p] = self.mapping(f, self.arr[p])\n if p < self.lastnode: self.lazy[p] = self.composition(f, self.lazy[p])\n\n template push(self, p: untyped) =\n self.all_apply(2*p, self.lazy[p])\n self.all_apply(2*p + 1, self.lazy[p])\n self.lazy[p] = self.id\n\n template all_push(self, p: untyped) =\n for i in countdown(self.log, 1): self.push(p shr i)\n\n proc update*[S, F](self: var LazySegmentTree[S, F], p: Natural, val: S) =\n assert p < self.length\n var p = p + self.lastnode\n self.all_push(p)\n self.arr[p] = val\n for i in 1..self.log:\n self.arr[p shr i] = self.merge(self.arr[2*(p shr i)], self.arr[2*(p shr i)+1])\n\n proc `[]`*[S, F](self: var LazySegmentTree[S, F], p: Natural): S =\n assert p < self.length\n self.all_push(p + self.lastnode)\n return self.arr[p + self.lastnode]\n\n proc get*[S, F](self: var LazySegmentTree[S, F], q_left, q_right: int): S =\n assert q_left <= q_right and 0 <= q_left and q_right <= self.length\n if q_left == q_right: return self.default\n var q_left = q_left + self.lastnode\n var q_right = q_right + self.lastnode\n for i in countdown(self.log, 1):\n if i <= countTrailingZeroBits(q_left): break\n self.push(q_left shr i)\n for i in countdown(self.log, 1):\n if i <= countTrailingZeroBits(q_right): break\n self.push((q_right - 1) shr i)\n var\n lres = self.default\n rres = 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.inc\n if (q_right and 1) > 0:\n q_right.dec\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*[S, F](self: var LazySegmentTree[S, F], segment: HSlice[int, int]): S =\n return self.get(segment.a, segment.b+1)\n proc `[]`*[S, F](self: var LazySegmentTree[S, F], segment: HSlice[int, int]): S = self.get(segment)\n proc `[]=`*[S, F](self: var LazySegmentTree[S, F], p: Natural, val: S) = self.update(p, val)\n proc len*[S, F](self: var LazySegmentTree[S, F]): int =\n return self.length\n proc `$`*[S, F](self: var LazySegmentTree[S, F]): string =\n # var self = self\n return (0..<self.len).toSeq.mapIt(self[it]).join(\" \")\n template newLazySegWith*(v_or_n, merge, default, mapping, composition, id: untyped): untyped =\n type S = typeof(default)\n type F = typeof(id)\n initLazySegmentTree[S, F](\n v_or_n,\n proc (l{.inject.}, r{.inject.}: S): S = merge,\n default, proc (f{.inject.}: F, x{.inject.}: S): S = mapping,\n proc (f{.inject.}, g{.inject.}: F): F = composition,\n id\n )\n proc apply*[S, F](self: var LazySegmentTree[S, F], q_left, q_right: int, f: F) =\n assert q_left <= q_right and 0 <= q_left and q_right <= self.length\n if q_left == q_right: return\n var q_left = q_left + self.lastnode\n var q_right = q_right + self.lastnode\n var mx = countTrailingZeroBits(q_left) + 1\n for i in countdown(self.log, mx):\n self.push(q_left shr i)\n mx = countTrailingZeroBits(q_right) + 1\n for i in countdown(self.log, mx):\n self.push((q_right - 1) shr i)\n block:\n var q_left = q_left\n var q_right = q_right\n while q_left < q_right:\n if (q_left and 1) > 0:\n self.all_apply(q_left, f)\n q_left.inc\n if (q_right and 1) > 0:\n q_right.dec\n self.all_apply(q_right, f)\n q_left = q_left shr 1\n q_right = q_right shr 1\n var mn = countTrailingZeroBits(q_left) + 1\n for i in mn..self.log:\n var p = q_left shr i\n self.arr[p] = self.merge(self.arr[2*p], self.arr[2*p+1])\n mn = countTrailingZeroBits(q_right) + 1\n for i in mn..self.log:\n var p = ((q_right - 1) shr i)\n self.arr[p] = self.merge(self.arr[2*p], self.arr[2*p+1])\n proc apply*[S, F](self: var LazySegmentTree[S, F], segment: HSlice[int, int], f: F) =\n self.apply(segment.a, segment.b+1, f)\n"
# {.checks: off.}
var n = input(int)
var q = input(int)
proc op(x, y: (int, int)): (int, int) =
if x[0] < y[0]: return x
if y[0] < x[0]: return y
return (x[0], x[1] + y[1])
proc mapping(f: int, x: (int, int)): (int, int) = return (x[0] + f, x[1])
proc composition(f, g: int): int = return f+g
var seg = initLazySegmentTree(newSeqWith(n, (0, 1)), op, (INFL, 0), mapping, composition, 0)
var ans = n
var query = newSeq[(int, int)](q)
for i in 0..<q:
var t = input(int)
if t == 1:
var l, r = input(int)
l -= 1
r -= 1
var (mn, cnt) = seg[l..<r]
debug(mn, cnt)
if mn == 0: ans -= cnt
seg.apply(l..<r, 1)
query[i] = (l, r)
elif t == 2:
var id = input(int) - 1
var (l, r) = query[id]
var (mn, cnt) = seg[l..<r]
debug(mn, cnt)
if mn == 1: ans += cnt
seg.apply(l..<r, -1)
else:
print(ans)