結果

問題 No.2207 pCr検査
ユーザー akakimidori
提出日時 2023-02-03 22:06:41
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 2,593 ms / 3,000 ms
コード長 3,531 bytes
コンパイル時間 13,214 ms
コンパイル使用メモリ 378,708 KB
実行使用メモリ 129,300 KB
最終ジャッジ日時 2024-07-02 20:05:41
合計ジャッジ時間 50,256 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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 ----------
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0