#1165886 (Rust) No.3494 一点挿入区間和取得

• 問題: No.3494 一点挿入区間和取得
• ユーザー: 👑 ArcAki
• 提出日時: 2026-05-22 11:20:43
• 言語: Rust (1.94.0 + proconio + num + itertools)
• 結果: AC
• 実行時間: 84 ms / 6,000 ms
• コード長: 16,055 bytes
• コンパイル時間: 13,868 ms
• コンパイル使用メモリ: 205,068 KB
• 実行使用メモリ: 11,356 KB
• 最終ジャッジ日時: 2026-05-22 11:21:01
• 合計ジャッジ時間: 15,683 ms
• ジャッジサーバーID （参考情報）: judge2_1 / judge3_0

ファイルパターン	結果
other	AC * 23

ソースコード

#[allow(unused_imports)]
use std::{
    convert::{Infallible, TryFrom, TryInto as _}, fmt::{self, Debug, Display, Formatter,},
    fs::File, hash::{Hash, Hasher, BuildHasherDefault}, iter::{Product, Sum}, marker::PhantomData,
    ops::{Add, AddAssign, Sub, SubAssign, Div, DivAssign, Mul, MulAssign, Neg, RangeBounds},
    str::FromStr, sync::{atomic::{self, AtomicU32, AtomicU64}, Once},
    collections::{*, btree_set::Range, btree_map::Range as BTreeRange}, mem::{swap},
    cmp::{self, Reverse, Ordering, Eq, PartialEq, PartialOrd},
    thread::LocalKey, f64::consts::PI, time::Instant, cell::RefCell,
    io::{self, stdin, Read, read_to_string, BufWriter, BufReader, stdout, Write},
    ptr::null_mut,
};
pub mod fxhash {
    use std::hash::BuildHasherDefault;
    const K: u64 = 0x517c_c1b7_2722_0a95;
    #[derive(Default)]
    pub struct FxHasher {
        pub hash: u64,
    }
    impl FxHasher {
        #[inline(always)]
        fn mix_u64(mut h: u64, x: u64) -> u64 {
            h = h.rotate_left(5) ^ x;
            h = h.wrapping_mul(K);
            let x2 = x ^ (x >> 33) ^ (x << 11);
            h = h.rotate_left(5) ^ x2;
            h = h.wrapping_mul(K);
            h
        }

        #[inline(always)]
        fn write_u64_impl(&mut self, x: u64) {
            self.hash = Self::mix_u64(self.hash, x);
        }
    }

    impl std::hash::Hasher for FxHasher {
        #[inline(always)]
        fn finish(&self) -> u64 {
            self.hash
        }

        #[inline(always)]
        fn write(&mut self, bytes: &[u8]) {
            let mut h = self.hash;
            for &b in bytes {
                h = h.rotate_left(5) ^ (b as u64);
                h = h.wrapping_mul(K);
            }
            self.hash = h;
        }

        #[inline(always)]
        fn write_u64(&mut self, i: u64) { self.write_u64_impl(i); }
        #[inline(always)]
        fn write_u32(&mut self, i: u32) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_u16(&mut self, i: u16) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_u8 (&mut self, i: u8 ) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_usize(&mut self, i: usize) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_i64(&mut self, i: i64) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_i32(&mut self, i: i32) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_i16(&mut self, i: i16) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_i8 (&mut self, i: i8 ) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_isize(&mut self, i: isize) { self.write_u64_impl(i as u64); }
    }

    pub type FxBuildHasher = BuildHasherDefault<FxHasher>;
    pub type FxMap<K, V> = std::collections::HashMap<K, V, FxBuildHasher>;
    pub type FxSet<K> = std::collections::HashSet<K, FxBuildHasher>;
}

