提出 #70627840

---

ソースコード 拡げる

#![allow(unused_parens)]
#![allow(unused_imports)]
#![allow(non_upper_case_globals)]
#![allow(non_snake_case)]
#![allow(unused_mut)]
#![allow(unused_variables)]
#![allow(dead_code)]
#![allow(unused_macros)]

use itertools::Itertools;
use proconio::input;
use proconio::marker::{Chars, Usize1};

type Vec2<T> = Vec<Vec<T>>;
type Vec3<T> = Vec<Vec<Vec<T>>>;
#[rustfmt::skip]
macro_rules ! max { ( $x : expr ) => ( $x ) ; ( $x : expr , $ ( $xs : expr ) ,+ ) => { {  std :: cmp :: max ( $x , max! ( $ ( $xs ) ,+ ) ) } } ; }
#[rustfmt::skip]
macro_rules ! min { ( $x : expr ) => ( $x ) ; ( $x : expr , $ ( $xs : expr ) ,+ ) => { {  std :: cmp :: min ( $x , min! ( $ ( $xs ) ,+ ) ) } } ; }
#[rustfmt::skip]
macro_rules! chmin {    ($a:expr, $($b:expr),+) => {{        let d = min!($($b),+);        if $a > d {            $a = d;            true        } else {            false        }    }}; }

#[rustfmt::skip]
macro_rules! chmax {    ($a:expr, $($b:expr),+) => {{        let d = max!($($b),+);        if $a < d {            $a = d;            true        } else {            false        }    }};}

#[rustfmt::skip]
macro_rules! chadd {    ($a:expr, $b:expr) => {{        $a = $a + $b;    }};}
#[rustfmt::skip]
macro_rules! chsub {    ($a:expr, $b:expr) => {{        $a = $a - $b;    }};}
#[rustfmt::skip]
macro_rules! chmul {    ($a:expr, $b:expr) => {{        $a = $a * $b;    }};}

#[cfg(debug_assertions)]
macro_rules! mydbg {
    //($arg:expr) => (dbg!($arg))
    //($arg:expr) => (println!("{:?}",$arg));
      ($($a:expr),*) => {
          eprintln!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
      }
}
#[cfg(not(debug_assertions))]
macro_rules! mydbg {
    ($($arg:expr),*) => {};
}

macro_rules! echo {
    ($($a:expr),*) => {
          $(println!("{}",$a))*
      }
}

macro_rules! multivec {
    ($a:expr;$b:expr) => {
        vec![$a; $b]
    };
    ($a:expr;$b:expr;$($c:expr);+) => {
        multivec![vec![$a;$b];$($c);+]
    };
}

use std::cmp::*;
use std::collections::*;
use std::ops::{Add, Div, Mul, Rem, Sub};

fn echoNoReturn() {
    echo!("No");
    std::process::exit(0);
}
fn echoYesReturn() {
    echo!("Yes");
    std::process::exit(0);
}

fn echoNo() {
    echo!("No");
}
fn echoYes() {
    echo!("Yes");
}

#[allow(dead_code)]
static INF_I64: i64 = 92233720368547758;
#[allow(dead_code)]
static INF_I32: i32 = 21474836;
#[allow(dead_code)]
static INF_USIZE: usize = 18446744073709551;
#[allow(dead_code)]
static M_O_D: usize = 1000000007;
#[allow(dead_code)]
static PAI: f64 = 3.1415926535897932;

trait IteratorExt: Iterator {
    fn toVec(self) -> Vec<Self::Item>;
}

impl<T: Iterator> IteratorExt for T {
    fn toVec(self) -> Vec<Self::Item> {
        self.collect()
    }
}

fn sin(a: f64) -> f64 {
    a.sin()
}
fn cos(a: f64) -> f64 {
    a.cos()
}
trait ToNum {
    fn toNum(&self) -> Vec<usize>;
}
impl ToNum for Vec<char> {
    fn toNum(&self) -> Vec<usize> {
        if self[0].is_ascii_digit() {
            self.iter().map(|x| x.toNumIndex()).toVec()
        } else {
            self.iter().map(|x| x.toAlphabetIndex()).toVec()
        }
    }
}

trait CharExt {
    fn toNum(&self) -> usize;
    fn toAlphabetIndex(&self) -> usize;
    fn toNumIndex(&self) -> usize;
}
impl CharExt for char {
    fn toNum(&self) -> usize {
        return *self as usize;
    }
    fn toAlphabetIndex(&self) -> usize {
        return self.toNum() - 'a' as usize;
    }
    fn toNumIndex(&self) -> usize {
        return self.toNum() - '0' as usize;
    }
}
trait PrimeNumber:
    Copy
    + Ord
    + Add<Output = Self>
    + Sub<Output = Self>
    + Mul<Output = Self>
    + Div<Output = Self>
    + Rem<Output = Self>
{
    fn is_odd(self) -> bool;
    fn is_even(self) -> bool;
    fn pow(self, exp: u32) -> Self;
}

