結果
問題 | No.1332 Range Nearest Query |
ユーザー |
![]() |
提出日時 | 2021-01-08 21:54:24 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 207 ms / 2,500 ms |
コード長 | 5,155 bytes |
コンパイル時間 | 13,237 ms |
コンパイル使用メモリ | 383,940 KB |
実行使用メモリ | 26,540 KB |
最終ジャッジ日時 | 2024-11-16 11:21:47 |
合計ジャッジ時間 | 23,170 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 48 |
ソースコード
// ---------- begin chmin, chmax ----------trait ChangeMinMax {fn chmin(&mut self, x: Self) -> bool;fn chmax(&mut self, x: Self) -> bool;}impl<T: PartialOrd> ChangeMinMax for T {fn chmin(&mut self, x: Self) -> bool {*self > x && {*self = x;true}}fn chmax(&mut self, x: Self) -> bool {*self < x && {*self = x;true}}}// ---------- end chmin, chmax ----------// ---------- begin SegmentTree Point update Range query ----------mod segment_tree {pub struct PURQ<T, F> {n: usize,a: Vec<T>,id: T,op: F,}#[allow(dead_code)]impl<T: Clone, F: Fn(&T, &T) -> T> PURQ<T, F> {pub fn new(n: usize, id: T, op: F) -> PURQ<T, F> {let mut k = 1;while k < n {k *= 2;}PURQ {n: k,a: vec![id.clone(); 2 * k],id: id,op: op,}}pub fn update(&mut self, x: usize, v: T) {let mut k = self.n + x;let a = &mut self.a;a[k] = v;k >>= 1;while k > 0 {a[k] = (self.op)(&a[2 * k], &a[2 * k + 1]);k >>= 1;}}pub fn update_tmp(&mut self, x: usize, v: T) {self.a[x + self.n] = v;}pub fn update_all(&mut self) {let a = &mut self.a;for k in (1..(self.n)).rev() {a[k] = (self.op)(&a[2 * k], &a[2 * k + 1]);}}pub fn find(&self, mut l: usize, mut r: usize) -> T {let mut p = self.id.clone();let mut q = self.id.clone();l += self.n;r += self.n;let a = &self.a;while l < r {if (l & 1) == 1 {p = (self.op)(&p, &a[l]);l += 1;}if (r & 1) == 1 {r -= 1;q = (self.op)(&a[r], &q);}l >>= 1;r >>= 1;}(self.op)(&p, &q)}}}// ---------- end SegmentTree Point update Range query ----------// ---------- begin input macro ----------// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8macro_rules! input {(source = $s:expr, $($r:tt)*) => {let mut iter = $s.split_whitespace();input_inner!{iter, $($r)*}};($($r:tt)*) => {let s = {use std::io::Read;let mut s = String::new();std::io::stdin().read_to_string(&mut s).unwrap();s};let mut iter = s.split_whitespace();input_inner!{iter, $($r)*}};}macro_rules! input_inner {($iter:expr) => {};($iter:expr, ) => {};($iter:expr, $var:ident : $t:tt $($r:tt)*) => {let $var = read_value!($iter, $t);input_inner!{$iter $($r)*}};}macro_rules! read_value {($iter:expr, ( $($t:tt),* )) => {( $(read_value!($iter, $t)),* )};($iter:expr, [ $t:tt ; $len:expr ]) => {(0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()};($iter:expr, chars) => {read_value!($iter, String).chars().collect::<Vec<char>>()};($iter:expr, bytes) => {read_value!($iter, String).bytes().collect::<Vec<u8>>()};($iter:expr, usize1) => {read_value!($iter, usize) - 1};($iter:expr, $t:ty) => {$iter.next().unwrap().parse::<$t>().expect("Parse error")};}// ---------- end input macro ----------use std::io::Write;fn run() {input! {n: usize,x: [i64; n],q: usize,ask: [(usize1, usize, i64); q],}let mut ask = ask.into_iter().enumerate().map(|(k, (l, r, x))| (l, r, x, k)).collect::<Vec<_>>();ask.sort_by_key(|p| p.2);let mut x = x.into_iter().enumerate().collect::<Vec<_>>();x.sort_by_key(|p| p.1);let inf = 10i64.pow(10);let mut ans = vec![inf; q];{let mut seg = segment_tree::PURQ::new(n, -inf, |a, b| std::cmp::max(*a, *b));let mut p = 0;for &(l, r, y, k) in ask.iter() {while p < n && x[p].1 <= y {let (pos, x) = x[p];p += 1;seg.update(pos, x);}let x = seg.find(l, r);ans[k].chmin(y - x);}}{let mut seg = segment_tree::PURQ::new(n, inf, |a, b| std::cmp::min(*a, *b));let mut p = n;for &(l, r, y, k) in ask.iter().rev() {while p > 0 && x[p - 1].1 >= y {let (pos, x) = x[p- 1];p -= 1;seg.update(pos, x);}let x = seg.find(l, r);ans[k].chmin(x - y);}}let out = std::io::stdout();let mut out = std::io::BufWriter::new(out.lock());for a in ans {writeln!(out, "{}", a).ok();}}fn main() {run();}