結果

問題 No.880 Yet Another Segment Tree Problem
ユーザー akakimidoriakakimidori
提出日時 2021-02-03 19:52:18
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 232 ms / 5,000 ms
コード長 7,780 bytes
コンパイル時間 13,688 ms
コンパイル使用メモリ 380,480 KB
実行使用メモリ 13,184 KB
最終ジャッジ日時 2024-09-22 19:56:12
合計ジャッジ時間 19,416 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 1 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 3 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 222 ms
12,544 KB
testcase_12 AC 211 ms
12,544 KB
testcase_13 AC 150 ms
12,288 KB
testcase_14 AC 207 ms
13,056 KB
testcase_15 AC 217 ms
13,056 KB
testcase_16 AC 229 ms
13,056 KB
testcase_17 AC 206 ms
13,056 KB
testcase_18 AC 198 ms
13,184 KB
testcase_19 AC 92 ms
13,056 KB
testcase_20 AC 89 ms
13,184 KB
testcase_21 AC 92 ms
12,928 KB
testcase_22 AC 90 ms
13,056 KB
testcase_23 AC 91 ms
12,928 KB
testcase_24 AC 85 ms
13,056 KB
testcase_25 AC 91 ms
13,184 KB
testcase_26 AC 87 ms
12,928 KB
testcase_27 AC 88 ms
13,056 KB
testcase_28 AC 90 ms
12,800 KB
testcase_29 AC 201 ms
13,056 KB
testcase_30 AC 214 ms
13,056 KB
testcase_31 AC 232 ms
13,056 KB
testcase_32 AC 78 ms
13,184 KB
testcase_33 AC 83 ms
13,056 KB
testcase_34 AC 90 ms
13,056 KB
testcase_35 AC 83 ms
13,056 KB
testcase_36 AC 86 ms
13,056 KB
testcase_37 AC 83 ms
13,056 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// begin おためしbeats
pub trait Beats {
    type Value: Clone;
    fn merge(l: &Self::Value, r: &Self::Value) -> Self::Value;
    fn propagate(p: &mut Self::Value, c: &mut [Self::Value]);
    fn e() -> Self::Value;
}

pub trait Effect {
    type Value;
    type Query;
    fn break_cond(x: &Self::Value, q: &Self::Query) -> bool;
    fn tag_cond(x: &Self::Value, q: &Self::Query) -> bool;
    fn update(x: &mut Self::Value, q: &Self::Query);
}

struct SegmentTreeBeats<R: Beats> {
    size: usize,
    val: Box<[R::Value]>,
    dfs: Vec<(usize, usize, usize)>,
}

impl<R: Beats> SegmentTreeBeats<R> {
    fn new(ini: &[R::Value]) -> Self {
        let size = ini.len().next_power_of_two();
        let val = vec![R::e(); 2 * size];
        let mut val = val.into_boxed_slice();
        val[size..(size + ini.len())].clone_from_slice(ini);
        for i in (1..size).rev() {
            val[i] = R::merge(&val[2 * i], &val[2 * i + 1]);
        }
        SegmentTreeBeats {
            size,
            val,
            dfs: vec![],
        }
    }
    fn update<E: Effect<Value = R::Value>>(&mut self, x: usize, y: usize, f: E::Query) {
        assert!(x <= y && y <= self.size);
        if x >= y {
            return;
        }
        let val = &mut self.val;
        self.dfs.push((1, 0, self.size));
        while let Some((k, l, r)) = self.dfs.pop() {
            if k > 2 * self.size {
                let k = !k;
                val[k] = R::merge(&val[2 * k], &val[2 * k + 1]);
                continue;
            }
            if E::break_cond(&val[k], &f) {
                continue;
            }
            if x <= l && r <= y && E::tag_cond(&val[k], &f) {
                E::update(&mut val[k], &f);
                continue;
            }
            let (a, b) = val.split_at_mut(2 * k);
            R::propagate(&mut a[k], &mut b[..2]);
            self.dfs.push((!k, l, r));
            let m = (l + r) / 2;
            if m < y {
                self.dfs.push((2 * k + 1, m, r));
            }
            if x < m {
                self.dfs.push((2 * k, l, m));
            }
        }
    }
    fn find(&mut self, x: usize, y: usize) -> R::Value {
        assert!(x <= y && y <= self.size);
        let mut res = R::e();
        if x >= y {
            return res;
        }
        let val = &mut self.val;
        self.dfs.push((1, 0, self.size));
        while let Some((k, l, r)) = self.dfs.pop() {
            if x <= l && r <= y {
                res = R::merge(&res, &val[k]);
                continue;
            }
            let (a, b) = val.split_at_mut(2 * k);
            R::propagate(&mut a[k], &mut b[..2]);
            let m = (l + r) / 2;
            if m < y {
                self.dfs.push((2 * k + 1, m, r));
            }
            if x < m {
                self.dfs.push((2 * k, l, m));
            }
        }
        res
    }
}
// end おためしbeats
// ---------- begin binary_gcd ----------
pub fn gcd(a: u64, b: u64) -> u64 {
    if a == 0 || b == 0 {
        return a + b;
    }
    let x = a.trailing_zeros();
    let y = b.trailing_zeros();
    let mut a = a >> x;
    let mut b = b >> y;
    while a != b {
         let x = (a ^ b).trailing_zeros();
        if a < b {
            std::mem::swap(&mut a, &mut b);
        }
        a = (a - b) >> x;
    }
    a << x.min(y)
}
// ---------- end binary_gcd ----------
// ---------- begin Scanner(require delimiter) ----------
mod scanner {
    pub struct Scanner<R> {
        reader: R,
        buf: Vec<u8>,
    }
    #[allow(dead_code)]
    impl<R: std::io::BufRead> Scanner<R> {
        pub fn new(reader: R) -> Self {
            Scanner {
                reader: reader,
                buf: Vec::with_capacity(1024),
            }
        }
        fn read(&mut self, del: u8) {
            self.buf.clear();
            self.reader.read_until(del, &mut self.buf).ok();
            assert!(self.buf.pop().unwrap() == del);
        }
        pub fn next<T: std::str::FromStr>(&mut self, del: u8) -> T {
            self.read(del);
            std::str::from_utf8(&self.buf)
                .unwrap()
                .trim()
                .parse::<T>()
                .ok()
                .unwrap()
        }
        pub fn next_bytes(&mut self, del: u8) -> Vec<u8> {
            self.read(del);
            std::str::from_utf8(&self.buf)
                .unwrap()
                .trim()
                .bytes()
                .collect()
        }
    }
}
// ---------- end scanner(require delimiter) ----------