pub fn gcd(mut a: i64, mut b: i64)->i64{if a==0{return b;}else if b==0{return a;}let l1 = a.trailing_zeros();let l2 = b.trailing_zeros();
a >>= l1; b >>= l2;while a!=b{let x = (a^b).trailing_zeros();if a<b{swap(&mut a, &mut b)}a = (a-b)>>x;}a << l1.min(l2)}
pub fn factorial_i64(n: usize)->(Vec<i64>, Vec<i64>){ 
    let mut res = vec![1; n+1];let mut inv = vec![1; n+1];for i in 0..n{ res[i+1] = (res[i]*(i+1)as i64)%MOD; }
    inv[n] = mod_inverse(res[n], MOD);for i in (0..n).rev(){ inv[i] = inv[i+1]*(i+1) as i64%MOD; }(res, inv) }
pub fn floor(a:i64, b:i64)->i64{let res=(a%b+b)%b;(a-res)/b}
pub fn modulo(a: i64, b: i64)->i64{(a%b+b)%b}
pub fn extended_gcd(a:i64,b:i64)->(i64,i64,i64)
{if b==0{(a,1,0)}else{let(g,x,y)=extended_gcd(b,a%b);(g,y,x-floor(a,b)*y)}}
pub fn mod_inverse(a:i64,m:i64)->i64{let(_,x,_) =extended_gcd(a,m);(x%m+m)%m}
pub fn comb(a: i64, b: i64, f: &Vec<(i64, i64)>)->i64{
    if a<b{return 0;}else if b==0 || a==b{ return 1; }
    else{let x=f[a as usize].0;
        let y=f[(a-b) as usize].1;let z=f[b as usize].1;return((x*y)%MOD)*z%MOD;}}
pub fn factorial(x: i64)->Vec<(i64, i64)>{
    let mut f=vec![(1i64,1i64),(1, 1)];let mut z = 1i64;
    let mut inv = vec![0; x as usize+10];inv[1] = 1;
    for i in 2..x+1{z=(z*i)%MOD;
        let w=(MOD-inv[(MOD%i)as usize]*(MOD/i)%MOD)%MOD;
        inv[i as usize] = w;
        f.push((z, (f[i as usize-1].1*w)%MOD));}return f;}
pub fn fast_mod_pow(mut x: i64,p: usize, m: i64)->i64{
    x %= m;
    let mut res=1;let mut t=x;let mut z=p;while z > 0{
        if z%2==1{res = (res*t)%m;}t = (t*t)%m;z /= 2; }res}

pub trait SortD{ fn sort_d(&mut self); }
impl<T: Ord> SortD for Vec<T>{ fn sort_d(&mut self) {self.sort_by(|u, v| v.cmp(&u));} }
pub trait Mx{fn max(&self, rhs: Self)->Self;}
impl Mx for f64{ fn max(&self, rhs: Self)->Self{if *self < rhs{ rhs } else { *self } }}
pub trait Mi{ fn min(&self, rhs: Self)->Self; }
impl Mi for f64{ fn min(&self, rhs: Self)->Self{ if *self > rhs{ rhs } else { *self } } }
pub trait Chmax: PartialOrd + Copy {fn chmax(&mut self, rhs: Self) {if *self < rhs { *self = rhs; }}}
impl<T: PartialOrd + Copy> Chmax for T {}
pub trait Chmin: PartialOrd + Copy {fn chmin(&mut self, rhs: Self) {if *self > rhs { *self = rhs; }}}
impl<T: PartialOrd + Copy> Chmin for T {}
#[allow(unused)]
use proconio::{*, marker::*};
#[allow(unused)]
use fxhash::FxMap;

#[allow(dead_code)]
const INF: i64 = 1<<60;
#[allow(dead_code)]
const I: i32 = 1<<30;
#[allow(dead_code)]
const MOD: i64 = 998244353;
#[allow(dead_code)]
const D: [(usize, usize); 4] = [(1, 0), (0, 1), (!0, 0), (0, !0)];
#[allow(dead_code)]
pub fn c2d(c: u8)->(usize, usize){match c{b'U'=>(!0,0),b'D'=>(1,0),b'L'=>(0,!0),b'R'=>(0,1),_=>unreachable!()}}
#[allow(dead_code)]
pub fn c2d_i64(c: u8)->(i64, i64){match c{b'U'=>(-1,0),b'D'=>(1,0),b'L'=>(0,-1),b'R'=>(0,1),_=>unreachable!()}}
#[allow(dead_code)]
const D2: [(usize, usize); 8] = [(1, 0), (1, 1), (0, 1), (!0, 1), (!0, 0), (!0, !0), (0, !0), (1, !0)];

