#982636 (Rust) No.2758 RDQ

• 問題: No.2758 RDQ
• ユーザー: Yukino DX.
• 提出日時: 2024-05-18 09:21:05
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 198 ms / 2,000 ms
• コード長: 4,434 bytes
• コンパイル時間: 13,896 ms
• コンパイル使用メモリ: 405,372 KB
• 実行使用メモリ: 26,368 KB
• 最終ジャッジ日時: 2024-05-18 09:21:25
• 合計ジャッジ時間: 16,282 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	136 ms; 13,780 KB
testcase_01	AC	1 ms; 6,940 KB
testcase_02	AC	1 ms; 6,940 KB
testcase_03	AC	1 ms; 6,940 KB
testcase_04	AC	1 ms; 6,940 KB
testcase_05	AC	1 ms; 6,940 KB
testcase_06	AC	198 ms; 25,984 KB
testcase_07	AC	178 ms; 26,112 KB
testcase_08	AC	182 ms; 26,368 KB
testcase_09	AC	176 ms; 26,240 KB
testcase_10	AC	185 ms; 26,112 KB
testcase_11	AC	168 ms; 18,032 KB
testcase_12	AC	171 ms; 17,984 KB
testcase_13	AC	181 ms; 17,992 KB
testcase_14	AC	159 ms; 18,036 KB
testcase_15	AC	162 ms; 17,972 KB
testcase_16	AC	162 ms; 17,980 KB
testcase_17	AC	165 ms; 18,016 KB
testcase_18	AC	165 ms; 18,028 KB
testcase_19	AC	182 ms; 18,008 KB
testcase_20	AC	160 ms; 17,948 KB
testcase_21	AC	1 ms; 6,940 KB
testcase_22	AC	1 ms; 6,940 KB
testcase_23	AC	1 ms; 6,944 KB

ソースコード

use std::collections::HashMap;

use proconio::input;

fn main() {
    input! {
        n:usize,
        q:usize,
        a:[usize;n],
        lrk:[(usize,usize,usize);q],
    }

    let mut di = HashMap::new();
    for i in 0..n {
        for d in divisors(a[i]) {
            di.entry(d).or_insert(vec![]).push(i + 1);
        }
    }

    for (l, r, k) in lrk {
        let ans = if let Some(is) = di.get(&k) {
            let ri = is.lower_bound(r + 1);
            let li = is.lower_bound(l);
            ri - li
        } else {
            0
        };

        println!("{}", ans);
    }
}

use math::*;
mod math {
    #[allow(dead_code)]
    pub fn pow(mut n: usize, mut e: usize, m: usize) -> usize {
        let mut res = 1;
        n %= m;
        while 0 < e {
            if e & 1 != 0 {
                res *= n;
                res %= m;
            }

            n *= n;
            n %= m;
            e >>= 1;
        }

        res
    }

    #[allow(dead_code)]
    pub fn gcd(a: usize, b: usize) -> usize {
        if b == 0 {
            a
        } else {
            gcd(b, a % b)
        }
    }

    #[allow(dead_code)]
    pub fn lcm(a: usize, b: usize) -> usize {
        a / gcd(a, b) * b
    }

    #[allow(dead_code)]
    pub fn prime_factor(mut n: usize) -> std::collections::HashMap<usize, usize> {
        let mut pfacs = std::collections::HashMap::new();
        for d in 2.. {
            if d * d > n {
                break;
            }

            while n % d == 0 {
                *pfacs.entry(d).or_insert(0) += 1;
                n /= d;
            }
        }
        if n != 1 {
            *pfacs.entry(n).or_insert(0) += 1;
        }

        pfacs
    }

    #[allow(dead_code)]
    pub fn divisors(n: usize) -> Vec<usize> {
        let mut divs = vec![];
        for d in (1..).take_while(|&d| d * d <= n) {
            if n % d == 0 {
                divs.push(d);
                if n / d != d {
                    divs.push(n / d);
                }
            }
        }

        divs
    }

    #[allow(dead_code)]
    pub fn eratosthenes_sieve(n: usize) -> Vec<usize> {
        let mut is_primes = vec![true; n + 1];
        is_primes[0] = false;
        is_primes[1] = false;
        let mut primes = vec![];

        for i in 2..=n {
            if !is_primes[i] {
                continue;
            }

            for j in (2 * i..=n).step_by(i) {
                is_primes[j] = false;
            }
        }

        for (val, is_prime) in is_primes.into_iter().enumerate() {
            if is_prime {
                primes.push(val);
            }
        }

        primes
    }

    #[allow(dead_code)]
    pub fn base_n(mut base10: usize, base: usize, len: usize) -> Vec<usize> {
        let mut base_n = vec![];
        for _ in 0..len {
            base_n.push(base10 % base);
            base10 /= base;
        }
        base_n.reverse();

        base_n
    }

    #[allow(dead_code)]
    pub fn div_floor(mut a: i64, mut b: i64) -> i64 {
        if b < 0 {
            a = -a;
            b = -b;
        }

        if a >= 0 {
            a / b
        } else {
            (a + 1) / b - 1
        }
    }

    #[allow(dead_code)]
    pub fn div_ceil(mut a: i64, mut b: i64) -> i64 {
        if b < 0 {
            a = -a;
            b = -b;
        }
        if a > 0 {
            (a - 1) / b + 1
        } else {
            a / b
        }
    }
}

use bound::*;
mod bound {
    pub trait Bound<T> {
        fn lower_bound(&self, val: T) -> usize;
        fn upper_bound(&self, val: T) -> usize;
    }

    impl<T> Bound<T> for [T]
    where
        T: Ord + Copy,
    {
        fn lower_bound(&self, val: T) -> usize {
            let mut ok = self.len();
            let mut ng = !0;
            while ok.wrapping_sub(ng) > 1 {
                let m = ok.wrapping_add(ng) / 2;
                if val <= self[m] {
                    ok = m;
                } else {
                    ng = m;
                }
            }

            ok
        }

        fn upper_bound(&self, val: T) -> usize {
            let mut ok = !0;
            let mut ng = self.len();
            while ng.wrapping_sub(ok) > 1 {
                let m = ng.wrapping_add(ok) / 2;
                if self[m] <= val {
                    ok = m;
                } else {
                    ng = m;
                }
            }

            ok
        }
    }
}