結果
問題 | No.2207 pCr検査 |
ユーザー | akakimidori |
提出日時 | 2023-02-03 22:06:41 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 2,446 ms / 3,000 ms |
コード長 | 3,531 bytes |
コンパイル時間 | 6,785 ms |
コンパイル使用メモリ | 143,556 KB |
実行使用メモリ | 135,516 KB |
最終ジャッジ日時 | 2023-09-15 17:59:50 |
合計ジャッジ時間 | 38,678 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 632 ms
107,784 KB |
testcase_03 | AC | 449 ms
67,624 KB |
testcase_04 | AC | 425 ms
82,928 KB |
testcase_05 | AC | 930 ms
109,140 KB |
testcase_06 | AC | 279 ms
86,636 KB |
testcase_07 | AC | 264 ms
63,092 KB |
testcase_08 | AC | 205 ms
37,012 KB |
testcase_09 | AC | 697 ms
87,704 KB |
testcase_10 | AC | 123 ms
53,384 KB |
testcase_11 | AC | 593 ms
83,536 KB |
testcase_12 | AC | 1,913 ms
101,520 KB |
testcase_13 | AC | 1,094 ms
60,320 KB |
testcase_14 | AC | 230 ms
16,564 KB |
testcase_15 | AC | 2,361 ms
118,140 KB |
testcase_16 | AC | 914 ms
54,116 KB |
testcase_17 | AC | 1,692 ms
94,280 KB |
testcase_18 | AC | 1,346 ms
72,724 KB |
testcase_19 | AC | 594 ms
38,256 KB |
testcase_20 | AC | 989 ms
57,936 KB |
testcase_21 | AC | 2,281 ms
119,964 KB |
testcase_22 | AC | 2,412 ms
135,472 KB |
testcase_23 | AC | 2,446 ms
135,516 KB |
testcase_24 | AC | 329 ms
21,720 KB |
testcase_25 | AC | 917 ms
52,736 KB |
testcase_26 | AC | 874 ms
48,408 KB |
testcase_27 | AC | 1,808 ms
93,704 KB |
testcase_28 | AC | 1,335 ms
127,296 KB |
testcase_29 | AC | 1,368 ms
127,320 KB |
testcase_30 | AC | 1,335 ms
127,324 KB |
testcase_31 | AC | 1,361 ms
127,392 KB |
ソースコード
fn main() { input! { n: usize, cond: [(u32, u32); n], } let m = cond[n - 1].0; let mut hist = vec![0; m as usize + 1]; let mut cnt = 0; for (p, e) in cond { hist[p as usize] += e; cnt += 1; } let sieve = Sieve::new(m as usize); for i in 1..m { for &(n, sign) in [(m + 1 - i, !0), (i, 1)].iter() { let mut n = n as u32; while let Some(p) = sieve.factor(n as usize) { let hist = &mut hist[p]; cnt -= (*hist != 0) as u32; let p = p as u32; while n % p == 0 { n /= p; *hist += sign; } cnt += (*hist != 0) as u32; } } if cnt == 0 { println!("{} {}", m, i); return; } } println!("-1 -1"); } // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 #[macro_export] macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } #[macro_export] macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } #[macro_export] macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::<Vec<char>>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::<Vec<u8>>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- // --------- end sieve ---------- pub struct Sieve { size: usize, factor: Vec<usize>, } impl Sieve { pub fn new(size: usize) -> Sieve { let mut factor = (0..(size + 1)).collect::<Vec<_>>(); for i in (2..).take_while(|p| p * p <= size) { if i == factor[i] { for j in i..(size / i + 1) { factor[j * i] = i; } } } Sieve { size: size, factor: factor, } } pub fn factor(&self, n: usize) -> Option<usize> { assert!(n <= self.size); if n == 1 { None } else { Some(self.factor[n]) } } pub fn factorize(&self, mut n: usize, res: &mut Vec<usize>) { assert!(n <= self.size); res.clear(); res.push(1); while let Some(p) = self.factor(n) { let len = res.len(); while n % p == 0 { n /= p; for _ in 0..len { let v = res[res.len() - len] * p; res.push(v); } } } } } // --------- end sieve ----------