pub trait SplayMonoid {
    type S: Clone+Debug;
    fn identity() -> Self::S;
    fn op(a: &Self::S, b: &Self::S) -> Self::S;
    fn reverse_prod(x: &mut Self::S);
}

pub trait SplayLazyMonoid{
    type M: SplayMonoid;
    type F: Clone+Debug;
    fn id_e()-><Self::M as SplayMonoid>::S{<Self::M as SplayMonoid>::identity()}
    fn op(a: &<Self::M as SplayMonoid>::S, b: &<Self::M as SplayMonoid>::S)-><Self::M as SplayMonoid>::S{<Self::M>::op(a, b)}
    fn reverse_prod(x: &mut <Self::M as SplayMonoid>::S) {<Self::M>::reverse_prod(x)}
    fn identity()->Self::F;
    fn map(f: &Self::F, x: &<Self::M as SplayMonoid>::S)-><Self::M as SplayMonoid>::S;
    fn composition(f: &Self::F, g: &Self::F)->Self::F;
}

#[derive(Clone, Debug)]
pub struct Node<F> where F: SplayLazyMonoid{
    l: *mut Node<F>,
    r: *mut Node<F>,
    p: *mut Node<F>,
    data: <F::M as SplayMonoid>::S,
    prod: <F::M as SplayMonoid>::S,
    lazy: F::F,
    idx: usize,
    _w: usize,
    ac: usize,
    rev: bool,
}

impl<F> Node<F> where F: SplayLazyMonoid{
    pub fn new_nil() -> Self {
        Node {
            l: null_mut(),
            r: null_mut(),
            p: null_mut(),
            data: F::id_e(),
            prod: F::id_e(),
            lazy: F::identity(),
            idx: !0,
            _w: 0,
            ac: 0,
            rev: false,
        }
    }

    pub fn new(x: <F::M as SplayMonoid>::S, idx: usize, nil: *mut Node<F>) -> Self {
        Node {
            l: nil,
            r: nil,
            p: nil,
            data: x.clone(),
            prod: x.clone(),
            lazy: F::identity(),
            idx,
            _w: 1,
            ac: 1,
            rev: false,
        }
    }
}

pub struct SplayTree<F>  where F: SplayLazyMonoid{
    _p_nil: Box<Node<F>>,
    nil: *mut Node<F>,
    data: Vec<Box<Node<F>>>,
    r: *mut Node<F>,
}

impl<F> SplayTree<F> where F: SplayLazyMonoid {
    pub fn new() -> Self {
        let mut _p_nil = Box::new(Node::<F>::new_nil());
        let ptr: *mut Node<F> = &mut *_p_nil;
        (*_p_nil).l = ptr;
        (*_p_nil).r = ptr;
        (*_p_nil).p = ptr;
        SplayTree {
            _p_nil,
            nil: ptr,
            data: Vec::new(),
            r: ptr,
        }
    }

    #[inline(always)]
    fn apply_down(&mut self, c: *mut Node<F>) {
        unsafe{
            if (*c).l != self.nil {
            (*(*c).l).data = F::map(&(*c).lazy, &(*(*c).l).data);
            (*(*c).l).prod = F::map(&(*c).lazy, &(*(*c).l).prod);
            (*(*c).l).lazy = F::composition(&(*c).lazy, &(*(*c).l).lazy);
        }
        if (*c).r != self.nil {
            (*(*c).r).data = F::map(&(*c).lazy, &(*(*c).r).data);
            (*(*c).r).prod = F::map(&(*c).lazy, &(*(*c).r).prod);
            (*(*c).r).lazy = F::composition(&(*c).lazy, &(*(*c).r).lazy);
        }
        if (*c).rev {
            swap(&mut (*c).l, &mut (*c).r);
            if (*c).l != self.nil {
                (*(*c).l).rev ^= true;
                F::reverse_prod(&mut (*(*c).l).prod);
            }
            if (*c).r != self.nil {
                (*(*c).r).rev ^= true;
                F::reverse_prod(&mut (*(*c).r).prod);
            }
            (*c).rev = false;
        }
        (*c).lazy = F::identity();
        }
    }

