結果

問題 No.3446 Range Adjacent Differences
ユーザー 👑 ArcAki
提出日時 2026-02-10 10:25:27
言語 Rust
(1.93.0 + proconio + num + itertools)
結果
AC  
実行時間 1,974 ms / 2,200 ms
コード長 8,423 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 4,574 ms
コンパイル使用メモリ 224,376 KB
実行使用メモリ 56,088 KB
最終ジャッジ日時 2026-02-18 20:50:55
合計ジャッジ時間 26,348 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#[derive(Clone, Debug)]
pub struct Predecessor64{
    n: usize,
    d: Vec<Vec<u64>>,
}

impl Predecessor64 {
    pub fn new(n: usize)->Self{
        let d = (0..n).into_iter().map(|k| vec![0; 1<<(6*(n-k-1))]).collect::<Vec<Vec<u64>>>();
        Predecessor64{
            n, d
        }
    }

    #[inline(always)]
    pub fn is_empty(&self) -> bool {
        self.d[self.n-1][0]==0
    }

    #[inline(always)]
    pub fn include(&self, p: usize) -> bool {
        self.d[0][p>>6]&1<<(p&63)!=0
    }

    #[inline(always)]
    pub fn insert(&mut self, p: usize){
        for i in 0..self.n{
            if self.d[i][p>>(6*(i+1))]&1<<((p>>(6*i))&63)==0{
                self.d[i][p>>(6*(i+1))] |= 1<<((p>>(6*i))&63);
            } else {
                return;
            }
        }
    }

    #[inline(always)]
    pub fn remove(&mut self, p: usize){
        if self.d[0][p>>6]&1<<(p&63)==0{return;}
        for i in 0..self.n{
            self.d[i][p>>(6*(i+1))] ^= 1<<((p>>(6*i))&63);
            if self.d[i][p>>(6*(i+1))]!=0{
                return;
            } 
        }
    }

    #[inline(always)]
    fn ml(r: usize)->u64{
        (1<<r)-1
    }

    #[inline(always)]
    fn mr(l: usize)->u64{
        if l==63{return 0;}
        !((1<<(l+1))-1)
    }

    #[inline(always)]
    fn msb(bit: u64)->usize{
        63-bit.leading_zeros()as usize
    }

    #[inline(always)]
    fn lsb(bit: u64)->usize{
        bit.trailing_zeros()as usize
    }

    //存在しないは!0
    #[inline(always)]
    pub fn prev(&self, mut p: usize)->usize{
        for i in 0..self.n{
            if Self::ml(p&63)&self.d[i][p>>6]!=0{
                let mut res = ((p>>6)<<6)|Self::msb(self.d[i][p>>6]&Self::ml(p&63));
                for j in (0..i).rev(){
                    res = (res<<6)|Self::msb(self.d[j][res]);
                }
                return res;
            }
            p >>= 6;
        }
        !0
    }

    #[inline(always)]
    pub fn next(&self, mut p: usize)->usize{
        for i in 0..self.n{
            if Self::mr(p&63)&self.d[i][p>>6]!=0{
                let mut res = ((p>>6)<<6)|Self::lsb(self.d[i][p>>6]&Self::mr(p&63));
                for j in (0..i).rev(){
                    res = (res<<6)|Self::lsb(self.d[j][res]);
                }
                return res;
            }
            p >>= 6;
        }
        !0
    }

    #[inline(always)]
    pub fn inprev(&self, p: usize)->usize{
        if self.include(p){p}
        else {self.prev(p)}
    }

    #[inline(always)]
    pub fn innext(&self, p: usize)->usize{
        if self.include(p){p}
        else {self.next(p)}
    }

    #[inline(always)]
    pub fn min(&self)->usize{
        self.innext(0)
    }

    #[inline(always)]
    pub fn max(&self)->usize{
        self.inprev((1<<(6*self.n))-1)
    }
}

