#363826 (Rust) No.749 クエリ全部盛り

• 問題: No.749 クエリ全部盛り
• ユーザー: akakimidori
• 提出日時: 2019-07-29 19:18:35
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 352 ms / 3,000 ms
• コード長: 5,991 bytes
• コンパイル時間: 12,576 ms
• コンパイル使用メモリ: 400,772 KB
• 実行使用メモリ: 129,656 KB
• 最終ジャッジ日時: 2024-07-02 15:25:54
• 合計ジャッジ時間: 16,612 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	12 ms; 5,376 KB
testcase_11	AC	12 ms; 5,376 KB
testcase_12	AC	12 ms; 5,376 KB
testcase_13	AC	12 ms; 5,376 KB
testcase_14	AC	13 ms; 5,376 KB
testcase_15	AC	340 ms; 129,596 KB
testcase_16	AC	346 ms; 129,652 KB
testcase_17	AC	351 ms; 129,592 KB
testcase_18	AC	343 ms; 129,656 KB
testcase_19	AC	352 ms; 129,592 KB

ソースコード

// ---------- begin Lazy Segment Tree ----------

mod segment_tree {
    pub struct Lazy<T, E, F, G, H> {
        n: usize,
        k: usize,
        a: Vec<(T, E)>,
        e: T,
        id: E,
        f: F,
        g: G,
        h: H,
    }
    #[allow(dead_code)]
    impl<T: Copy, E: Copy, F: Fn(T, T) -> T, G: Fn(T, E) -> T, H: Fn(E, E) -> E> Lazy<T, E, F, G, H> {
        pub fn new(n: usize, e: T, id: E, f: F, g: G, h: H) -> Lazy<T, E, F, G, H> {
            let mut k = 0;
            while (1 << k) < n {
                k += 1;
            }
            Lazy {
                n: 1 << k,
                k: k,
                a: vec![(e, id); 2 << k],
                e: e,
                id: id,
                f: f,
                g: g,
                h: h,
            }
        }
        pub fn build_by(z: &Vec<T>, e: T, id: E, f: F, g: G, h: H) -> Lazy<T, E, F, G, H> {
            let n = z.len();
            let mut k = 0;
            while (1 << k) < n {
                k += 1;
            }
            let mut a = vec![(e, id); 2 << k];
            for i in 0..n {
                a[(1 << k) + i].0 = z[i];
            }
            for i in (1..(1 << k)).rev() {
                a[i].0 = f(g(a[2 * i].0, id), g(a[2 * i + 1].0, id));
            }
            Lazy {
                n: 1 << k,
                k: k,
                a: a,
                e: e,
                id: id,
                f: f,
                g: g,
                h: h,
            }
        }
        fn eval (&self, x: usize) -> T {
            (self.g)(self.a[x].0, self.a[x].1)
        }
        fn propagate (&mut self, mut x: usize) {
            x += self.n;
            for k in (1..(self.k + 1)).rev() {
                let y = x >> k;
                self.a[2 * y].1 = (self.h)(self.a[2 * y].1, self.a[y].1);
                self.a[2 * y + 1].1 = (self.h)(self.a[2 * y + 1].1, self.a[y].1);
                self.a[y].1 = self.id;
                self.a[y].0 = (self.f)(self.eval(2 * y), self.eval(2 * y + 1));
            }
        }
        fn save (&mut self, x: usize) {
            let mut k = (x + self.n) >> 1;
            while k > 0 {
                self.a[k].0 = (self.f)(self.eval(2 * k), self.eval(2 * k + 1));
                k >>= 1;
            }
        }
        pub fn update (&mut self, l: usize, r: usize, p: E) {
            self.propagate(l);
            self.propagate(r - 1);
            let mut x = l + self.n;
            let mut y = r + self.n;
            while x < y {
                if (x & 1) == 1 {
                    self.a[x].1 = (self.h)(self.a[x].1, p);
                    x += 1;
                }
                if (y & 1) == 1 {
                    y -= 1;
                    self.a[y].1 = (self.h)(self.a[y].1, p);
                }
                x >>= 1;
                y >>= 1;
            }
            self.save(l);
            self.save(r - 1);
        }
        pub fn find (&mut self, l: usize, r: usize) -> T {
            self.propagate(l);
            self.propagate(r - 1);
            let mut p = self.e;
            let mut q = self.e;
            let mut x = l + self.n;
            let mut y = r + self.n;
            while x < y {
                if (x & 1) == 1 {
                    p = (self.f)(p, self.eval(x));
                    x += 1;
                }
                if (y & 1) == 1 {
                    y -= 1;
                    q = (self.f)(self.eval(y), q);
                }
                x >>= 1;
                y >>= 1;
            }
            (self.f)(p, q)
        }
    }
}

// ---------- end Lazy Segment Tree ----------

//https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 より
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

// ここまで

fn run() {
    input! {
        n: usize,
        m: usize,
        p: [(u8, usize, usize, u64); m],
    }
    let mut z = vec![(0, 1, 0); n + 1];
    z[1].2 = 1;
    const MOD: u64 = 1000000007;
    for i in 2..n {
        z[i].2 = (z[i - 1].2 + z[i - 2].2) % MOD;
    }
    let f = |(a, b, c), (x, y, z)| ((a + x) % MOD, b + y, (c + z) % MOD);
    let g = |(a, b, c), (x, y, z)| ((a * x + b * y + c * z) % MOD, b, c);
    let h = |(x, y, z), (p, q, r)| (p * x % MOD, (p * y + q) % MOD, (p * z + r) % MOD);
    let mut s = segment_tree::Lazy::build_by(&z, (0, 0, 0), (1, 0, 0), f, g, h);
    let mut ans = String::new();
    for (p, l, r, k) in p {
        match p {
            0 => {
                let v = s.find(l, r + 1).0 * k % MOD;
                ans.push_str(&v.to_string());
                ans.push('\n');
            },
            1 => s.update(l, r + 1, (0, k, 0)),
            2 => s.update(l, r + 1, (1, k, 0)),
            3 => s.update(l, r + 1, (k, 0, 0)),
            4 => s.update(l, r + 1, (1, 0, k)),
            _ => (),
        }
    }
    print!("{}", ans);
}

fn main() {
    run();
}