    #[inline(always)]
    fn upprod(&mut self, c: *mut Node<F>) {
        unsafe{
        (*c).ac = (*(*c).l).ac + (*(*c).r).ac+1;
        (*c).prod = F::op(&F::op(&(*(*c).l).prod, &(*c).data), &(*(*c).r).prod);
        }
    }

    #[inline(always)]
    fn pc(&mut self, p: *mut Node<F>) -> *mut *mut Node<F> {
        unsafe{
        if (*p).p == self.nil {&mut self.r}
        else if (*(*p).p).l==p {&mut (*(*p).p).l}
        else {&mut (*(*p).p).r}
        }
    }

    #[inline(always)]
    fn rotleft(&mut self, c: *mut Node<F>) {
        unsafe{
        let p = (*c).p;
        *self.pc(p) = c;
        (*c).p = (*p).p;
        (*p).p = c;
        if (*c).l != self.nil {(*(*c).l).p = p}
        (*p).r = (*c).l;
        (*c).l = p;
        }
    }

    #[inline(always)]
    fn rotright(&mut self, c: *mut Node<F>) {
        unsafe{
        let p = (*c).p;
        *self.pc(p) = c;
        (*c).p = (*p).p;
        (*p).p = c;
        if (*c).r != self.nil {(*(*c).r).p = p}
        (*p).l = (*c).r;
        (*c).r = p;
        }
    }

    #[inline(always)]
    fn splay(&mut self, c: *mut Node<F>) {
        unsafe{
        self.apply_down(c);
        while (*c).p != self.nil {
            let p = (*c).p;
            let pp = (*p).p;
            if pp != self.nil {
                self.apply_down(pp);
            }
            if p != self.nil {
                self.apply_down(p);
            }
            self.apply_down(c);
            if (*p).l == c {
                if pp == self.nil {self.rotright(c);}
                else if (*pp).l == p{self.rotright(p); self.rotright(c)}
                else if (*pp).r == p{self.rotright(c); self.rotleft(c)}
            } else {
                if pp == self.nil {self.rotleft(c)}
                else if (*pp).r == p {self.rotleft(p); self.rotleft(c)}
                else if (*pp).l == p {self.rotleft(c); self.rotright(c)}
            }
            if pp != self.nil {self.upprod(pp)}
            if p != self.nil {self.upprod(p)}
            self.upprod(c);
        }
        self.upprod(c);
        }
    }

    // 0-indexed
    #[inline(always)]
    fn kth(&mut self, mut k: usize) -> *mut Node<F> {
        unsafe{
        let mut c = self.r;
        loop {
            self.apply_down(c);
            if (*(*c).l).ac == k{break;}
            if (*(*c).l).ac > k{c = (*c).l; continue;}
            k -= (*(*c).l).ac+1;
            c = (*c).r;
        }
        self.apply_down(c);
        self.splay(c);
        c
        }
    }

    #[inline]
    pub fn insert(&mut self, k: usize, x: <F::M as SplayMonoid>::S){
        unsafe{let idx = self.data.len();
        let x = Box::new(Node::new(x, idx, self.nil));
        let c = Box::leak(x);
        self.data.push(Box::from_raw(c));
        if k==0 {
            (*c).r = self.r;
            if self.r != self.nil {
                (*self.r).p = c;
            }
            self.r = c;
            self.upprod(c);
            return;
        } else if k == (*self.r).ac {
            (*c).l = self.r;
            if self.r != self.nil {
                (*self.r).p = c;
            }
            self.r = c;
            self.upprod(c);
            return;
        }
        let p = self.kth(k);
        (*c).l = (*p).l;
        (*c).r = p;
        self.r = c;
        (*(*p).l).p = c;
        (*p).p = c;
        (*p).l = self.nil;
        self.upprod(p);
        self.upprod(c);
        self.splay(c);}
    }

