結果

問題 No.1332 Range Nearest Query
ユーザー fukafukatani
提出日時 2021-01-09 11:29:51
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 631 ms / 2,500 ms
コード長 3,246 bytes
コンパイル時間 12,969 ms
コンパイル使用メモリ 377,936 KB
実行使用メモリ 40,236 KB
最終ジャッジ日時 2024-11-17 13:41:44
合計ジャッジ時間 31,873 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 48
権限があれば一括ダウンロードができます

ソースコード

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

#![allow(unused_imports)]
use std::cmp::*;
use std::collections::*;
fn main() {
    let n = read::<usize>();
    let x = read_vec::<i64>();
    let q = read::<usize>();
    let mut queries = vec![];
    for i in 0..q {
        let v = read_vec::<i64>();
        let (l, r, x) = (v[0] as usize - 1, v[1] as usize - 1, v[2]);
        queries.push((l, r, x, i));
    }
    queries.sort_by_key(|e| -e.2);
    let mut xx = vec![];
    for i in 0..n {
        xx.push((x[i], i));
    }
    xx.sort();
    xx.reverse();
    let mut answers = vec![std::i64::MAX; q];
    let mut seg = SegTree::new(n, std::i64::MAX, |a, b| min(a, b));
    let mut xq = xx.iter().cloned().collect::<VecDeque<_>>();
    for &(l, r, x, i) in &queries {
        while let Some(&(xqx, xqi)) = xq.iter().next() {
            if xqx < x {
                break;
            }
            seg.update(xqi, xqx);
            xq.pop_front();
        }
        answers[i] = min(answers[i], seg.query(l, r + 1) - x);
    }
    queries.reverse();
    xx.reverse();
    let mut seg = SegTree::new(n, -std::i64::MAX / 2, |a, b| max(a, b));
    let mut xq = xx.iter().cloned().collect::<VecDeque<_>>();
    for &(l, r, x, i) in &queries {
        while let Some(&(xqx, xqi)) = xq.iter().next() {
            if xqx > x {
                break;
            }
            seg.update(xqi, xqx);
            xq.pop_front();
        }
        answers[i] = min(answers[i], x - seg.query(l, r + 1));
    }
    for ans in answers {
        println!("{}", ans);
    }
}
#[derive(Clone)]
struct SegTree<T, F>
where
    F: Fn(T, T) -> T,
    T: std::clone::Clone + std::marker::Copy,
{
    n: usize,
    dat: Vec<T>,
    init: T,
    functor: F,
}
impl<T, F> SegTree<T, F>
where
    F: Fn(T, T) -> T,
    T: std::clone::Clone + std::marker::Copy,
{
    fn new(n: usize, init: T, f: F) -> SegTree<T, F> {
        let mut m = 1;
        // For simplicity, we use 2 ** n sized SegTree.
        while m < n {
            m *= 2;
        }
        SegTree {
            n: m,
            dat: vec![init; 2 * m - 1],
            init: init,
            functor: f,
        }
    }
    // dat[k] = a;
    fn update(&mut self, k: usize, a: T) {
        let mut k = k;
        k += self.n - 1;
        self.dat[k] = a;
        while k > 0 {
            k = (k - 1) / 2;
            self.dat[k] = (self.functor)(self.dat[k * 2 + 1], self.dat[k * 2 + 2]);
        }
    }
    // [a, b)
    fn query(&self, a: usize, b: usize) -> T {
        self.query_inner(a, b, 0, 0, self.n)
    }
    fn query_inner(&self, a: usize, b: usize, k: usize, l: usize, r: usize) -> T {
        if r <= a || b <= l {
            return self.init;
        }
        if a <= l && r <= b {
            return self.dat[k];
        }
        let vl = self.query_inner(a, b, k * 2 + 1, l, (l + r) / 2);
        let vr = self.query_inner(a, b, k * 2 + 2, (l + r) / 2, r);
        (self.functor)(vl, vr)
    }
}
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0