結果
問題 | No.854 公平なりんご分配 |
ユーザー | koba-e964 |
提出日時 | 2019-07-26 23:46:37 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 1,718 ms / 3,153 ms |
コード長 | 3,451 bytes |
コンパイル時間 | 1,212 ms |
コンパイル使用メモリ | 155,012 KB |
実行使用メモリ | 123,784 KB |
最終ジャッジ日時 | 2023-09-15 05:09:04 |
合計ジャッジ時間 | 19,250 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,384 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,380 KB |
testcase_10 | AC | 1 ms
4,376 KB |
testcase_11 | AC | 1 ms
4,376 KB |
testcase_12 | AC | 1 ms
4,376 KB |
testcase_13 | AC | 2 ms
4,376 KB |
testcase_14 | AC | 1 ms
4,380 KB |
testcase_15 | AC | 1 ms
4,380 KB |
testcase_16 | AC | 1 ms
4,380 KB |
testcase_17 | AC | 1 ms
4,376 KB |
testcase_18 | AC | 1 ms
4,380 KB |
testcase_19 | AC | 1 ms
4,384 KB |
testcase_20 | AC | 1 ms
4,376 KB |
testcase_21 | AC | 1 ms
4,380 KB |
testcase_22 | AC | 3 ms
4,376 KB |
testcase_23 | AC | 3 ms
4,376 KB |
testcase_24 | AC | 5 ms
4,380 KB |
testcase_25 | AC | 2 ms
4,376 KB |
testcase_26 | AC | 5 ms
4,376 KB |
testcase_27 | AC | 3 ms
4,380 KB |
testcase_28 | AC | 3 ms
4,376 KB |
testcase_29 | AC | 2 ms
4,376 KB |
testcase_30 | AC | 2 ms
4,376 KB |
testcase_31 | AC | 5 ms
4,380 KB |
testcase_32 | AC | 80 ms
27,268 KB |
testcase_33 | AC | 126 ms
15,808 KB |
testcase_34 | AC | 227 ms
37,024 KB |
testcase_35 | AC | 147 ms
29,648 KB |
testcase_36 | AC | 46 ms
4,376 KB |
testcase_37 | AC | 77 ms
25,824 KB |
testcase_38 | AC | 55 ms
21,212 KB |
testcase_39 | AC | 418 ms
39,572 KB |
testcase_40 | AC | 140 ms
13,760 KB |
testcase_41 | AC | 168 ms
24,148 KB |
testcase_42 | AC | 189 ms
36,496 KB |
testcase_43 | AC | 296 ms
25,476 KB |
testcase_44 | AC | 284 ms
34,132 KB |
testcase_45 | AC | 126 ms
8,888 KB |
testcase_46 | AC | 395 ms
33,944 KB |
testcase_47 | AC | 116 ms
19,484 KB |
testcase_48 | AC | 161 ms
35,624 KB |
testcase_49 | AC | 150 ms
36,416 KB |
testcase_50 | AC | 68 ms
25,632 KB |
testcase_51 | AC | 384 ms
35,380 KB |
testcase_52 | AC | 160 ms
16,988 KB |
testcase_53 | AC | 67 ms
16,188 KB |
testcase_54 | AC | 166 ms
19,572 KB |
testcase_55 | AC | 42 ms
16,316 KB |
testcase_56 | AC | 39 ms
16,720 KB |
testcase_57 | AC | 80 ms
13,984 KB |
testcase_58 | AC | 96 ms
7,464 KB |
testcase_59 | AC | 31 ms
12,488 KB |
testcase_60 | AC | 96 ms
14,276 KB |
testcase_61 | AC | 26 ms
4,380 KB |
testcase_62 | AC | 102 ms
12,484 KB |
testcase_63 | AC | 58 ms
13,000 KB |
testcase_64 | AC | 21 ms
6,160 KB |
testcase_65 | AC | 87 ms
32,172 KB |
testcase_66 | AC | 54 ms
9,860 KB |
testcase_67 | AC | 118 ms
21,672 KB |
testcase_68 | AC | 80 ms
10,656 KB |
testcase_69 | AC | 67 ms
39,108 KB |
testcase_70 | AC | 35 ms
13,764 KB |
testcase_71 | AC | 42 ms
15,032 KB |
testcase_72 | AC | 59 ms
4,376 KB |
testcase_73 | AC | 56 ms
26,164 KB |
testcase_74 | AC | 149 ms
31,948 KB |
testcase_75 | AC | 86 ms
15,244 KB |
testcase_76 | AC | 97 ms
25,432 KB |
testcase_77 | AC | 104 ms
35,720 KB |
testcase_78 | AC | 147 ms
11,612 KB |
testcase_79 | AC | 165 ms
22,124 KB |
testcase_80 | AC | 158 ms
23,436 KB |
testcase_81 | AC | 83 ms
24,204 KB |
testcase_82 | AC | 368 ms
123,644 KB |
testcase_83 | AC | 616 ms
123,764 KB |
testcase_84 | AC | 619 ms
123,764 KB |
testcase_85 | AC | 635 ms
123,760 KB |
testcase_86 | AC | 335 ms
123,760 KB |
testcase_87 | AC | 351 ms
123,764 KB |
testcase_88 | AC | 348 ms
123,760 KB |
testcase_89 | AC | 352 ms
123,760 KB |
testcase_90 | AC | 350 ms
123,784 KB |
testcase_91 | AC | 350 ms
123,760 KB |
testcase_92 | AC | 1,718 ms
123,784 KB |
testcase_93 | AC | 1,712 ms
123,784 KB |
ソースコード
#[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 { assert!(1 <= p && p <= 1_000_000_000); assert!(l < r && r <= n); 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(); }