    #[inline]
    pub fn erase(&mut self, k: usize) {
        unsafe{let p = self.kth(k);
        if k == 0{
            self.r = (*p).r;
            if self.r != self.nil {
                (*self.r).p = self.nil;
            }
        } else if k == (*self.r).ac-1{
            self.r = (*p).l;
            if self.r != self.nil {
                (*self.r).p = self.nil;
            }
        } else {
            let l = (*p).l;
            let mut r = (*p).r;
            (*r).p = self.nil;
            self.r = r;
            self.kth(0);
            r = self.r;
            (*r).l = l;
            (*l).p = r;
            self.upprod(r);
        }
        let z = self.data.len()-1;
        let x = &mut *self.data[z];
        let id1 = (*p).idx;
        let id2 = (*x).idx;
        swap(&mut (*p).idx, &mut (*x).idx);
        self.data.swap(id1, id2);
        self.data.pop();}
    }

    fn sec(&mut self, l: usize, r: usize) -> *mut Node<F>{
        unsafe{
        if l == 0 && r == (*self.r).ac{
            return self.r;
        } else if l==0{
            return (*self.kth(r)).l;
        } else if r==(*self.r).ac {
            return (*self.kth(l-1)).r;
        }
        let rp = self.kth(r);
        let mut lp = (*rp).l;
        self.r = lp;
        (*lp).p = self.nil;
        lp = self.kth(l-1);
        self.r = rp;
        (*rp).l = lp;
        (*lp).p = rp;
        self.upprod(rp);
        (*lp).r
        }
    }

    #[inline]
    pub fn reverse(&mut self, l: usize, r: usize){
        if l >= r{return;}
        unsafe{let c = self.sec(l, r);
        (*c).rev ^= true;
        F::reverse_prod(&mut (*c).prod);
        self.splay(c);}
    }

    #[inline]
    pub fn apply(&mut self, l: usize, r: usize, f: F::F) {
        unsafe{let c = self.sec(l, r);
        (*c).data = F::map(&f, &(*c).data);
        (*c).prod = F::map(&f, &(*c).prod);
        (*c).lazy = F::composition(&f, &(*c).lazy);
        self.splay(c);
    }
    }

    #[inline]
    pub fn prod(&mut self, l: usize, r: usize) -> <F::M as SplayMonoid>::S {
        unsafe {
            (*self.sec(l, r)).prod.clone()
        }
    }
}

#[derive(Debug, Clone)]
struct M;
impl SplayMonoid for M{
    type S = i64;

    #[inline(always)]
    fn identity() -> Self::S {
        0
    }

    #[inline(always)]
    fn op(&a: &Self::S, &b: &Self::S) -> Self::S {
        a+b
    }

    #[inline(always)]
    fn reverse_prod(_x: &mut Self::S) {}
}

#[derive(Debug, Clone)]
struct MM;
impl SplayLazyMonoid for MM{
    type M = M;
    type F = i64;

    #[inline(always)]
    fn identity() -> Self::F {
        0
    }

    #[inline(always)]
    fn map(&f: &Self::F, &x: &<Self::M as SplayMonoid>::S) -> <Self::M as SplayMonoid>::S {
        f+x
    }

    #[inline(always)]
    fn composition(&f: &Self::F, &g: &Self::F) -> Self::F {
        f+g
    }
}

const MULTI: bool = false;
//#[fastout]
fn solve(){
    input!{
        n: usize, q: usize,
        a: [i64; n],
        query: [(usize, i64, Usize1, usize);q],
    }
    let mut splay = SplayTree::<MM>::new();
    for (i, &v) in a.iter().enumerate(){
        splay.insert(i, v);
    }
    for &(p, x, l, r) in &query{
        splay.insert(p, x);
        println!("{}", splay.prod(l, r));
    }
}

fn main() {
    if MULTI{
        input!{
            t: usize,
        }
        for _ in 0..t{
            solve();
        }
    } else {
        solve();
    }
}