macro_rules! impl_prim_int(($($ty:ty),*) => {
    $(
        impl PrimeNumber for $ty {
            fn pow(self, exp: u32) -> Self {
                self.pow(exp)
            }
            fn is_odd(self)->bool{
                self & 1==1
            }

            fn is_even(self)->bool{
                self & 1==0
            }
        }
    )*
});

trait SafeRangeContain {
    fn safe_contains(&self, x: i64) -> bool;
}

impl SafeRangeContain for std::ops::Range<usize> {
    fn safe_contains(&self, x: i64) -> bool {
        if x < 0 {
            return false;
        }
        return self.contains(&(x as usize));
    }
}

impl_prim_int!(
    u8, u16, u32, u64, u128, usize, i8, i16, i32, i64, i128, isize
);
trait VectorExt {
    fn joinToString(&self, s: &str) -> String;
}
impl<T: ToString> VectorExt for Vec<T> {
    fn joinToString(&self, s: &str) -> String {
        return self
            .iter()
            .map(|x| x.to_string())
            .collect::<Vec<_>>()
            .join(s);
    }
}

trait StringExt {
    fn get_reverse(&self) -> String;
}
impl StringExt for String {
    fn get_reverse(&self) -> String {
        self.chars().rev().collect::<String>()
    }
}

trait UsizeExt {
    fn pow(&self, n: usize) -> usize;
}
impl UsizeExt for usize {
    fn pow(&self, n: usize) -> usize {
        return ((*self as u64).pow(n as u32)) as usize;
    }
}

use ac_library::segtree::*;
use itertools_num::ItertoolsNum as _;
use superslice::*;

// let mut X = BTreeSet::new();
//     let mut Y = BTreeSet::new();
//     for &(x, y) in &P {
//         X.insert(x);
//         Y.insert(y);
//     }
//     let mut hx = HashMap::new();
//     let mut hy = HashMap::new();
//     let X = X.iter().collect::<Vec<_>>();
//     let Y = Y.iter().collect::<Vec<_>>();
//     for i in 0..X.len() {
//         hx.entry(X[i]).or_insert(i);
//     }
//     for i in 0..Y.len() {
//         hy.entry(Y[i]).or_insert(i);
//     }

struct Zahyou<T>
where
    T: Ord,
{
    P: Vec<T>,
    flag: bool,
}
impl<T: Ord> Zahyou<T> {
    fn new() -> Self {
        Zahyou {
            P: vec![],
            flag: false,
        }
    }
    fn push(&mut self, a: T) {
        self.P.push(a);
    }
    fn getId(&self, a: &T) -> usize {
        if !self.flag {
            panic!("初期化してない");
        }
        self.P.lower_bound(a)
    }
    fn build(&mut self) {
        self.P.sort();
        self.flag = true;
    }
    fn len(&self) -> usize {
        self.P.len()
    }
}
impl<T> std::ops::Index<usize> for Zahyou<T>
where
    T: Ord,
{
    type Output = T;

    fn index(&self, index: usize) -> &Self::Output {
        if !self.flag {
            panic!("初期化してない");
        }
        &self.P[index]
    }
}

fn main() {
    input! {
       N: usize,
       X:[i64;N],
    }

    let mut ans = vec![];
    let mut s = BTreeMap::new();
    *s.entry(0).or_insert(0) += 1;
    let mut z = Zahyou::new();
    z.push(0);
    for &item in &X {
        z.push(item);
    }
    z.build();
    let mut count = vec![0; N + 10];
    let mut cost = vec![0; N + 10];
    count[z.getId(&0)] += 1;

    let mut now = 0;
    for &item in &X {
        let id = z.getId(&item);
        count[id] += 1;
        *s.entry(item).or_insert(0) += 1;

        let l = s.range(0..item).rev().next();
        let r = s.range(item + 1..).next();
        let pre = cost[id];
        update(&mut cost, &s, item, id);
        let next = cost[id];
        now += (next - pre) * count[id];

        if l.is_some() {
            let id = z.getId(&l.unwrap().0);
            let pre = cost[id];
            update(&mut cost, &s, *l.unwrap().0, id);
            let next = cost[id];
            now += (next - pre) * count[id];
        }
        if r.is_some() {
            let id = z.getId(&r.unwrap().0);
            let pre = cost[id];
            update(&mut cost, &s, *r.unwrap().0, id);
            let next = cost[id];
            now += (next - pre) * count[id];
        }

        ans.push(now);
    }

    let mut a: Segtree<Additive<i64>> = vec![0; N].into();
    let mut now = 0;

    echo!(ans.joinToString("\n"));
}

fn update(cost: &mut Vec<i64>, s: &BTreeMap<i64, i32>, item: i64, id: usize) {
    if *s.get(&item).unwrap() >= 2 {
        cost[id] = 0;
        return;
    }
    let l = s.range(0..item).rev().next();
    let r = s.range(item + 1..).next();
    let mut D = i64::MAX;
    if let Some(t) = l {
        chmin!(D, (t.0 - item).abs());
    }
    if let Some(t) = r {
        chmin!(D, (t.0 - item).abs());
    }
    cost[id] = D;
}

提出情報

ジャッジ結果