結果

問題 No.1641 Tree Xor Query
ユーザー 👑 箱箱
提出日時 2021-08-06 22:22:47
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 1,349 ms / 5,000 ms
コード長 4,821 bytes
コンパイル時間 20,925 ms
コンパイル使用メモリ 475,028 KB
実行使用メモリ 109,192 KB
最終ジャッジ日時 2023-10-17 03:47:28
合計ジャッジ時間 28,380 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 278 ms
55,944 KB
testcase_01 AC 274 ms
55,952 KB
testcase_02 AC 274 ms
55,960 KB
testcase_03 AC 280 ms
56,004 KB
testcase_04 AC 284 ms
56,064 KB
testcase_05 AC 283 ms
56,068 KB
testcase_06 AC 293 ms
56,060 KB
testcase_07 AC 283 ms
56,036 KB
testcase_08 AC 280 ms
55,976 KB
testcase_09 AC 281 ms
56,028 KB
testcase_10 AC 284 ms
56,012 KB
testcase_11 AC 282 ms
55,988 KB
testcase_12 AC 278 ms
55,980 KB
testcase_13 AC 1,349 ms
109,192 KB
testcase_14 AC 1,325 ms
108,264 KB
testcase_15 AC 437 ms
60,244 KB
testcase_16 AC 491 ms
62,260 KB
testcase_17 AC 469 ms
60,912 KB
testcase_18 AC 461 ms
61,356 KB
testcase_19 AC 415 ms
62,164 KB
testcase_20 AC 1,203 ms
86,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.PrintWriter
import java.util.*
import kotlin.math.*

fun PrintWriter.solve() {
    val n = nextInt()
    val q = nextInt()
    val c = Array(n) { nextInt() }
    val adj = Array(n) { mutableListOf<Int>() }
    for (i in 0 until n - 1) {
        val v1 = nextInt() - 1
        val v2 = nextInt() - 1
        adj[v1].add(v2)
        adj[v2].add(v1)
    }
    val tin = Array(n) { 0 }
    val tout = Array(n) { 0 }
    var time = 0
    fun dfs(v: Int, p: Int) {
        tin[v] = time
        time++
        for (w in adj[v]) {
            if (w != p) {
                dfs(w, v)
            }
        }
        tout[v] = time
        time++
    }
    dfs(0, -1)
    val seg = SegTree(2 * n, Int::xor, 0)
    for (i in 0 until n) {
        seg[tin[i]] = c[i]
    }
    for (i in 0 until q) {
        val t = nextInt()
        val x = nextInt() - 1
        val y = nextInt()
        if (t == 1) {
            seg[tin[x]] = seg[tin[x]] xor y
        } else {
            println(seg.prod(tin[x]..tout[x]))
        }
    }
}

class SegTree<Monoid>(private val n: Int, private val op: (Monoid, Monoid) -> Monoid, private val e: Monoid) {
    private var d: MutableList<Monoid>
    private var size = 1
    private var log = 0

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

    constructor(a: Array<Monoid>, op: (Monoid, Monoid) -> Monoid, e: Monoid) : this(a.count(), op, e) {
        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) {
        if (p !in 0 until n) {
            throw IllegalArgumentException()
        }
        val p1 = p + size
        d[p1] = x
        for (i in 1..log) {
            update(p1 shr i)
        }
    }

    operator fun get(p: Int): Monoid {
        if (p !in 0 until n) {
            throw IllegalArgumentException()
        }
        return d[p + size]
    }

    fun prod(range: IntRange): Monoid {
        val l = range.first
        val r = range.last + 1
        if (l !in 0..r || r > n) {
            throw IllegalArgumentException()
        }
        var sml = e
        var smr = e
        var l1 = l + size
        var r1 = r + size
        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 maxRight(l: Int, f: (Monoid) -> Boolean): Int {
        if (l !in 0..n || !f(e)) {
            throw IllegalArgumentException()
        }
        if (l == n) return n
        var l1 = l + size
        var sm = e
        do {
            while (l1 % 2 == 0) l1 /= 2
            if (!f(op(sm, d[l1]))) {
                while (l1 < size) {
                    l1 *= 2
                    if (f(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, f: (Monoid) -> Boolean): Int {
        if (r !in 0..n || !f(e)) {
            throw IllegalArgumentException()
        }
        if (r == 0) return 0
        var r1 = r + size
        var sm = e
        do {
            r1--
            while (r1 > 1 && r1 % 2 != 0) r1 /= 2
            if (!f(op(d[r1], sm))) {
                while (r1 < size) {
                    r1 = 2 * r1 + 1
                    if (f(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])
    }

    fun joinToString(s: String = ", "): String {
        return (0 until n).map { this[it] }.joinToString(s)
    }
}

fun main2() {
    val writer = PrintWriter(System.out, false)
    writer.solve()
    writer.flush()
}

fun main() = Thread(null, ::main2, "", 64 * 1024 * 1024)
        .apply { setUncaughtExceptionHandler { _, e -> e.printStackTrace(); kotlin.system.exitProcess(1) } }
        .apply { start() }.join()

// region Scanner
private var st = StringTokenizer("")
private val br = System.`in`.bufferedReader()

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()
// endregion
0