結果

問題 No.1332 Range Nearest Query
ユーザー koba-e964koba-e964
提出日時 2021-01-10 23:07:14
言語 Rust
(1.77.0)
結果
AC  
実行時間 311 ms / 2,500 ms
コード長 5,394 bytes
コンパイル時間 22,469 ms
コンパイル使用メモリ 402,496 KB
実行使用メモリ 34,896 KB
最終ジャッジ日時 2024-05-01 06:30:24
合計ジャッジ時間 31,255 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 206 ms
24,436 KB
testcase_04 AC 205 ms
24,032 KB
testcase_05 AC 204 ms
24,076 KB
testcase_06 AC 153 ms
33,532 KB
testcase_07 AC 160 ms
34,280 KB
testcase_08 AC 153 ms
34,896 KB
testcase_09 AC 152 ms
33,632 KB
testcase_10 AC 149 ms
33,804 KB
testcase_11 AC 149 ms
34,048 KB
testcase_12 AC 151 ms
34,012 KB
testcase_13 AC 155 ms
34,084 KB
testcase_14 AC 311 ms
34,460 KB
testcase_15 AC 161 ms
33,752 KB
testcase_16 AC 229 ms
34,312 KB
testcase_17 AC 222 ms
33,956 KB
testcase_18 AC 231 ms
33,808 KB
testcase_19 AC 221 ms
33,976 KB
testcase_20 AC 237 ms
33,628 KB
testcase_21 AC 232 ms
34,496 KB
testcase_22 AC 227 ms
34,212 KB
testcase_23 AC 226 ms
33,568 KB
testcase_24 AC 232 ms
33,716 KB
testcase_25 AC 225 ms
33,340 KB
testcase_26 AC 121 ms
34,184 KB
testcase_27 AC 121 ms
34,792 KB
testcase_28 AC 37 ms
8,548 KB
testcase_29 AC 39 ms
8,448 KB
testcase_30 AC 42 ms
8,484 KB
testcase_31 AC 39 ms
8,448 KB
testcase_32 AC 41 ms
8,508 KB
testcase_33 AC 42 ms
8,448 KB
testcase_34 AC 40 ms
8,448 KB
testcase_35 AC 38 ms
8,576 KB
testcase_36 AC 41 ms
8,448 KB
testcase_37 AC 41 ms
8,448 KB
testcase_38 AC 159 ms
20,484 KB
testcase_39 AC 70 ms
8,684 KB
testcase_40 AC 238 ms
33,356 KB
testcase_41 AC 105 ms
11,444 KB
testcase_42 AC 154 ms
20,204 KB
testcase_43 AC 132 ms
14,360 KB
testcase_44 AC 186 ms
22,884 KB
testcase_45 AC 168 ms
21,928 KB
testcase_46 AC 134 ms
15,664 KB
testcase_47 AC 158 ms
21,164 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes.by_ref().map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};
    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, [graph1; $len:expr]) => {{
        let mut g = vec![vec![]; $len];
        let ab = read_value!($next, [(usize1, usize1)]);
        for (a, b) in ab {
            g[a].push(b);
            g[b].push(a);
        }
        g
    }};
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

trait Change {
    fn chmax(&mut self, x: Self);
    fn chmin(&mut self, x: Self);
}
impl<T: PartialOrd> Change for T {
    fn chmax(&mut self, x: T) {
        if *self < x { *self = x; }
    }
    fn chmin(&mut self, x: T) {
        if *self > x { *self = x; }
    }
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

/**
 * Segment Tree. This data structure is useful for fast folding on intervals of an array
 * whose elements are elements of monoid I. Note that constructing this tree requires the identity
 * element of I and the operation of I.
 * Verified by: yukicoder No. 259 (http://yukicoder.me/submissions/100581)
 *              AGC015-E (http://agc015.contest.atcoder.jp/submissions/1461001)
 */
struct SegTree<I, BiOp> {
    n: usize,
    dat: Vec<I>,
    op: BiOp,
    e: I,
}

impl<I, BiOp> SegTree<I, BiOp>
    where BiOp: Fn(I, I) -> I,
          I: Copy {
    pub fn new(n_: usize, op: BiOp, e: I) -> Self {
        let mut n = 1;
        while n < n_ { n *= 2; } // n is a power of 2
        SegTree {n: n, dat: vec![e; 2 * n - 1], op: op, e: e}
    }
    /* ary[k] <- v */
    pub fn update(&mut self, idx: usize, v: I) {
        let mut k = idx + self.n - 1;
        self.dat[k] = v;
        while k > 0 {
            k = (k - 1) / 2;
            self.dat[k] = (self.op)(self.dat[2 * k + 1], self.dat[2 * k + 2]);
        }
    }
    /* [a, b) (note: half-inclusive)
     * http://proc-cpuinfo.fixstars.com/2017/07/optimize-segment-tree/ */
    pub fn query(&self, mut a: usize, mut b: usize) -> I {
        let mut left = self.e;
        let mut right = self.e;
        a += self.n - 1;
        b += self.n - 1;
        while a < b {
            if (a & 1) == 0 {
                left = (self.op)(left, self.dat[a]);
            }
            if (b & 1) == 0 {
                right = (self.op)(self.dat[b - 1], right);
            }
            a = a / 2;
            b = (b - 1) / 2;
        }
        (self.op)(left, right)
    }
}

// Tags: event-sort, segment-tree
fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    #[allow(unused)]
    macro_rules! putvec {
        ($v:expr) => {
            for i in 0..$v.len() {
                puts!("{}{}", $v[i], if i + 1 == $v.len() {"\n"} else {" "});
            }
        }
    }
    input! {
        n: usize,
        x: [i64; n],
        q: usize,
        lrx: [(usize1, usize, i64); q],
    }
    let mut ev = vec![];
    for i in 0..n {
        ev.push((x[i], i, 1));
    }
    for i in 0..q {
        let (_l, _r, x) = lrx[i];
        ev.push((x, i, 0));
    }
    const INF: i64 = 1 << 50;
    let mut ans = vec![INF; q];
    ev.sort();
    let mut mi = SegTree::new(n, min, INF);
    let mut ma = SegTree::new(n, max, -INF);
    for i in 0..n {
        mi.update(i, x[i]);
    }
    for &(x, idx, ty) in &ev {
        if ty == 0 {
            let (l, r, _) = lrx[idx];
            let val1 = mi.query(l, r) - x;
            let val2 = x - ma.query(l, r);
            ans[idx] = min(val1, val2);
        } else {
            ma.update(idx, x);
            mi.update(idx, INF);
        }
    }
    for i in 0..q {
        puts!("{}\n", ans[i]);
    }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}
0