結果

問題 No.1332 Range Nearest Query
ユーザー koba-e964koba-e964
提出日時 2021-01-10 23:07:14
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 283 ms / 2,500 ms
コード長 5,394 bytes
コンパイル時間 25,557 ms
コンパイル使用メモリ 404,300 KB
実行使用メモリ 34,464 KB
最終ジャッジ日時 2024-11-21 08:36:55
合計ジャッジ時間 34,967 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 1 ms
6,820 KB
testcase_02 AC 1 ms
6,816 KB
testcase_03 AC 230 ms
24,100 KB
testcase_04 AC 229 ms
24,260 KB
testcase_05 AC 224 ms
25,376 KB
testcase_06 AC 169 ms
34,144 KB
testcase_07 AC 173 ms
34,160 KB
testcase_08 AC 172 ms
33,416 KB
testcase_09 AC 170 ms
34,132 KB
testcase_10 AC 169 ms
33,888 KB
testcase_11 AC 171 ms
33,796 KB
testcase_12 AC 170 ms
33,284 KB
testcase_13 AC 169 ms
34,212 KB
testcase_14 AC 166 ms
34,072 KB
testcase_15 AC 169 ms
34,028 KB
testcase_16 AC 271 ms
34,280 KB
testcase_17 AC 275 ms
33,684 KB
testcase_18 AC 264 ms
34,164 KB
testcase_19 AC 275 ms
34,464 KB
testcase_20 AC 283 ms
34,284 KB
testcase_21 AC 261 ms
33,368 KB
testcase_22 AC 274 ms
34,076 KB
testcase_23 AC 280 ms
34,152 KB
testcase_24 AC 267 ms
33,748 KB
testcase_25 AC 270 ms
34,148 KB
testcase_26 AC 127 ms
33,764 KB
testcase_27 AC 124 ms
33,552 KB
testcase_28 AC 42 ms
8,448 KB
testcase_29 AC 43 ms
8,448 KB
testcase_30 AC 44 ms
8,380 KB
testcase_31 AC 40 ms
8,384 KB
testcase_32 AC 45 ms
8,576 KB
testcase_33 AC 46 ms
8,576 KB
testcase_34 AC 41 ms
8,448 KB
testcase_35 AC 43 ms
8,704 KB
testcase_36 AC 44 ms
8,448 KB
testcase_37 AC 43 ms
8,644 KB
testcase_38 AC 169 ms
20,628 KB
testcase_39 AC 81 ms
8,832 KB
testcase_40 AC 258 ms
33,364 KB
testcase_41 AC 108 ms
11,312 KB
testcase_42 AC 162 ms
20,144 KB
testcase_43 AC 134 ms
14,364 KB
testcase_44 AC 212 ms
23,224 KB
testcase_45 AC 194 ms
22,028 KB
testcase_46 AC 153 ms
15,540 KB
testcase_47 AC 179 ms
21,248 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