結果

問題 No.2710 How many more?
ユーザー nautnaut
提出日時 2024-03-31 14:06:21
言語 Rust
(1.77.0)
結果
AC  
実行時間 82 ms / 2,000 ms
コード長 3,995 bytes
コンパイル時間 1,876 ms
コンパイル使用メモリ 204,844 KB
実行使用メモリ 8,964 KB
最終ジャッジ日時 2024-03-31 14:06:27
合計ジャッジ時間 3,843 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,676 KB
testcase_01 AC 1 ms
6,676 KB
testcase_02 AC 59 ms
6,676 KB
testcase_03 AC 43 ms
6,676 KB
testcase_04 AC 46 ms
8,380 KB
testcase_05 AC 26 ms
6,676 KB
testcase_06 AC 38 ms
7,508 KB
testcase_07 AC 16 ms
6,676 KB
testcase_08 AC 18 ms
6,676 KB
testcase_09 AC 58 ms
7,268 KB
testcase_10 AC 31 ms
6,676 KB
testcase_11 AC 41 ms
6,676 KB
testcase_12 AC 76 ms
8,320 KB
testcase_13 AC 81 ms
8,964 KB
testcase_14 AC 82 ms
8,964 KB
testcase_15 AC 82 ms
8,964 KB
testcase_16 AC 82 ms
8,964 KB
testcase_17 AC 81 ms
8,964 KB
testcase_18 AC 1 ms
6,676 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#![allow(non_snake_case, unused_imports, unused_must_use)]
use std::io::{self, prelude::*};
use std::str;

fn main() {
    let (stdin, stdout) = (io::stdin(), io::stdout());
    let mut scan = Scanner::new(stdin.lock());
    let mut out = io::BufWriter::new(stdout.lock());

    macro_rules! input {
        ($T: ty) => {
            scan.token::<$T>()
        };
        ($T: ty, $N: expr) => {
            (0..$N).map(|_| scan.token::<$T>()).collect::<Vec<_>>()
        };
    }

    let N = input!(usize);
    let Q = input!(usize);
    let A = input!(usize, N);

    let (z, zi) = coordinate_compression(&A);

    let mut bit = BinaryIndexedTree::new(z.len());

    for &a in A.iter() {
        let &p = zi.get(&a).unwrap();
        bit.add(p, 1isize);
    }

    for _ in 0..Q {
        let X = input!(usize) - 1;
        let Y = input!(usize) - 1;

        let &zx = zi.get(&A[X]).unwrap();
        let &zy = zi.get(&A[Y]).unwrap();

        let mut ans = 0;

        if zy + 1 < z.len() && zy + 1 < zx {
            ans += bit.sum(zy + 1..zx);
        }

        writeln!(out, "{}", ans);
    }
}

pub struct BinaryIndexedTree<T> {
    tree: Vec<T>,
}

impl<T: Default + Clone + Copy + std::ops::AddAssign + std::ops::Sub<Output = T>>
    BinaryIndexedTree<T>
{
    /// self = [0; size]
    pub fn new(size: usize) -> Self {
        return Self {
            tree: vec![T::default(); size + 1],
        };
    }

    /// self[i] <- self[i] + w
    pub fn add(&mut self, i: usize, w: T) {
        self._inner_add(i + 1, w);
    }

    /// return Σ_{j ∈ [0, i]} self[j]
    pub fn prefix_sum(&self, i: usize) -> T {
        self._inner_sum(i + 1)
    }

    /// return Σ_{j ∈ range} self[j]
    pub fn sum<R: std::ops::RangeBounds<usize>>(&self, range: R) -> T {
        let left = match range.start_bound() {
            std::ops::Bound::Included(&l) => l,
            std::ops::Bound::Excluded(&l) => l + 1,
            std::ops::Bound::Unbounded => 0,
        };

        let right = match range.end_bound() {
            std::ops::Bound::Included(&r) => r,
            std::ops::Bound::Excluded(&r) => r - 1,
            std::ops::Bound::Unbounded => self.tree.len() - 2,
        };

        if left == 0 {
            return self.prefix_sum(right);
        } else {
            return self.prefix_sum(right) - self.prefix_sum(left - 1);
        }
    }

    fn _inner_add(&mut self, mut i: usize, w: T) {
        while i < self.tree.len() {
            self.tree[i] += w;
            i += i & i.wrapping_neg();
        }
    }

    fn _inner_sum(&self, mut i: usize) -> T {
        let mut ret = T::default();
        while i > 0 {
            ret += self.tree[i];
            i -= i & i.wrapping_neg();
        }
        return ret;
    }
}

pub fn coordinate_compression<T: std::cmp::Ord + Clone + Copy>(
    values: &[T],
) -> (Vec<T>, std::collections::BTreeMap<T, usize>) {
    let s: std::collections::BTreeSet<T> = values.iter().cloned().collect();
    let z: Vec<T> = s.iter().cloned().collect();
    let zinv: std::collections::BTreeMap<T, usize> =
        z.iter().enumerate().map(|(i, &v)| (v, i)).collect();
    (z, zinv)
}

struct Scanner<R> {
    reader: R,
    buf_str: Vec<u8>,
    buf_iter: str::SplitWhitespace<'static>,
}
impl<R: BufRead> Scanner<R> {
    fn new(reader: R) -> Self {
        Self {
            reader,
            buf_str: vec![],
            buf_iter: "".split_whitespace(),
        }
    }
    fn token<T: str::FromStr>(&mut self) -> T {
        loop {
            if let Some(token) = self.buf_iter.next() {
                return token.parse().ok().expect("Failed parse");
            }
            self.buf_str.clear();
            self.reader
                .read_until(b'\n', &mut self.buf_str)
                .expect("Failed read");
            self.buf_iter = unsafe {
                let slice = str::from_utf8_unchecked(&self.buf_str);
                std::mem::transmute(slice.split_whitespace())
            }
        }
    }
}
0