Submission #18760061

---

Source Code Expand

use proconio::{fastout, input};

fn sum(index: usize, arrays: &Vec<Vec<u64>>) -> u64 {
    let mut stack = Vec::new();
    let mut idx = index;
    let mut pos = 0;
    let mut value = 0;

    for _ in 0..arrays.len() {
        stack.push(idx);
        idx /= 2;
    }

    for i in 0..arrays.len() {
        let p = stack[stack.len() - i - 1];

        if p != pos {
            value ^= arrays[i][p - 1];
            pos = p;
        }

        pos *= 2;
    }

    value
}

fn multi(idx: usize, y: u64, arrays: &mut Vec<Vec<u64>>) {
    let mut index = idx;

    for i in (0..arrays.len()).rev() {
        arrays[i][index] ^= y;
        index /= 2;
    }
}

#[fastout]
fn main() {
    input! {in_n: usize, in_q: usize, in_as: [u64; in_n]};
    let mut arrays = Vec::new();
    let mut size = 1;

    arrays.push(vec![0; size]);

    while size < in_n {
        size *= 2;
        arrays.push(vec![0; size]);
    }

    for (i, v) in in_as.iter().enumerate() {
        let mut index = i;

        for j in (0..arrays.len()).rev() {
            arrays[j][index] ^= v;
            index /= 2;
        }
    }

    for _ in 0..in_q {
        input! {in_t: i32, in_x: u64, in_y: u64};

        if in_t == 2 {
            let start = (in_x - 1) as usize;
            let end = in_y as usize;
            println!("{}", sum(start, &arrays) ^ sum(end, &arrays));
        } else {
            let index = (in_x - 1) as usize;
            multi(index, in_y, &mut arrays);
        }
    }
}

Submission Info

Judge Result