結果

問題 No.1234 典型RMQ
ユーザー 箱星箱星
提出日時 2020-10-09 03:52:42
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 1,768 ms / 2,000 ms
コード長 5,717 bytes
コンパイル時間 20,370 ms
コンパイル使用メモリ 458,248 KB
実行使用メモリ 106,436 KB
最終ジャッジ日時 2024-11-09 02:33:43
合計ジャッジ時間 58,702 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 323 ms
50,080 KB
testcase_01 AC 325 ms
50,248 KB
testcase_02 AC 327 ms
50,056 KB
testcase_03 AC 324 ms
50,116 KB
testcase_04 AC 325 ms
50,244 KB
testcase_05 AC 323 ms
50,156 KB
testcase_06 AC 1,704 ms
103,856 KB
testcase_07 AC 1,400 ms
90,804 KB
testcase_08 AC 1,763 ms
106,436 KB
testcase_09 AC 1,607 ms
96,572 KB
testcase_10 AC 1,768 ms
105,348 KB
testcase_11 AC 1,747 ms
103,368 KB
testcase_12 AC 1,588 ms
95,420 KB
testcase_13 AC 1,382 ms
89,100 KB
testcase_14 AC 1,695 ms
96,016 KB
testcase_15 AC 1,536 ms
95,432 KB
testcase_16 AC 1,699 ms
104,300 KB
testcase_17 AC 1,734 ms
101,972 KB
testcase_18 AC 1,159 ms
87,156 KB
testcase_19 AC 1,745 ms
106,072 KB
testcase_20 AC 1,270 ms
102,096 KB
testcase_21 AC 1,663 ms
102,776 KB
testcase_22 AC 1,322 ms
97,132 KB
testcase_23 AC 1,357 ms
97,608 KB
testcase_24 AC 1,328 ms
97,296 KB
testcase_25 AC 1,328 ms
96,812 KB
testcase_26 AC 1,350 ms
96,824 KB
testcase_27 AC 321 ms
50,020 KB
testcase_28 AC 325 ms
50,300 KB
testcase_29 AC 329 ms
50,272 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.io.PrintWriter
import java.util.*

class LazySegTree<Monoid, F>(private val n: Int, private val op: (Monoid, Monoid) -> Monoid, private val e: Monoid, private val mapping: (F, Monoid) -> Monoid, private val composition: (F, F) -> F, private val id: F) {
    private var d: MutableList<Monoid>
    private var lz: MutableList<F>
    private var size = 1
    private var log = 0

    init {
        while (size < n) {
            size *= 2
            log++
        }
        d = MutableList(2 * size) { e }
        lz = MutableList(size) { id }
    }

    constructor(n: Int, op: (Monoid, Monoid) -> Monoid, e: Monoid, mapping: (F, Monoid) -> Monoid, composition: (F, F) -> F, id: F, a: Array<Monoid>) : this(n, op, e, mapping, composition, id) {
        for (i in 0 until n) {
            d[size + i] = a[i]
        }
        for (i in size - 1 downTo 1) {
            update(i)
        }
    }

    operator fun set(p: Int, x: Monoid) {
        val p1 = p + size
        for (i in log downTo 1) {
            push(p1 shr i)
        }
        d[p1] = x
        for (i in 1..log) {
            update(p1 shr i)
        }
    }

    operator fun get(p: Int): Monoid {
        val p1 = p + size
        for (i in log downTo 1) {
            push(p1 shr i)
        }
        return d[p1]
    }

    fun prod(l: Int, r: Int): Monoid {
        if (l == r) return e
        var l1 = l + size
        var r1 = r + size
        for (i in log downTo 1) {
            if ((l1 shr i) shl i != l1) push(l1 shr i)
            if ((r1 shr i) shl i != r1) push(r1 shr i)
        }
        var sml = e
        var smr = e
        while (l1 < r1) {
            if (l1 and 1 != 0) sml = op(sml, d[l1++])
            if (r1 and 1 != 0) smr = op(d[--r1], smr)
            l1 /= 2
            r1 /= 2
        }
        return op(sml, smr)
    }

