結果
問題 | No.1084 積の積 |
ユーザー | akakimidori |
提出日時 | 2020-06-19 21:46:19 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 38 ms / 2,000 ms |
コード長 | 6,320 bytes |
コンパイル時間 | 837 ms |
コンパイル使用メモリ | 155,576 KB |
実行使用メモリ | 6,668 KB |
最終ジャッジ日時 | 2023-09-16 13:48:55 |
合計ジャッジ時間 | 2,397 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 37 ms
6,668 KB |
testcase_05 | AC | 3 ms
4,380 KB |
testcase_06 | AC | 38 ms
6,632 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 6 ms
4,376 KB |
testcase_10 | AC | 1 ms
4,376 KB |
testcase_11 | AC | 1 ms
4,376 KB |
testcase_12 | AC | 5 ms
4,376 KB |
testcase_13 | AC | 9 ms
5,104 KB |
testcase_14 | AC | 4 ms
4,376 KB |
testcase_15 | AC | 4 ms
4,376 KB |
testcase_16 | AC | 10 ms
5,432 KB |
testcase_17 | AC | 4 ms
4,380 KB |
testcase_18 | AC | 7 ms
4,600 KB |
testcase_19 | AC | 9 ms
5,156 KB |
testcase_20 | AC | 3 ms
4,376 KB |
testcase_21 | AC | 4 ms
4,380 KB |
testcase_22 | AC | 3 ms
4,376 KB |
testcase_23 | AC | 6 ms
4,376 KB |
testcase_24 | AC | 5 ms
4,376 KB |
testcase_25 | AC | 9 ms
5,048 KB |
testcase_26 | AC | 9 ms
4,928 KB |
testcase_27 | AC | 9 ms
4,924 KB |
testcase_28 | AC | 9 ms
4,932 KB |
testcase_29 | AC | 9 ms
4,936 KB |
testcase_30 | AC | 9 ms
4,936 KB |
testcase_31 | AC | 9 ms
4,920 KB |
ソースコード
// ---------- begin ModInt ---------- const MOD: u32 = 1_000_000_007; #[derive(Clone, Copy)] struct ModInt(u32); impl std::ops::Add for ModInt { type Output = ModInt; fn add(self, rhs: ModInt) -> Self::Output { let mut d = self.0 + rhs.0; if d >= MOD { d -= MOD; } ModInt(d) } } impl std::ops::AddAssign for ModInt { fn add_assign(&mut self, rhs: ModInt) { *self = *self + rhs; } } impl std::ops::Sub for ModInt { type Output = ModInt; fn sub(self, rhs: ModInt) -> Self::Output { let mut d = self.0 + MOD - rhs.0; if d >= MOD { d -= MOD; } ModInt(d) } } impl std::ops::SubAssign for ModInt { fn sub_assign(&mut self, rhs: ModInt) { *self = *self - rhs; } } impl std::ops::Mul for ModInt { type Output = ModInt; fn mul(self, rhs: ModInt) -> Self::Output { ModInt((self.0 as u64 * rhs.0 as u64 % MOD as u64) as u32) } } impl std::ops::MulAssign for ModInt { fn mul_assign(&mut self, rhs: ModInt) { *self = *self * rhs; } } impl std::ops::Neg for ModInt { type Output = ModInt; fn neg(self) -> Self::Output { ModInt(if self.0 == 0 {0} else {MOD - self.0}) } } impl std::fmt::Display for ModInt { fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result { write!(f, "{}", self.0) } } impl std::str::FromStr for ModInt { type Err = std::num::ParseIntError; fn from_str(s: &str) -> Result<Self, Self::Err> { let val = s.parse::<u32>()?; Ok(ModInt::new(val)) } } impl From<usize> for ModInt { fn from(val: usize) -> ModInt { ModInt((val % MOD as usize) as u32) } } impl From<i64> for ModInt { fn from(val: i64) -> ModInt { let m = MOD as i64; ModInt::new((val % m + m) as u32) } } #[allow(dead_code)] impl ModInt { pub fn new(n: u32) -> ModInt { ModInt(n % MOD) } pub fn zero() -> ModInt { ModInt(0) } pub fn one() -> ModInt { ModInt(1) } pub fn pow(self, mut n: u32) -> ModInt { let mut t = ModInt::one(); let mut s = self; while n > 0 { if n & 1 == 1 { t *= s; } s *= s; n >>= 1; } t } pub fn inv(self) -> ModInt { assert!(self.0 > 0); self.pow(MOD - 2) } } // ---------- end ModInt ---------- // ---------- begin Precalc ---------- #[allow(dead_code)] struct Precalc { inv: Vec<ModInt>, fact: Vec<ModInt>, ifact: Vec<ModInt>, } #[allow(dead_code)] impl Precalc { pub fn new(n: usize) -> Precalc { let mut inv = vec![ModInt::one(); n + 1]; let mut fact = vec![ModInt::one(); n + 1]; let mut ifact = vec![ModInt::one(); n + 1]; for i in 2..(n + 1) { fact[i] = fact[i - 1] * ModInt(i as u32); } ifact[n] = fact[n].inv(); if n > 0 { inv[n] = ifact[n] * fact[n - 1]; } for i in (1..n).rev() { ifact[i] = ifact[i + 1] * ModInt((i + 1) as u32); inv[i] = ifact[i] * fact[i - 1]; } Precalc { inv: inv, fact: fact, ifact: ifact, } } pub fn inv(&self, n: usize) -> ModInt { assert!(n > 0); self.inv[n] } pub fn fact(&self, n: usize) -> ModInt { self.fact[n] } pub fn ifact(&self, n: usize) -> ModInt { self.ifact[n] } pub fn comb(&self, n: usize, k: usize) -> ModInt { if k > n { return ModInt::zero(); } self.fact[n] * self.ifact[k] * self.ifact[n - k] } } // ---------- end Precalc ---------- //https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 より 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_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_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") }; } // fn run() { input! { n: usize, a: [u64; n], } if a.iter().any(|a| *a == 0) { println!("0"); return; } let sup = 10u64.pow(9); let mut r = 0; let mut val = 1u64; let mut b = vec![]; for l in 0..n { while r < n && val * a[r] < sup { val *= a[r]; r += 1; } b.push((l, r)); val /= a[l]; } b.sort_by_key(|a| a.1); let mut h = std::collections::BinaryHeap::new(); let mut cnt = 0; let mut sum = 0; let mut ans = ModInt::one(); for i in (0..n).rev() { while let Some(&(l, r)) = b.last() { if r > i { h.push((l, r)); cnt += 1; sum += 1; b.pop(); } else { break; } } ans *= ModInt(a[i] as u32).pow((sum % (MOD - 1) as usize) as u32); while let Some(&(l, r)) = h.peek() { if l == i { sum -= r - l; cnt -= 1; h.pop(); } else { break; } } sum += cnt; } println!("{}", ans); } fn main() { run(); }