use std::io::Write;

fn main() {
    let stdin = std::io::stdin();
    let mut sc = scanner::Scanner::new(stdin.lock());
    run(&mut sc);
}

const INF: u64 = 1_000_000_000 + 1;

fn lcm(a: u64, b: u64) -> u64 {
    if a >= INF || b >= INF {
        return INF;
    }
    let g = gcd(a, b);
    std::cmp::min(INF, a * b / g)
}

#[derive(Clone, Debug)]
struct Value {
    lcm: u64,
    max: u64,
    sum: u64,
    len: u64,
}

struct Chgcd;
impl Effect for Chgcd {
    type Value = Value;
    type Query = u64;
    fn break_cond(x: &Self::Value, q: &Self::Query) -> bool {
        *q % x.lcm == 0
    }
    fn tag_cond(x: &Self::Value, _: &Self::Query) -> bool {
        x.max * x.len == x.sum
    }
    fn update(x: &mut Self::Value, q: &Self::Query) {
        let v = gcd(*q, x.max);
        x.max = v;
        x.lcm = v;
        x.sum = v * x.len;
    }
}

struct Set;
impl Effect for Set {
    type Value = Value;
    type Query = u64;
    fn break_cond(_: &Self::Value, _: &Self::Query) -> bool {
        false
    }
    fn tag_cond(_: &Self::Value, _: &Self::Query) -> bool {
        true
    }
    fn update(x: &mut Self::Value, q: &Self::Query) {
        x.max = *q;
        x.lcm = *q;
        x.sum = *q * x.len;
    }
}

struct Yuki880;
impl Beats for Yuki880 {
    type Value = Value;
    fn merge(l: &Self::Value, r: &Self::Value) -> Self::Value {
        Value {
            lcm: lcm(l.lcm, r.lcm),
            max: std::cmp::max(l.max, r.max),
            sum: l.sum + r.sum,
            len: l.len + r.len,
        }
    }
    fn propagate(p: &mut Self::Value, c: &mut [Self::Value]) {
        let v = p.max;
        if v * p.len == p.sum {
            for c in c.iter_mut() {
                c.lcm = v;
                c.max = v;
                c.sum = v * c.len;
            }
        }
    }
    fn e() -> Self::Value {
        Value {
            lcm: 1,
            max: 0,
            sum: 0,
            len: 0,
        }
    }
}

fn run<R: std::io::BufRead>(sc: &mut scanner::Scanner<R>) {
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    let n: usize = sc.next(b' ');
    let q: usize = sc.next(b'\n');
    let mut ini = Vec::with_capacity(n);
    for i in 0..n {
        let d = if i == n - 1 {b'\n'} else {b' '};
        let v: u64 = sc.next(d);
        ini.push(Value {
            lcm: v,
            max: v,
            sum: v,
            len: 1,
        });
    }
    let mut seg = SegmentTreeBeats::<Yuki880>::new(&ini);
    for _ in 0..q {
        let op: u8 = sc.next(b' ');
        let (l, r, x) = if op <= 2 {
            let l: usize = sc.next(b' ');
            let r: usize = sc.next(b' ');
            let x: u64 = sc.next(b'\n');
            (l - 1, r, x)
        } else {
            let l: usize = sc.next(b' ');
            let r: usize = sc.next(b'\n');
            (l - 1, r, 0)
        };
        if op == 1 {
            seg.update::<Set>(l, r, x);
        } else if op == 2 {
            seg.update::<Chgcd>(l, r, x);
        } else if op == 3 {
            let ans = seg.find(l, r).max;
            writeln!(out, "{}", ans).ok();
        } else {
            let ans = seg.find(l, r).sum;
            writeln!(out, "{}", ans).ok();
        }
    }
}
0