結果

問題 No.3313 Matryoshka
コンテスト
ユーザー 👑 ArcAki
提出日時 2025-11-07 10:56:09
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 1,707 ms / 4,000 ms
コード長 8,372 bytes
コンパイル時間 22,909 ms
コンパイル使用メモリ 399,380 KB
実行使用メモリ 136,140 KB
最終ジャッジ日時 2025-11-07 10:57:04
合計ジャッジ時間 47,217 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[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 fn gcd(mut a: i64, mut b: i64)->i64{ if b==0{return a;}(a,b)=(a.abs(),b.abs());while b!=0{ let c = a;a = b;b = c%b; }a }
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 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(x: i64,p: usize, m: i64)->i64{
    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 fn vec_out<T>(v: Vec<T>) where T: ToString{ println!("{}", v.iter().map(|x| x.to_string()).collect::<Vec<_>>().join(" ")); }
pub fn one_add_out(v: Vec<usize>){println!("{}", v.iter().map(|x| (x+1).to_string()).collect::<Vec<_>>().join(" "));}
pub trait Chmax{
    fn chmax(&mut self, rhs: Self);
}
impl Chmax for i64{
    fn chmax(&mut self, rhs: Self) {
        *self = (*self).max(rhs)
    }
}
impl Chmax for i32{
    fn chmax(&mut self, rhs: Self) {
        *self = (*self).max(rhs)
    }
}
impl Chmax for f64{
    fn chmax(&mut self, rhs: Self) {
        *self = (*self).max(rhs)
    }
}
impl Chmax for usize{
    fn chmax(&mut self, rhs: Self) {
        *self = (*self).max(rhs)
    }
}
pub trait Chmin {
    fn chmin(&mut self, rhs: Self);
}
impl Chmin for i64{
    fn chmin(&mut self, rhs: Self) {
        *self = (*self).min(rhs)
    }
}
impl Chmin for i32{
    fn chmin(&mut self, rhs: Self) {
        *self = (*self).min(rhs)
    }
}
impl Chmin for f64{
    fn chmin(&mut self, rhs: Self) {
        *self = (*self).min(rhs)
    }
}
impl Chmin for usize{
    fn chmin(&mut self, rhs: Self) {
        *self = (*self).min(rhs)
    }
}
#[allow(unused)]
mod fxhash{
    use std::hash::BuildHasherDefault;

    #[derive(Default)]
    pub struct FxHasher{
        pub hash: u64,
    }
    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(0x517cc1b727220a95);
            }
            self.hash = h;
        }
    }
    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>;
}
#[allow(unused_imports)]
use fxhash::{FxSet, FxMap, FxBuildHasher};

#[allow(unused_imports)]
use proconio::{input, input_interactive, marker::{*}, fastout};
/* 
#[allow(unused_imports)]
use rustc_hash::FxHasher;
#[allow(dead_code)]
type FxMap<K, V> = HashMap<K, V, BuildHasherDefault<FxHasher>>;
#[allow(dead_code)]
type FxSet<K> = HashSet<K, BuildHasherDefault<FxHasher>>;
#[allow(unused_imports)]
use rand::{thread_rng, Rng, seq::SliceRandom, prelude::*};
#[allow(unused_imports)]
use itertools::{Itertools};
#[allow(unused_imports)]
use ordered_float::OrderedFloat;
#[allow(unused_imports)]
use num_bigint::BigInt;
#[allow(unused_imports)]
use ac_library::{*, ModInt998244353 as mint};
*/
#[allow(dead_code)]
//type MI = StaticModInt<Mod998244353>;pub fn factorial_mint(n: usize)->(Vec<MI>, Vec<MI>){ let mut res = vec![mint::new(1); n+1];let mut inv = vec![mint::new(1); n+1];for i in 0..n{res[i+1] = res[i]*(i+1);}inv[n] = mint::new(1)/res[n];for i in (0..n).rev(){inv[i] = inv[i+1]*(i+1);}(res, inv)}
#[allow(dead_code)]
const INF: i64 = 1<<60;
#[allow(dead_code)]
const I: i32 = 1<<28;
#[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)]
const D2: [(usize, usize); 8] = [(1, 0), (1, 1), (0, 1), (!0, 1), (!0, 0), (!0, !0), (0, !0), (1, !0)];

pub struct BIT<T> where T: Copy + std::ops::Add<Output = T> + std::ops::Sub<Output = T> {
    n: usize,
    vec: Vec<T>,
    zero: T,
}

impl<T> BIT<T> where T: Copy + std::ops::Add<Output = T> + std::ops::Sub<Output = T> {
    pub fn new(n: usize, zero: T) -> Self {
        let k = n.next_power_of_two();
        let base = vec![zero; k + 2];
        BIT { n: k, vec: base, zero }
    }

    #[inline]
    pub fn add(&mut self, mut idx: usize, x: T) {
        idx += 1;
        while idx <= self.n {
            self.vec[idx] = self.vec[idx] + x;
            idx += idx & (!idx + 1);
        }
    }

    #[inline]
    pub fn g(&mut self, mut r: usize) -> T {
        let mut res = self.zero;
        while r > 0 {
            res = res + self.vec[r];
            r -= r & (!r + 1);
        }
        res
    }

    #[inline]
    pub fn get(&mut self, l: usize, r: usize) -> T {
        self.g(r) - self.g(l)
    }
}


//#[fastout]
fn main() {
    input!{
        n: usize,
        mut sec: [(Usize1, Usize1); n],
    }
    let mut dic = FxMap::default();
    let mut ss = Vec::with_capacity(2*n);
    for &(l, r) in &sec{
        ss.push(l);
        ss.push(r);
    }
    ss.sort();
    for (i, &v) in ss.iter().enumerate(){
        dic.insert(v, i);
    }
    for i in 0..n{
        sec[i] = (dic[&sec[i].0], dic[&sec[i].1]);
    }
    let mut ans = 0;
    let mut qs = vec![(0, 0, 0, 0); 2*n];
    for (i, &(u, v)) in sec.iter().rev().enumerate(){
        qs[i*2] = (u, u, v, v);
        qs[i*2+1] = (u, v, !0, !0);
    }
    let mut bit = BIT::new(2*n, 0);
    let mut cash = Vec::with_capacity(2*n);
    let mut qv = Vec::with_capacity(3*n);
    solve(0, 2*n, &qs, &mut bit, &mut cash, &mut qv, &mut ans);
    println!("{}", ans);
}

fn solve(l: usize, r: usize, qs: &Vec<(usize, usize, usize, usize)>, bit: &mut BIT<i64>, cash: &mut Vec<usize>, query: &mut Vec<(usize, usize, usize, i64)>, ans: &mut i64){
    if l+1==r{return;}
    let m = (l+r)/2;
    solve(l, m, qs, bit, cash, query, ans);
    solve(m, r, qs, bit, cash, query, ans);
    for i in l..m{
        if qs[i].2==!0{
            query.push((qs[i].0, qs[i].1, !0, 1));
        } 
    }
    for i in m..r{
        if qs[i].2!=!0{
            query.push((qs[i].0, qs[i].1, qs[i].3, -1));
            query.push((qs[i].2, qs[i].1, qs[i].3, 1));
        } 
    }
    query.sort_by_key(|f| f.0);
    for &(_, ll, rr, x) in query.iter(){
        if rr==!0{
            bit.add(ll, x);
        } else {
            *ans += x*bit.get(ll, rr);
        }
    }
    while let Some(x) = cash.pop(){
        bit.add(x, -1);
    }
    query.clear();
}
0