結果

問題 No.2757 Pin Game
ユーザー naut3
提出日時 2024-05-17 22:11:55
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 130 ms / 2,000 ms
コード長 3,731 bytes
コンパイル時間 19,049 ms
コンパイル使用メモリ 400,420 KB
実行使用メモリ 20,608 KB
最終ジャッジ日時 2024-12-20 14:04:25
合計ジャッジ時間 16,941 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 10
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#![allow(non_snake_case, unused_imports)]
use proconio::{fastout, input, marker::*};
#[fastout]
fn main() {
    input! {
        N: usize, K: isize,
        X: [isize; N],
    }
    let mut pos = std::collections::BTreeMap::default();
    for i in 0..N {
        pos.insert(X[i], i);
    }
    let mut dp = SegmentTree::new(N, |&x, &y| std::cmp::max(x, y), 1);
    for i in 0..N {
        let l = pos.range(..=(X[i] - K)).next_back();
        match l {
            Some((_, &p)) => {
                let m = dp.prod(..=p);
                dp.insert(i, m + 1);
            }
            None => (),
        }
    }
    let ans = dp.prod(..);
    println!("{}", ans);
}
pub struct SegmentTree<M> {
    size: usize,
    tree: Vec<M>,
    op: fn(&M, &M) -> M,
    id: M,
}
impl<M: Copy + PartialEq> SegmentTree<M> {
    /// self = [id; size], self.op = op, self.id = id
    pub fn new(size: usize, op: fn(&M, &M) -> M, id: M) -> Self {
        return Self {
            size: size,
            tree: vec![id; 2 * size],
            op: op,
            id: id,
        };
    }
    /// self = arr, self.op = op, self.id = id
    pub fn from(arr: &[M], op: fn(&M, &M) -> M, id: M) -> Self {
        let size = arr.len();
        let mut tree = vec![id; 2 * size];
        for i in 0..size {
            tree[i + size] = arr[i];
            assert!(op(&id, &arr[i]) == arr[i]);
        }
        for i in (1..size).rev() {
            tree[i] = op(&tree[i << 1], &tree[i << 1 | 1]);
        }
        return Self {
            size: size,
            tree: tree,
            op: op,
            id: id,
        };
    }
    /// self[pos] <- value
    pub fn insert(&mut self, mut pos: usize, value: M) -> () {
        pos += self.size;
        self.tree[pos] = value;
        while pos > 1 {
            pos >>= 1;
            self.tree[pos] = (self.op)(&self.tree[pos << 1], &self.tree[pos << 1 | 1]);
        }
    }
    /// return self[pos]
    pub fn get_point(&self, pos: usize) -> M {
        return self[pos];
    }
    /// return Π_{i ∈ [left, right)} self[i]
    pub fn get(&self, left: usize, right: usize) -> M {
        let (mut l, mut r) = (left + self.size, right + self.size);
        let (mut vl, mut vr) = (self.id, self.id);
        while l < r {
            if l & 1 == 1 {
                vl = (self.op)(&vl, &self.tree[l]);
                l += 1;
            }
            if r & 1 == 1 {
                r -= 1;
                vr = (self.op)(&self.tree[r], &vr);
            }
            l >>= 1;
            r >>= 1;
        }
        return (self.op)(&vl, &vr);
    }
    /// return Π_{i ∈ range} self[i]
    pub fn prod<R: std::ops::RangeBounds<usize>>(&self, range: R) -> M {
        let left = match range.start_bound() {
            std::ops::Bound::Included(&l) => l,
            std::ops::Bound::Excluded(&l) => l + 1,
            std::ops::Bound::Unbounded => 0,
        };
        let right = match range.end_bound() {
            std::ops::Bound::Included(&r) => r + 1,
            std::ops::Bound::Excluded(&r) => r,
            std::ops::Bound::Unbounded => self.size,
        };
        return self.get(left, right);
    }
}
impl<M> std::ops::Index<usize> for SegmentTree<M> {
    type Output = M;
    fn index(&self, index: usize) -> &Self::Output {
        &self.tree[index + self.size]
    }
}
impl<M: std::fmt::Display> std::fmt::Display for SegmentTree<M> {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        write!(
            f,
            "{}",
            self.tree[self.size..]
                .iter()
                .map(|x| x.to_string())
                .collect::<Vec<_>>()
                .join(" ")
        )
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0