結果

問題 No.3091 The Little Match Boy
ユーザー ArcAki
提出日時 2025-04-07 08:47:44
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 602 ms / 2,000 ms
コード長 5,809 bytes
コンパイル時間 14,375 ms
コンパイル使用メモリ 399,104 KB
実行使用メモリ 17,856 KB
最終ジャッジ日時 2025-04-07 08:48:16
合計ジャッジ時間 26,148 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 62
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[allow(unused_imports)]
use std::{
    cell::RefCell, convert::{Infallible, TryFrom, TryInto as _},
    fmt::{self, Debug, Display, Formatter,}, fs::{File}, hash::{Hash, Hasher},
    iter::{Product, Sum}, marker::PhantomData,
    ops::{Add, AddAssign, Sub, SubAssign, Div, DivAssign, Mul, MulAssign, Neg, RangeBounds},
    str::{FromStr, SplitWhitespace}, sync::{atomic::{self, AtomicU32, AtomicU64}, Once},
    collections::{*, btree_map::Range}, mem::{swap},
    cmp::{self, Reverse, Ordering, Eq, PartialEq, PartialOrd},
    thread::LocalKey, f64::consts::PI, time::Instant, rc::Rc,
    io::{self, stdin, Read, read_to_string, BufWriter, BufReader, stdout, Write},
};
#[allow(unused_imports)]
use proconio::{input, input_interactive, marker::{*}};
#[allow(unused_imports)]
//use rand::{thread_rng, Rng, seq::SliceRandom};
#[allow(unused_imports)]
//use ac_library::{*};

#[allow(dead_code)]
const INF: i64 = 1<<60;
#[allow(dead_code)]
const MOD: i64 = 998244353;
#[allow(dead_code)]
const D: [(usize, usize); 4] = [(1, 0), (0, 1), (!0, 0), (0, !0)];

pub trait SegTreeMonoid{
    type S: Clone;
    fn identity()->Self::S;
    fn op(a: &Self::S, b: &Self::S)->Self::S;
}

pub struct SegTree<M: SegTreeMonoid>{
    n: usize,
    data: Vec<M::S>,
}

impl<M: SegTreeMonoid> SegTree<M> {
    pub fn new(n: usize)->Self{
        let n = n.next_power_of_two();
        let data = vec![M::identity(); 2*n];
        SegTree{
            n, data
        }
    }

    pub fn set(&mut self, i: usize, x: M::S){
        let mut p = i+self.n;
        self.data[p] = x;
        while p > 0{
            p /= 2;
            self.data[p] = M::op(&self.data[p<<1], &self.data[(p<<1)|1]);
        }
    }

    pub fn push(&mut self, i: usize, x: M::S){
        let mut p = i+self.n;
        self.data[p] = M::op(&self.data[p], &x);
        while p > 0{
            p /= 2;
            self.data[p] = M::op(&self.data[p<<1], &self.data[(p<<1)|1]);
        }
    }

    pub fn prod(&mut self, l: usize, r: usize)->M::S{
        let mut p_l = l+self.n;
        let mut p_r = r+self.n;
        let mut res_l = M::identity();
        let mut res_r = M::identity();
        while p_l < p_r{
            if p_l&1==1{
                res_l = M::op(&res_l, &self.data[p_l]);
                p_l += 1;
            }
            if p_r&1==1{
                p_r -= 1;
                res_r = M::op(&self.data[p_r], &res_r);
            }
            p_l >>= 1;
            p_r >>= 1;
        }
        M::op(&res_l, &res_r)
    }

    pub fn all_prod(&mut self)->M::S{
        self.data[1].clone()
    }

    pub fn max_right<F>(&self, mut l: usize, f: F)->usize where F: Fn(&M::S)->bool{
        assert!(f(&M::identity())); // これはバグってくれないと多分デバックが悲惨
        if l==self.n{return self.n}
        l += self.n; let mut ac = M::identity();
        while {
            while l%2==0{
                l >>= 1;
            }
            if !f(&M::op(&ac, &self.data[l])){
                while l < self.n{
                    l <<= 1;
                    let res = M::op(&ac, &self.data[l]);
                    if f(&res){
                        ac = res;
                        l += 1;
                    }
                }
                return l-self.n;
            }
            ac = M::op(&ac, &self.data[l]);
            l += 1;
            let z = l as isize;
            (z & -z) != z
        } {}
        self.n
    }

    pub fn min_left<F>(&self, mut r: usize, f: F)->usize where F: Fn(&M::S)->bool{
        assert!(f(&M::identity()));r += self.n;let mut ac = M::identity();
        if r==0{return 0}
        while {
            while r > 1 && r%2 == 1{
                r >>= 1;
            }
            if !f(&M::op(&ac, &self.data[r])){
                while r < self.n{
                    r = 2*r+1;
                    let res = M::op(&ac, &self.data[r]);
                    if f(&res){
                        ac = res;
                        r -= 1;
                    }
                }
                return r+1-self.n;
            }
            ac = M::op(&ac, &self.data[r]);
            let z = r as isize;
            z & -z == z
        } {}
        0
    }
}

pub const B: u128 = 1394107;
pub const MO: u128 = (1<<64)-59;

pub struct RollingHashMonoid;
impl SegTreeMonoid for RollingHashMonoid{
    type S = (u128, u128);

    fn identity() -> Self::S {
        (1, 0)
    }

    fn op(a: &Self::S, b: &Self::S) -> Self::S {
        let &(b1, h1) = a;
        let &(b2, h2) = b;
        ((b1*b2)%MO, (b2*h1+h2)%MO)
    }
}

pub fn compress<T: Copy+Ord+std::hash::Hash>(a: &Vec<T>)->Vec<usize>{
    let mut b = a.clone();
    b.sort();
    b.dedup();
    let mut dic = std::collections::HashMap::new();
    for (i, &v) in b.iter().enumerate(){
        dic.insert(v, i);
    }
    a.iter().map(|x| dic[x]).collect()
}


//use proconio::fastout;
//#[fastout]
fn main(){
    input!{
        n: usize, m: usize,
        s: [Usize1; m],
    }
    let mut set = HashSet::new();
    let mut base = (0..n).collect::<Vec<_>>();
    let mut ss = vec![(0, 0); m];
    for (i, &idx) in s.iter().enumerate(){
        ss[i] = (base[idx], base[idx+1]);
        base.swap(idx, idx+1);
    }
    let mut inv = vec![0; n];
    for (i, &v) in base.iter().enumerate(){
        inv[v] = i;
    }
    let mut segtree = SegTree::<RollingHashMonoid>::new(n);
    for i in 0..n{
        segtree.set(i, (B, base[i] as u128));
    }
    for &(u, v) in &ss{
        let (idx1, idx2) = (inv[u], inv[v]);
        segtree.set(idx2, (B, base[idx1] as u128));
        segtree.set(idx1, (B, base[idx2] as u128));
        set.insert(segtree.all_prod().1);
        segtree.set(idx1, (B, base[idx1] as u128));
        segtree.set(idx2, (B, base[idx2] as u128));
    }
    println!("{}", set.len());
}
0