結果

問題 No.1234 典型RMQ
ユーザー 👑 箱星箱星
提出日時 2020-10-09 03:45:15
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 1,667 ms / 2,000 ms
コード長 4,500 bytes
コンパイル時間 17,218 ms
コンパイル使用メモリ 453,816 KB
実行使用メモリ 109,464 KB
最終ジャッジ日時 2024-04-26 11:43:06
合計ジャッジ時間 52,702 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 296 ms
54,172 KB
testcase_01 AC 299 ms
53,952 KB
testcase_02 AC 297 ms
54,260 KB
testcase_03 AC 300 ms
54,296 KB
testcase_04 AC 297 ms
54,208 KB
testcase_05 AC 292 ms
54,428 KB
testcase_06 AC 1,531 ms
107,424 KB
testcase_07 AC 1,322 ms
92,260 KB
testcase_08 AC 1,591 ms
109,344 KB
testcase_09 AC 1,573 ms
97,932 KB
testcase_10 AC 1,519 ms
108,100 KB
testcase_11 AC 1,467 ms
106,284 KB
testcase_12 AC 1,667 ms
105,532 KB
testcase_13 AC 1,300 ms
92,456 KB
testcase_14 AC 1,636 ms
105,324 KB
testcase_15 AC 1,599 ms
105,624 KB
testcase_16 AC 1,596 ms
109,464 KB
testcase_17 AC 1,501 ms
99,248 KB
testcase_18 AC 1,063 ms
88,456 KB
testcase_19 AC 1,594 ms
108,664 KB
testcase_20 AC 1,118 ms
103,660 KB
testcase_21 AC 1,647 ms
108,024 KB
testcase_22 AC 1,237 ms
101,268 KB
testcase_23 AC 1,223 ms
101,136 KB
testcase_24 AC 1,231 ms
101,072 KB
testcase_25 AC 1,251 ms
100,120 KB
testcase_26 AC 1,292 ms
99,900 KB
testcase_27 AC 294 ms
54,132 KB
testcase_28 AC 298 ms
54,136 KB
testcase_29 AC 301 ms
54,152 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

class LazySegTree(private val n: Int) : Iterable<Long> {
    private var d: MutableList<Long>
    private var lz: MutableList<Long>
    private var size = 1
    private var log = 0
    private val e = Long.MAX_VALUE
    private val id = 0L

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

    constructor(n: Int, a: Array<Long>) : this(n) {
        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: Long) {
        if (p !in 0 until n) {
            throw Exception()
        }
        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): Long {
        if (p !in 0 until n) {
            throw Exception()
        }
        val p1 = p + size
        for (i in log downTo 1) {
            push(p1 shr i)
        }
        return d[p1]
    }

    fun prod(l: Int, r: Int): Long {
        if (l !in 0..r || r !in l..n) {
            throw Exception()
        }
        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 = minOf(sml, d[l1++])
            if (r1 and 1 != 0) smr = minOf(d[--r1], smr)
            l1 /= 2
            r1 /= 2
        }
        return minOf(sml, smr)
    }

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

    fun apply(p: Int, f: Long) {
        if (p !in 0 until n) {
            throw Exception()
        }
        val p1 = p + size
        for (i in log downTo 1) {
            push(p1 shr i)
        }
        d[p1] = f + d[p1]
        for (i in 1..log) {
            update(p1 shr i)
        }
    }

    fun apply(l: Int, r: Int, f: Long) {
        if (l !in 0..r || r !in l..n) {
            throw Exception()
        }
        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)
        }
    }

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

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

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

    override fun iterator(): Iterator<Long> {
        return (0 until n).map { this[it] }.iterator()
    }
}

fun PrintWriter.solve(sc: FastScanner) {
    val n = sc.nextInt()
    val a = Array(n) { sc.nextLong() }
    val seg = LazySegTree(n, 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