結果
| 問題 |
No.879 Range Mod 2 Query
|
| コンテスト | |
| ユーザー |
 yuly3
|
| 提出日時 | 2020-09-22 13:49:59 |
| 言語 | Nim (2.2.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 6,672 bytes |
| コンパイル時間 | 1,566 ms |
| コンパイル使用メモリ | 71,808 KB |
| 最終ジャッジ日時 | 2024-06-26 02:06:22 |
| 合計ジャッジ時間 | 3,230 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
/home/judge/data/code/Main.nim(138, 27) Error: type mismatch: got 'seq[int]' for 'map(split(input(), {' ', '\t', '\v', '\r', '\n', '\f'}, -1), parseInt)' but expected 'tuple'
ソースコード
import algorithm, deques, heapqueue, math, sets, sequtils, strutils, sugar, tables
proc input*(): string =
return stdin.readLine
proc chmax*[T: SomeNumber](num0: var T, num1: T) =
num0 = max(num0, num1)
proc chmin*[T: SomeNumber](num0: var T, num1: T) =
num0 = min(num0, num1)
proc `%=`*[T: SomeInteger](num0: var T, num1: T) =
num0 = num0 mod num1
proc bit_length(n: Natural): Natural =
const BIT_SIZE = 24
if n == 0:
return 0
let s = toBin(n, BIT_SIZE)
return BIT_SIZE - s.find('1')
type
LazySegmentTree*[T, K] = ref object
LV: Natural
N0: Positive
ide_ele: T
lazy_ide_ele: K
data: seq[T]
lazy_data: seq[K]
fold: proc (a, b: T): T
eval: proc (a: T, b: K): T
merge: proc (a, b: K): K
propagates_when_updating: bool
proc initLazySegmentTree*[T, K](size: Positive, ide_ele: T, lazy_ide_ele: K, fold: proc (a, b: T): T, eval: proc (a: T, b: K): T, merge: proc (a, b: K): K, propagates_when_updating=false): LazySegmentTree[T, K] =
let
LV = bit_length(size - 1)
N0 = 1 shl LV
data = newSeqWith(2*N0, ide_ele)
lazy_data = newSeqWith(2*N0, lazy_ide_ele)
return LazySegmentTree[T, K](LV: LV, N0: N0, ide_ele: ide_ele, lazy_ide_ele: lazy_ide_ele, data: data, lazy_data: lazy_data, fold: fold, eval: eval, merge: merge, propagates_when_updating: propagates_when_updating)
proc toLazySegmentTree*[T, K](init_value: openArray[T], ide_ele: T, lazy_ide_ele: K, fold: proc (a, b: T): T, eval: proc (a: T, b: K): T, merge: proc (a, b: K): K, propagates_when_updating=false): LazySegmentTree[T, K] =
let
LV = bit_length(init_value.len - 1)
N0 = 1 shl LV
lazy_data = newSeqWith(2*N0, lazy_ide_ele)
var data = newSeqWith(2*N0, ide_ele)
for i, x in init_value:
data[i + N0 - 1] = x
for i in countdown(N0 - 2, 0):
data[i] = fold(data[2*i + 1], data[2*i + 2])
return LazySegmentTree[T, K](LV: LV, N0: N0, ide_ele: ide_ele, lazy_ide_ele: lazy_ide_ele, data: data, lazy_data: lazy_data, fold: fold, eval: eval, merge: merge, propagates_when_updating: propagates_when_updating)
iterator gindex*[T, K](self: var LazySegmentTree[T, K], left, right: Natural): Natural =
var
L = (left + self.N0) shr 1
R = (right + self.N0) shr 1
lc = if (left and 1) == 1: 0 else: bit_length(L and -L)
rc = if (right and 1) == 1: 0 else: bit_length(R and -R)
for i in 0..<self.LV:
if rc <= i:
yield R
if L < R and lc <= i:
yield L
L = L shr 1
R = R shr 1
proc propagates*[T, K](self: var LazySegmentTree[T, K], ids: seq[Natural]) =
var
idx: Natural
v: K
for id in reversed(ids):
idx = id - 1
v = self.lazy_data[idx]
if v == self.lazy_ide_ele:
continue
# v = v shr 1
self.data[2*idx + 1] = self.eval(self.data[2*idx + 1], v)
self.data[2*idx + 2] = self.eval(self.data[2*idx + 2], v)
self.lazy_data[2*idx + 1] = self.merge(self.lazy_data[2*idx + 1], v)
self.lazy_data[2*idx + 2] = self.merge(self.lazy_data[2*idx + 2], v)
self.lazy_data[idx] = self.lazy_ide_ele
proc update*[T, K](self: var LazySegmentTree[T, K], left, right: Natural, x: K) =
let ids = toSeq(self.gindex(left, right))
if self.propagates_when_updating:
self.propagates(ids)
var
L = left + self.N0
R = right + self.N0
# x = x
while L < R:
if (L and 1) == 1:
self.lazy_data[L - 1] = self.merge(self.lazy_data[L - 1], x)
self.data[L - 1] = self.eval(self.data[L - 1], x)
inc L
if (R and 1) == 1:
dec R
self.lazy_data[R - 1] = self.merge(self.lazy_data[R - 1], x)
self.data[R - 1] = self.eval(self.data[R - 1], x)
L = L shr 1
R = R shr 1
# x = x shl 1
var idx: Natural
for id in ids:
idx = id - 1
self.data[idx] = self.fold(self.data[2*idx + 1], self.data[2*idx + 2])
if self.lazy_data[idx] != self.lazy_ide_ele:
self.data[idx] = self.eval(self.data[idx], self.lazy_data[idx])
proc query*[T, K](self: var LazySegmentTree[T, K], left, right: Natural): T =
self.propagates(toSeq(self.gindex(left, right)))
var
L = left + self.N0
R = right + self.N0
res = self.ide_ele
while L < R:
if (L and 1) == 1:
res = self.fold(res, self.data[L - 1])
inc L
if (R and 1) == 1:
dec R
res = self.fold(res, self.data[R - 1])
L = L shr 1
R = R shr 1
return res
var
a, ans: seq[int]
init_val: seq[(int, int, int)]
lazy_seg_tree: LazySegmentTree[(int, int, int), (bool, int, int)]
proc solve() =
var N, Q: int
(N, Q) = input().split.map(parseInt)
a = input().split.map(parseInt)
for ai in a:
if ai mod 2 == 0:
init_val.add((0, 1, ai))
else:
init_val.add((1, 0, ai))
proc eval(a: (int, int, int), b: (bool, int, int)): (int, int, int) =
if not b[0]:
if b[2] mod 2 == 0:
return (a[0], a[1], a[2] + (a[0] + a[1])*b[2])
else:
return (a[1], a[0], a[2] + (a[0] + a[1])*b[2])
else:
if b[1] mod 2 == 0:
if b[2] mod 2 == 0:
return (a[0], a[1], a[0] + (a[0] + a[1])*b[2])
else:
return (a[1], a[0], a[0] + (a[0] + a[1])*b[2])
else:
if b[2] mod 2 == 0:
return (a[1], a[0], a[1] + (a[0] + a[1])*b[2])
else:
return (a[0], a[1], a[1] + (a[0] + a[1])*b[2])
proc merge(a, b: (bool, int, int)): (bool, int, int) =
if b[0]:
return (true, a[1] + a[2] + b[1], b[2])
else:
return (a[0], a[1], a[2] + b[2])
lazy_seg_tree = toLazySegmentTree(init_val, (0, 0, 0), (false, 0, 0), (a, b) => (a[0] + b[0], a[1] + b[1], a[2] + b[2]), eval, merge, true)
var li, ri, xi: int
for _ in 0..<Q:
let query = input().split.map(parseInt)
if query[0] == 1:
(li, ri) = query[1..^1]
lazy_seg_tree.update(li - 1, ri, (true, 0, 0))
elif query[0] == 2:
(li, ri, xi) = query[1..^1]
lazy_seg_tree.update(li - 1, ri, (false, 0, xi))
else:
(li, ri) = query[1..^1]
ans.add(lazy_seg_tree.query(li - 1, ri)[2])
echo ans.join("\n")
when is_main_module:
solve()