結果

問題 No.854 公平なりんご分配
ユーザー koba-e964koba-e964
提出日時 2019-07-26 23:44:31
言語 Rust
(1.77.0)
結果
AC  
実行時間 1,536 ms / 3,153 ms
コード長 3,370 bytes
コンパイル時間 1,212 ms
コンパイル使用メモリ 154,208 KB
実行使用メモリ 123,800 KB
最終ジャッジ日時 2023-09-15 05:07:44
合計ジャッジ時間 17,344 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 1 ms
4,376 KB
testcase_08 AC 1 ms
4,380 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 1 ms
4,380 KB
testcase_11 AC 1 ms
4,376 KB
testcase_12 AC 1 ms
4,376 KB
testcase_13 AC 1 ms
4,376 KB
testcase_14 AC 1 ms
4,380 KB
testcase_15 AC 1 ms
4,376 KB
testcase_16 AC 1 ms
4,376 KB
testcase_17 AC 2 ms
4,380 KB
testcase_18 AC 1 ms
4,380 KB
testcase_19 AC 2 ms
4,376 KB
testcase_20 AC 1 ms
4,380 KB
testcase_21 AC 1 ms
4,376 KB
testcase_22 AC 3 ms
4,376 KB
testcase_23 AC 3 ms
4,380 KB
testcase_24 AC 4 ms
4,376 KB
testcase_25 AC 2 ms
4,376 KB
testcase_26 AC 5 ms
4,380 KB
testcase_27 AC 3 ms
4,376 KB
testcase_28 AC 3 ms
4,376 KB
testcase_29 AC 2 ms
4,380 KB
testcase_30 AC 2 ms
4,376 KB
testcase_31 AC 5 ms
4,380 KB
testcase_32 AC 70 ms
27,356 KB
testcase_33 AC 87 ms
15,836 KB
testcase_34 AC 198 ms
37,020 KB
testcase_35 AC 126 ms
29,616 KB
testcase_36 AC 45 ms
4,376 KB
testcase_37 AC 69 ms
25,824 KB
testcase_38 AC 49 ms
21,196 KB
testcase_39 AC 357 ms
39,660 KB
testcase_40 AC 91 ms
13,800 KB
testcase_41 AC 131 ms
24,216 KB
testcase_42 AC 162 ms
36,228 KB
testcase_43 AC 240 ms
25,508 KB
testcase_44 AC 252 ms
34,072 KB
testcase_45 AC 117 ms
8,876 KB
testcase_46 AC 357 ms
33,856 KB
testcase_47 AC 97 ms
19,568 KB
testcase_48 AC 147 ms
35,688 KB
testcase_49 AC 140 ms
36,480 KB
testcase_50 AC 66 ms
25,540 KB
testcase_51 AC 367 ms
35,456 KB
testcase_52 AC 123 ms
17,008 KB
testcase_53 AC 55 ms
16,372 KB
testcase_54 AC 137 ms
19,644 KB
testcase_55 AC 38 ms
16,296 KB
testcase_56 AC 36 ms
16,648 KB
testcase_57 AC 68 ms
14,080 KB
testcase_58 AC 96 ms
7,480 KB
testcase_59 AC 28 ms
12,488 KB
testcase_60 AC 84 ms
14,324 KB
testcase_61 AC 26 ms
4,380 KB
testcase_62 AC 87 ms
12,460 KB
testcase_63 AC 52 ms
13,004 KB
testcase_64 AC 19 ms
6,124 KB
testcase_65 AC 81 ms
32,148 KB
testcase_66 AC 46 ms
9,800 KB
testcase_67 AC 98 ms
21,616 KB
testcase_68 AC 69 ms
10,652 KB
testcase_69 AC 63 ms
38,772 KB
testcase_70 AC 31 ms
13,808 KB
testcase_71 AC 36 ms
15,024 KB
testcase_72 AC 58 ms
4,376 KB
testcase_73 AC 53 ms
26,148 KB
testcase_74 AC 128 ms
32,064 KB
testcase_75 AC 66 ms
15,256 KB
testcase_76 AC 85 ms
25,448 KB
testcase_77 AC 93 ms
35,724 KB
testcase_78 AC 115 ms
11,652 KB
testcase_79 AC 135 ms
22,136 KB
testcase_80 AC 129 ms
23,464 KB
testcase_81 AC 70 ms
24,196 KB
testcase_82 AC 353 ms
123,800 KB
testcase_83 AC 593 ms
123,760 KB
testcase_84 AC 599 ms
123,764 KB
testcase_85 AC 612 ms
123,784 KB
testcase_86 AC 325 ms
123,776 KB
testcase_87 AC 343 ms
123,784 KB
testcase_88 AC 342 ms
123,764 KB
testcase_89 AC 336 ms
123,724 KB
testcase_90 AC 335 ms
123,764 KB
testcase_91 AC 336 ms
123,784 KB
testcase_92 AC 1,523 ms
123,760 KB
testcase_93 AC 1,536 ms
123,768 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
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);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (write!(out,$($format)*).unwrap());
    }
    input! {
        n: usize,
        a: [i32; n],
        plr: [(i64, usize1, usize)],
    }
    const W: usize = 2001;
    let mut fac = vec![0; W];
    for i in 2..W {
        fac[i] = i;
    }
    for i in 2..W {
        if fac[i] != i { continue; }
        for j in 2..(W - 1) / i + 1 {
            fac[i * j] = i;
        }
    }
    let primes: Vec<_> = (2..W).filter(|&i| fac[i] == i).collect();
    let m = primes.len();
    let mut inv = vec![0; W];
    for i in 0..m {
        inv[primes[i]] = i;
    }
    let mut acc = vec![vec![0i32; n + 1]; m];
    let mut zero = vec![0i32; n + 1];
    for i in 0..n {
        for j in 0..m {
            acc[j][i + 1] = acc[j][i];
        }
        zero[i + 1] = zero[i];
        if a[i] == 0 {
            zero[i + 1] += 1;
            continue;
        }
        let mut v = a[i];
        while v > 1 {
            let p = fac[v as usize];
            v /= p as i32;
            let idx = inv[p];
            acc[idx][i + 1] += 1;
        }
    }
    for &(p, l, r) in &plr {
        let mut ans = true;
        if zero[r] == zero[l] {
            let mut v = p;
            for i in 0..m {
                let mut e = 0;
                let p = primes[i] as i64;
                while v % p == 0 {
                    v /= p;
                    e += 1;
                }
                let diff = acc[i][r] - acc[i][l];
                if diff < e as i32 {
                    ans = false;
                }
            }
            if v > 1 {
                ans = false;
            }
        }
        puts!("{}\n", if ans { "Yes" } else { "NO" });
    }
}

fn main() {
    solve();
}
0