const ROT_DELTA: [u32; 4] = [3, 0, 0, 1];
#[inline]
pub fn hilbert_order(x: u32, y: u32, pow: u32, rot: u32) -> u64 {
    if pow == 0 { return 0; }
    let h: u32 = 1u32 << (pow - 1);
    let mut seg: u32 = if x < h {if y < h { 0 } else { 3 }} else {if y < h { 1 } else { 2 }};
    seg = (seg + rot) & 3;
    let nrot = (rot + ROT_DELTA[seg as usize]) & 3;
    let nx = x & (h - 1);
    let ny = y & (h - 1);
    let sub: u64 = 1u64 << (2 * pow - 2);
    let mut ord = (seg as u64) * sub;
    let add = hilbert_order(nx, ny, pow - 1, nrot);
    ord += if seg == 1 || seg == 2 { add } else { sub - 1 - add };
    ord
}

#[inline(always)]
fn inc(p: usize, c2: &mut Vec<i32>, seg: &mut Predecessor64){
    if c2[p]==0{
        seg.insert(p);
    } 
    c2[p] += 1;
}
#[inline(always)]
fn dec(p: usize, c2: &mut Vec<i32>, seg: &mut Predecessor64){
    c2[p] -= 1;
    if c2[p]==0{
        seg.remove(p);
    } 
}
#[inline(always)]
fn add(p: usize, set: &mut Predecessor64, seg: &mut Predecessor64, c1: &mut Vec<i32>, c2: &mut Vec<i32>){
    if c1[p]==0{
        let l = set.prev(p);
        let r = set.next(p);
        if l==!0{
            if r!=!0{
                inc(r-p, c2, seg);
            }
        } else if r==!0{
            inc(p-l, c2, seg);
        } else {
            dec(r-l, c2, seg);
            inc(p-l, c2, seg);
            inc(r-p, c2, seg);
        }
        set.insert(p);
    } else {
        inc(0, c2, seg);
    }
    c1[p] += 1;
}
#[inline(always)]
fn sub(p: usize, set: &mut Predecessor64, seg: &mut Predecessor64, c1: &mut Vec<i32>, c2: &mut Vec<i32>){
    c1[p] -= 1;
    if c1[p]==0{
        let l = set.prev(p);
        let r = set.next(p);
        if l==!0{
            if r!=!0{
                dec(r-p, c2, seg);
            }
        } else if r==!0{
            dec(p-l, c2, seg);
        } else {
            inc(r-l, c2, seg);
            dec(p-l, c2, seg);
            dec(r-p, c2, seg);
        }
        set.remove(p);
    } else {
        dec(0, c2, seg);
    }
}

const MULTI: bool = false;
#[fastout]
fn solve(){
    input!{
        n: usize, q: usize,
        a: [Usize1; n],
        query: [(Usize1, usize, usize, char); q],
    }
    let mut set = Predecessor64::new(4);
    let mut seg = Predecessor64::new(4);
    let ord_x = (0..q).into_iter().map(|idx| hilbert_order(query[idx].0 as u32, query[idx].1 as u32, 19, 0)).collect::<Vec<_>>();
    const MX: usize = 10000000;
    let mut ord = (0..q).collect::<Vec<_>>();
    let mut c1 = vec![0; MX];
    let mut c2 = vec![0; MX];
    let mut ans = vec![0; q];
    ord.sort_unstable_by_key(|&idx| ord_x[idx]);
    let (mut l, mut r) = (0, 0);
    for idx in ord{
        let (left, right, x, ci) = query[idx];
        while r < right{
            add(a[r], &mut set, &mut seg, &mut c1, &mut c2);
            r += 1;
        }
        while l > left{
            l -= 1;
            add(a[l], &mut set, &mut seg, &mut c1, &mut c2);
        }
        while r > right{
            r -= 1;
            sub(a[r], &mut set, &mut seg, &mut c1, &mut c2);
        }
        while l < left {
            sub(a[l], &mut set, &mut seg, &mut c1, &mut c2);
            l += 1;
        }
        ans[idx] = if ci=='L'{seg.inprev(x)} else {seg.innext(x)}as i32;
    }
    for x in ans{
        println!("{}", x);
    }
}

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

#[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},
};
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_imports)]
use proconio::{input, input_interactive, marker::{*}, fastout};

#[allow(dead_code)]
const INF: i64 = 1<<60;
#[allow(dead_code)]
const I: i32 = 1<<29;
#[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)];
0