結果

問題 No.1641 Tree Xor Query
ユーザー phsplsphspls
提出日時 2022-10-24 00:21:15
言語 Rust
(1.77.0)
結果
AC  
実行時間 255 ms / 5,000 ms
コード長 3,627 bytes
コンパイル時間 943 ms
コンパイル使用メモリ 150,904 KB
実行使用メモリ 24,428 KB
最終ジャッジ日時 2023-09-15 08:18:00
合計ジャッジ時間 2,760 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 1 ms
4,376 KB
testcase_08 AC 1 ms
4,380 KB
testcase_09 AC 1 ms
4,376 KB
testcase_10 AC 1 ms
4,380 KB
testcase_11 AC 1 ms
4,376 KB
testcase_12 AC 1 ms
4,376 KB
testcase_13 AC 255 ms
24,424 KB
testcase_14 AC 249 ms
24,428 KB
testcase_15 AC 3 ms
4,376 KB
testcase_16 AC 11 ms
4,384 KB
testcase_17 AC 8 ms
4,380 KB
testcase_18 AC 5 ms
4,380 KB
testcase_19 AC 6 ms
4,384 KB
testcase_20 AC 140 ms
18,308 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: field `orgn` is never read
 --> Main.rs:7:5
  |
5 | struct SegmentTree<F, T> {
  |        ----------- field in this struct
6 |     n: usize,
7 |     orgn: usize,
  |     ^^^^
  |
  = note: `SegmentTree` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis
  = note: `#[warn(dead_code)]` on by default

warning: associated function `find_closed` is never used
  --> Main.rs:29:8
   |
29 |     fn find_closed(&self, l: usize, r: usize) -> T {
   |        ^^^^^^^^^^^

warning: 2 warnings emitted

ソースコード

diff # 

const INF: usize = 1usize << 60;

#[derive(Debug, Clone)]
struct SegmentTree<F, T> {
    n: usize,
    orgn: usize,
    unit: T,
    mem: Vec<T>,
    operator: F
}

impl<F, T> SegmentTree<F, T> where
T: std::fmt::Debug + Copy,
F: Fn(T, T) -> T
{
    fn new(n: usize, unit: T, operator: F) -> Self {
        let mut size = 1usize;
        while size < n { size *= 2; }
        Self {
            n: size,
            orgn: n,
            unit: unit,
            mem: vec![unit; size*2-1],
            operator: operator,
        }
    }

    fn find_closed(&self, l: usize, r: usize) -> T {
        self.find(l, r+1)
    }

    fn find(&self, l: usize, r: usize) -> T {
        self._find(l, r, 0, 0, self.n)
    }

    fn set(&mut self, pos: usize, val: T) {
        let mut pos = pos + self.n - 1;
        self.mem[pos] = val;
        while pos > 0 {
            pos = self._parent(pos);
            self.mem[pos] = (self.operator)(self.mem[self._left(pos)], self.mem[self._right(pos)]);
        }
    }

    fn get(&mut self, pos: usize) -> T {
        self.mem[pos + self.n - 1]
    }

    fn _find(&self, a: usize, b: usize, nodenum: usize, l: usize, r: usize) -> T {
        if r <= a || b <= l {
            return self.unit;
        } else if a <= l && r <= b {
            return self.mem[nodenum];
        }
        let left = self._find(a, b, self._left(nodenum), l, (l+r)/2);
        let right = self._find(a, b, self._right(nodenum), (l+r)/2, r);
        (self.operator)(left, right)
    }
    fn _left(&self, k: usize) -> usize {
        2*k+1
    }
    fn _right(&self, k: usize) -> usize {
        2*k+2
    }
    fn _parent(&self, k: usize) -> usize {
        (k-1)/2
    }
}

fn ordering(cur: usize, prev: usize, idx: &mut usize, paths: &Vec<Vec<usize>>, starts: &mut Vec<usize>, ends: &mut Vec<usize>) {
    starts[cur] = *idx;
    *idx += 1;
    for &v in paths[cur].iter() {
        if v == prev { continue; }
        ordering(v, cur, idx, paths, starts, ends);
    }
    ends[cur] = *idx;
    *idx += 1;
}

fn main() {
    let mut nq = String::new();
    std::io::stdin().read_line(&mut nq).ok();
    let nq: Vec<usize> = nq.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let n = nq[0];
    let q = nq[1];
    let mut c = String::new();
    std::io::stdin().read_line(&mut c).ok();
    let c: Vec<usize> = c.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let mut paths = vec![vec![]; n];
    for _ in 0..n-1 {
        let mut ab = String::new();
        std::io::stdin().read_line(&mut ab).ok();
        let ab: Vec<usize> = ab.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
        let a = ab[0]-1;
        let b = ab[1]-1;
        paths[a].push(b);
        paths[b].push(a);
    }
    let queries = (0..q).map(|_| {
            let mut temp = String::new();
            std::io::stdin().read_line(&mut temp).ok();
            let temp: Vec<usize> = temp.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
            (temp[0], temp[1], temp[2])
        })
        .collect::<Vec<_>>();

    let mut starts = vec![INF; n];
    let mut ends = vec![INF; n];
    let mut idx = 0usize;
    ordering(0, 0, &mut idx, &paths, &mut starts, &mut ends);
    let mut segtree = SegmentTree::new(2*n, 0usize, |x, y| x ^ y);
    for i in 0..n {
        segtree.set(starts[i], c[i]);
    }
    for &(t, x, y) in queries.iter() {
        if t == 1 {
            let val = segtree.get(starts[x-1]);
            segtree.set(starts[x-1], val ^ y)
        } else {
            println!("{}", segtree.find(starts[x-1], ends[x-1]));
        }
    }
}
0