    fun allProd(): Monoid {
        return d[1]
    }

    fun apply(p: Int, f: F) {
        val p1 = p + size
        for (i in log downTo 1) {
            push(p1 shr i)
        }
        d[p1] = mapping(f, d[p1])
        for (i in 1..log) {
            update(p1 shr i)
        }
    }

    fun apply(l: Int, r: Int, f: F) {
        if (l == r) return
        var l1 = l + size
        var r1 = r + size
        for (i in log downTo 1) {
            if ((l1 shr i) shl i != l1) push(l1 shr i)
            if ((r1 shr i) shl i != r1) push((r1 - 1) shr i)
        }
        val l2 = l1
        val r2 = r1
        while (l1 < r1) {
            if (l1 and 1 != 0) allApply(l1++, f)
            if (r1 and 1 != 0) allApply(--r1, f)
            l1 /= 2
            r1 /= 2
        }
        l1 = l2
        r1 = r2
        for (i in 1..log) {
            if ((l1 shr i) shl i != l1) update(l1 shr i)
            if ((r1 shr i) shl i != r1) update((r1 - 1) shr i)
        }
    }

    fun maxRight(l: Int, g: (Monoid) -> Boolean): Int {
        if (l == n) return n
        var l1 = l + size
        for (i in log downTo 1) push(l1 shr i)
        var sm = e
        do {
            while (l1 % 2 == 0) l1 /= 2
            if (!g(op(sm, d[l1]))) {
                while (l1 < size) {
                    push(l1)
                    l1 *= 2
                    if (g(op(sm, d[l1]))) {
                        sm = op(sm, d[l1])
                        l1++
                    }
                }
                return l1 - size
            }
            sm = op(sm, d[l1])
            l1++
        } while ((l1 and -l1) != l1)
        return n
    }

    fun minLeft(r: Int, g: (Monoid) -> Boolean): Int {
        if (r == 0) return 0
        var r1 = r + size
        for (i in log downTo 1) push((r1 - 1) shr i)
        var sm = e
        do {
            r1--
            while (r1 > 1 && r1 % 2 != 0) r1 /= 2
            if (!g(op(d[r1], sm))) {
                while (r1 < size) {
                    push(r1)
                    r1 = 2 * r1 + 1
                    if (g(op(d[r1], sm))) {
                        sm = op(d[r1], sm)
                        r1--
                    }
                }
                return r1 + 1 - size
            }
            sm = op(d[r1], sm)
        } while ((r1 and -r1) != r1)
        return 0
    }

    private fun update(k: Int) {
        d[k] = op(d[2 * k], d[2 * k + 1])
    }

    private fun allApply (k: Int, f: F) {
        d[k] = mapping(f, d[k])
        if (k < size) {
            lz[k] = composition(f, lz[k])
        }
    }

    private fun push(k: Int) {
        allApply(2 * k, lz[k])
        allApply(2 * k + 1, lz[k])
        lz[k] = id
    }
}

fun PrintWriter.solve(sc: FastScanner) {
    val n = sc.nextInt()
    val a = Array(n) { sc.nextLong() }
    val seg = LazySegTree(n, ::minOf, Long.MAX_VALUE, { x, y -> x + y }, { x, y -> x + y }, 0L, a)
    val q = sc.nextInt()
    for (_i in 0 until q) {
        val k = sc.nextInt()
        val l = sc.nextInt() - 1
        val r = sc.nextInt()
        val c = sc.nextLong()
        if (k == 1) {
            seg.apply(l, r, c)
        } else {
            println(seg.prod(l, r))
        }
    }
}

fun main() {
    val writer = PrintWriter(System.out, false)
    writer.solve(FastScanner(System.`in`))
    writer.flush()
}

class FastScanner(s: InputStream) {
    private var st = StringTokenizer("")
    private val br = BufferedReader(InputStreamReader(s))

    fun next(): String {
        while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())

        return st.nextToken()
    }

    fun nextInt() = next().toInt()
    fun nextLong() = next().toLong()
    fun nextLine() = br.readLine()
    fun nextDouble() = next().toDouble()
    fun ready() = br.ready()
}
0