結果

問題 No.1332 Range Nearest Query
ユーザー ziita
提出日時 2021-02-22 13:53:07
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 1,825 ms / 2,500 ms
コード長 4,801 bytes
コンパイル時間 14,145 ms
コンパイル使用メモリ 378,200 KB
実行使用メモリ 11,064 KB
最終ジャッジ日時 2024-09-21 11:17:37
合計ジャッジ時間 65,945 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 48
権限があれば一括ダウンロードができます

ソースコード

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

#![allow(unused_imports)]
#![allow(non_snake_case, unused)]
use std::cmp::*;
use std::collections::*;
use std::ops::*;
// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254 より
macro_rules! eprint {
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = write!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! eprintln {
    () => { eprintln!(""); };
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = writeln!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! dbg {
    ($v:expr) => {{
        let val = $v;
        eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
        val
    }}
}
macro_rules! mat {
    ($($e:expr),*) => { Vec::from(vec![$($e),*]) };
    ($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
    ($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
    ($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}
macro_rules! ok {
    ($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
        $a$([$i])*.$f($($t),*)
    };
    ($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
        let t = $e;
        ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
    } };
}
pub fn readln() -> String {
    let mut line = String::new();
    ::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
    line
}
macro_rules! read {
    ($($t:tt),*; $n:expr) => {{
        let stdin = ::std::io::stdin();
        let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
            let line = line.unwrap();
            let mut it = line.split_whitespace();
            _read!(it; $($t),*)
        }).collect::<Vec<_>>();
        ret
    }};
    ($($t:tt),*) => {{
        let line = readln();
        let mut it = line.split_whitespace();
        _read!(it; $($t),*)
    }};
}
macro_rules! _read {
    ($it:ident; [char]) => {
        _read!($it; String).chars().collect::<Vec<_>>()
    };
    ($it:ident; [u8]) => {
        Vec::from(_read!($it; String).into_bytes())
    };
    ($it:ident; usize1) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
    };
    ($it:ident; [usize1]) => {
        $it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
    };
    ($it:ident; [$t:ty]) => {
        $it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
    };
    ($it:ident; $t:ty) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
    };
    ($it:ident; $($t:tt),+) => {
        ($(_read!($it; $t)),*)
    };
}
pub fn main() {
    let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}
// const MOD: usize = 998244353;
const MOD: usize = 1_000_000_007;
const INF: i64 = std::i64::MAX/100;
// const INF: usize = std::usize::MAX;
// const INF: i128 = std::i128::MAX/100;
fn solve() {
    let n = read!(usize);
    let x = read!([i64]);
    let q = read!(usize);
    let lrx = read!(usize,usize,i64;q);
    let b = (n as f64).sqrt() as usize;
    let m = (n+b-1)/b;
    let mut list = vec![vec![];m];
    for i in 0..m {
        for j in 0..b {
            let idx = i*b+j;
            if idx>=n {
                break;
            }
            list[i].push(x[idx]);
        }
        list[i].push(-INF);
        list[i].push(INF);
        list[i].sort();
    }
    for &(l,r,v) in &lrx {
        let s = l-1;
        let t = r-1;
        let mut ans = INF;
        let mut idx = s;
        loop {
            if idx>t || idx%b==0 {
                break;
            }
            ans = min(ans, (x[idx]-v).abs());
            idx += 1;
        }
        loop {
            if idx+b-1>t {
                break;
            }
            let mut left = 0;
            let mut right = b+1;
            while right-left>1 {
                let mid = (left+right)/2;
                if list[idx/b][mid]<=v {
                    left = mid;
                }
                else {
                    right = mid;
                }
            }
            // println!("{} {} {} {}",idx,b,left,right);
            // println!("{:?}",list[idx/b]);
            ans = min(ans, (list[idx/b][left]-v).abs());
            ans = min(ans, (list[idx/b][right]-v).abs());
            // println!("{}",ans);
            idx += b;
        }
        loop {
            if idx>t {
                break;
            }
            ans = min(ans, (x[idx]-v).abs());
            idx += 1;
        }
        println!("{}",ans);
    }
}
fn run() {
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0