結果

問題 No.1332 Range Nearest Query
ユーザー nebocco
提出日時 2021-06-04 15:51:39
言語 Rust
(1.83.0 + proconio)
結果
TLE  
実行時間 -
コード長 6,772 bytes
コンパイル時間 14,985 ms
コンパイル使用メモリ 378,284 KB
実行使用メモリ 38,464 KB
最終ジャッジ日時 2024-11-19 01:19:25
合計ジャッジ時間 135,926 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 15 TLE * 33
権限があれば一括ダウンロードができます

ソースコード

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

fn main() {
let mut io = IO::new();
input!{ from io,
n: usize,
a: [i64; n],
q: usize,
query: [(Usize1, Usize1, i64); q]
}
let mut res = vec![0; q];
let mut qi = (0..q).collect::<Vec<usize>>();
qi.sort_by_key(|&i| {
let (l, r, _) = query[i];
let v = l / 700;
if v & 1 == 1 {
v * 2 * n - r
} else {
v * 2 * n + r
}
});
let mut btree = MultiSet::new();
let mut cl = 0;
let mut cr = 0;
for &i in &qi {
let (l, r, x) = query[i];
for j in cr..=r {
btree.insert(a[j]);
}
for j in l..cl {
btree.insert(a[j]);
}
for j in cl..l {
btree.remove(a[j]);
}
for j in r+1..cr {
btree.remove(a[j]);
}
cl = l;
cr = r + 1;
let mut ans = (x - a[l]).abs().min(x - a[r]).abs();
if let Some(&lo) = btree.lower_bound(x) {
ans = ans.min((x - lo).abs())
}
if let Some(&hi) = btree.upper_bound(x) {
ans = ans.min((x - hi).abs())
}
res[i] = ans;
}
io.iterln(res.into_iter(), "\n");
}
pub struct MultiSet<T> (std::collections::BTreeMap<T, usize>);
impl<T: Ord + Clone + Copy> MultiSet<T> {
pub fn new() -> Self {
Self(std::collections::BTreeMap::new())
}
pub fn insert(&mut self, x: T) {
*self.0.entry(x).or_default() += 1;
}
pub fn remove(&mut self, x: T) {
let v = self.0.entry(x).or_default();
if *v <= 1 {
self.0.remove(&x);
} else {
*v -= 1;
}
}
pub fn lower_bound(&self, x: T) -> Option<&T> {
self.0.range(..=x).rev().next().map(|v| v.0)
}
pub fn upper_bound(&self, x: T) -> Option<&T> {
self.0.range(x..).next().map(|v| v.0)
}
}
impl<T> std::ops::Deref for MultiSet<T> {
type Target = std::collections::BTreeMap<T, usize>;
fn deref(&self) -> &Self::Target {
&self.0
}
}
impl<T> std::ops::DerefMut for MultiSet<T> {
fn deref_mut(&mut self) -> &mut Self::Target {
&mut self.0
}
}
// ------------ io module start ------------
use std::io::{stdout, BufWriter, Read, StdoutLock, Write};
pub struct IO {
iter: std::str::SplitAsciiWhitespace<'static>,
buf: BufWriter<StdoutLock<'static>>,
}
impl IO {
pub fn new() -> Self {
let mut input = String::new();
std::io::stdin().read_to_string(&mut input).unwrap();
let input = Box::leak(input.into_boxed_str());
let out = Box::new(stdout());
IO {
iter: input.split_ascii_whitespace(),
buf: BufWriter::new(Box::leak(out).lock()),
}
}
fn scan_str(&mut self) -> &'static str {
self.iter.next().unwrap()
}
pub fn scan<T: Scan>(&mut self) -> <T as Scan>::Output {
<T as Scan>::scan(self)
}
pub fn scan_vec<T: Scan>(&mut self, n: usize) -> Vec<<T as Scan>::Output> {
(0..n).map(|_| self.scan::<T>()).collect()
}
pub fn print<T: Print>(&mut self, x: T) {
<T as Print>::print(self, x);
}
pub fn println<T: Print>(&mut self, x: T) {
self.print(x);
self.print("\n");
}
pub fn iterln<T: Print, I: Iterator<Item = T>>(&mut self, mut iter: I, delim: &str) {
if let Some(v) = iter.next() {
self.print(v);
for v in iter {
self.print(delim);
self.print(v);
}
}
self.print("\n");
}
pub fn flush(&mut self) {
self.buf.flush().unwrap();
}
}
impl Default for IO {
fn default() -> Self {
Self::new()
}
}
pub trait Scan {
type Output;
fn scan(io: &mut IO) -> Self::Output;
}
macro_rules! impl_scan {
($($t:tt),*) => {
$(
impl Scan for $t {
type Output = Self;
fn scan(s: &mut IO) -> Self::Output {
s.scan_str().parse().unwrap()
}
}
)*
};
}
impl_scan!(i16, i32, i64, isize, u16, u32, u64, usize, String, f32, f64);
impl Scan for char {
type Output = char;
fn scan(s: &mut IO) -> Self::Output {
s.scan_str().chars().next().unwrap()
}
}
pub enum Bytes {}
impl Scan for Bytes {
type Output = &'static [u8];
fn scan(s: &mut IO) -> Self::Output {
s.scan_str().as_bytes()
}
}
pub enum Chars {}
impl Scan for Chars {
type Output = Vec<char>;
fn scan(s: &mut IO) -> Self::Output {
s.scan_str().chars().collect()
}
}
pub enum Usize1 {}
impl Scan for Usize1 {
type Output = usize;
fn scan(s: &mut IO) -> Self::Output {
s.scan::<usize>().wrapping_sub(1)
}
}
impl<T: Scan, U: Scan> Scan for (T, U) {
type Output = (T::Output, U::Output);
fn scan(s: &mut IO) -> Self::Output {
(T::scan(s), U::scan(s))
}
}
impl<T: Scan, U: Scan, V: Scan> Scan for (T, U, V) {
type Output = (T::Output, U::Output, V::Output);
fn scan(s: &mut IO) -> Self::Output {
(T::scan(s), U::scan(s), V::scan(s))
}
}
impl<T: Scan, U: Scan, V: Scan, W: Scan> Scan for (T, U, V, W) {
type Output = (T::Output, U::Output, V::Output, W::Output);
fn scan(s: &mut IO) -> Self::Output {
(T::scan(s), U::scan(s), V::scan(s), W::scan(s))
}
}
pub trait Print {
fn print(w: &mut IO, x: Self);
}
macro_rules! impl_print_int {
($($t:ty),*) => {
$(
impl Print for $t {
fn print(w: &mut IO, x: Self) {
w.buf.write_all(x.to_string().as_bytes()).unwrap();
}
}
)*
};
}
impl_print_int!(i16, i32, i64, isize, u16, u32, u64, usize, f32, f64);
impl Print for u8 {
fn print(w: &mut IO, x: Self) {
w.buf.write_all(&[x]).unwrap();
}
}
impl Print for &[u8] {
fn print(w: &mut IO, x: Self) {
w.buf.write_all(x).unwrap();
}
}
impl Print for &str {
fn print(w: &mut IO, x: Self) {
w.print(x.as_bytes());
}
}
impl Print for String {
fn print(w: &mut IO, x: Self) {
w.print(x.as_bytes());
}
}
impl<T: Print, U: Print> Print for (T, U) {
fn print(w: &mut IO, (x, y): Self) {
w.print(x);
w.print(" ");
w.print(y);
}
}
impl<T: Print, U: Print, V: Print> Print for (T, U, V) {
fn print(w: &mut IO, (x, y, z): Self) {
w.print(x);
w.print(" ");
w.print(y);
w.print(" ");
w.print(z);
}
}
mod neboccoio_macro {
#[macro_export]
macro_rules! input {
(@start $io:tt @read @rest) => {};
(@start $io:tt @read @rest, $($rest: tt)*) => {
input!(@start $io @read @rest $($rest)*)
};
(@start $io:tt @read @rest mut $($rest:tt)*) => {
input!(@start $io @read @mut [mut] @rest $($rest)*)
};
(@start $io:tt @read @rest $($rest:tt)*) => {
input!(@start $io @read @mut [] @rest $($rest)*)
};
(@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: [[$kind:tt; $len1:expr]; $len2:expr] $($rest:tt)*) => {
let $($mut)* $var = (0..$len2).map(|_| $io.scan_vec::<$kind>($len1)).collect::<Vec<Vec<$kind>>>();
input!(@start $io @read @rest $($rest)*)
};
(@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: [$kind:tt; $len:expr] $($rest:tt)*) => {
let $($mut)* $var = $io.scan_vec::<$kind>($len);
input!(@start $io @read @rest $($rest)*)
};
(@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: $kind:tt $($rest:tt)*) => {
let $($mut)* $var = $io.scan::<$kind>();
input!(@start $io @read @rest $($rest)*)
};
(from $io:tt $($rest:tt)*) => {
input!(@start $io @read @rest $($rest)*)
};
}
}
// ------------ io module end ------------
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0