結果

問題 No.2242 Cities and Teleporters
ユーザー koba-e964koba-e964
提出日時 2023-03-11 00:39:11
言語 Rust
(1.77.0)
結果
WA  
実行時間 -
コード長 3,844 bytes
コンパイル時間 1,541 ms
コンパイル使用メモリ 186,188 KB
実行使用メモリ 42,492 KB
最終ジャッジ日時 2023-10-18 09:23:09
合計ジャッジ時間 10,047 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,348 KB
testcase_01 AC 1 ms
4,348 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 1 ms
4,348 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 455 ms
42,488 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 AC 304 ms
42,092 KB
testcase_19 AC 299 ms
41,780 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 241 ms
40,856 KB
testcase_23 AC 248 ms
42,488 KB
testcase_24 AC 251 ms
42,488 KB
testcase_25 AC 248 ms
42,488 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

use std::cmp::*;
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, ( $($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; } }
}

trait Bisect<T> {
    fn lower_bound(&self, val: &T) -> usize;
    fn upper_bound(&self, val: &T) -> usize;
}

impl<T: Ord> Bisect<T> for [T] {
    fn lower_bound(&self, val: &T) -> usize {
        let mut pass = self.len() + 1;
        let mut fail = 0;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if &self[mid - 1] >= val {
                pass = mid;
            } else {
                fail = mid;
            }
        }
        pass - 1
    }
    fn upper_bound(&self, val: &T) -> usize {
        let mut pass = self.len() + 1;
        let mut fail = 0;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if &self[mid - 1] > val {
                pass = mid;
            } else {
                fail = mid;
            }
        }
        pass - 1
    }
}

fn main() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}
    input! {
        n: usize,
        h: [i64; n],
        t: [i64; n],
        q: usize,
        ab: [(usize1, usize1); q],
    }
    let mut hi = vec![];
    for i in 0..n {
        hi.push((h[i], i));
    }
    hi.sort();
    let mut map = vec![0; n];
    for i in 0..n {
        map[hi[i].1] = i;
    }
    let mut to = vec![0; n];
    for i in 0..n {
        let idx = hi.upper_bound(&(t[i], n));
        to[map[i]] = idx;
    }
    const B: usize = 18;
    let mut bin = vec![vec![0; n + 1]; B];
    for i in 0..n {
        bin[0][i + 1] = max(bin[0][i], to[i]);
    }
    for i in 0..B - 1 {
        for j in 0..n {
            bin[i + 1][j] = bin[i][bin[i][j]];
        }
    }
    for (a, b) in ab {
        let a = map[a];
        let b = map[b];
        let mut a = to[a];
        if b < a {
            puts!("1\n");
            continue;
        }
        if bin[0][a] <= a {
            puts!("-1\n");
            continue;
        }
        let mut x = 0;
        for i in (0..B).rev() {
            if bin[i][a] <= b {
                x |= 1 << i;
                a = bin[i][a];
            }
        }
        if bin[0][a] <= b {
            puts!("-1\n");
        } else {
            puts!("{}\n", x + 2);
        }
    }
}
0