結果
問題 | No.1411 Hundreds of Conditions Sequences |
ユーザー | koba-e964 |
提出日時 | 2021-10-06 15:43:54 |
言語 | Rust (1.72.1) |
結果 |
AC
|
実行時間 | 125 ms / 2,000 ms |
コード長 | 5,336 bytes |
コンパイル時間 | 1,685 ms |
コンパイル使用メモリ | 163,052 KB |
実行使用メモリ | 26,188 KB |
最終ジャッジ日時 | 2023-09-30 08:47:45 |
合計ジャッジ時間 | 10,726 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 18 ms
9,808 KB |
testcase_01 | AC | 17 ms
9,876 KB |
testcase_02 | AC | 17 ms
9,840 KB |
testcase_03 | AC | 18 ms
9,844 KB |
testcase_04 | AC | 18 ms
9,820 KB |
testcase_05 | AC | 18 ms
9,848 KB |
testcase_06 | AC | 17 ms
9,844 KB |
testcase_07 | AC | 17 ms
9,848 KB |
testcase_08 | AC | 18 ms
9,852 KB |
testcase_09 | AC | 18 ms
9,852 KB |
testcase_10 | AC | 17 ms
9,860 KB |
testcase_11 | AC | 17 ms
9,804 KB |
testcase_12 | AC | 109 ms
24,372 KB |
testcase_13 | AC | 90 ms
23,328 KB |
testcase_14 | AC | 59 ms
20,416 KB |
testcase_15 | AC | 85 ms
23,348 KB |
testcase_16 | AC | 25 ms
13,248 KB |
testcase_17 | AC | 85 ms
23,040 KB |
testcase_18 | AC | 110 ms
24,472 KB |
testcase_19 | AC | 118 ms
24,592 KB |
testcase_20 | AC | 57 ms
20,552 KB |
testcase_21 | AC | 122 ms
24,792 KB |
testcase_22 | AC | 62 ms
21,140 KB |
testcase_23 | AC | 111 ms
24,416 KB |
testcase_24 | AC | 18 ms
9,976 KB |
testcase_25 | AC | 110 ms
24,488 KB |
testcase_26 | AC | 86 ms
23,112 KB |
testcase_27 | AC | 59 ms
20,592 KB |
testcase_28 | AC | 95 ms
23,724 KB |
testcase_29 | AC | 30 ms
15,332 KB |
testcase_30 | AC | 78 ms
22,540 KB |
testcase_31 | AC | 72 ms
21,988 KB |
testcase_32 | AC | 123 ms
24,808 KB |
testcase_33 | AC | 123 ms
25,000 KB |
testcase_34 | AC | 125 ms
24,760 KB |
testcase_35 | AC | 122 ms
24,844 KB |
testcase_36 | AC | 123 ms
24,780 KB |
testcase_37 | AC | 123 ms
24,840 KB |
testcase_38 | AC | 124 ms
25,036 KB |
testcase_39 | AC | 122 ms
24,944 KB |
testcase_40 | AC | 124 ms
24,956 KB |
testcase_41 | AC | 122 ms
24,828 KB |
testcase_42 | AC | 121 ms
24,756 KB |
testcase_43 | AC | 123 ms
24,804 KB |
testcase_44 | AC | 121 ms
24,832 KB |
testcase_45 | AC | 124 ms
25,020 KB |
testcase_46 | AC | 123 ms
24,940 KB |
testcase_47 | AC | 122 ms
25,024 KB |
testcase_48 | AC | 123 ms
24,804 KB |
testcase_49 | AC | 122 ms
24,956 KB |
testcase_50 | AC | 125 ms
24,836 KB |
testcase_51 | AC | 124 ms
25,024 KB |
testcase_52 | AC | 101 ms
16,620 KB |
testcase_53 | AC | 103 ms
16,580 KB |
testcase_54 | AC | 102 ms
16,568 KB |
testcase_55 | AC | 101 ms
16,656 KB |
testcase_56 | AC | 100 ms
16,544 KB |
testcase_57 | AC | 101 ms
16,568 KB |
testcase_58 | AC | 102 ms
16,500 KB |
testcase_59 | AC | 101 ms
16,488 KB |
testcase_60 | AC | 101 ms
16,596 KB |
testcase_61 | AC | 102 ms
16,552 KB |
testcase_62 | AC | 72 ms
10,600 KB |
testcase_63 | AC | 102 ms
26,188 KB |
ソースコード
use std::cmp::*; 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 ; $len:expr ]) => { (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>() }; ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error")); } /// Verified by https://atcoder.jp/contests/abc198/submissions/21774342 mod mod_int { use std::ops::*; pub trait Mod: Copy { fn m() -> i64; } #[derive(Copy, Clone, Hash, PartialEq, Eq, PartialOrd, Ord)] pub struct ModInt<M> { pub x: i64, phantom: ::std::marker::PhantomData<M> } impl<M: Mod> ModInt<M> { // x >= 0 pub fn new(x: i64) -> Self { ModInt::new_internal(x % M::m()) } fn new_internal(x: i64) -> Self { ModInt { x: x, phantom: ::std::marker::PhantomData } } pub fn pow(self, mut e: i64) -> Self { debug_assert!(e >= 0); let mut sum = ModInt::new_internal(1); let mut cur = self; while e > 0 { if e % 2 != 0 { sum *= cur; } cur *= cur; e /= 2; } sum } #[allow(dead_code)] pub fn inv(self) -> Self { self.pow(M::m() - 2) } } impl<M: Mod, T: Into<ModInt<M>>> Add<T> for ModInt<M> { type Output = Self; fn add(self, other: T) -> Self { let other = other.into(); let mut sum = self.x + other.x; if sum >= M::m() { sum -= M::m(); } ModInt::new_internal(sum) } } impl<M: Mod, T: Into<ModInt<M>>> Sub<T> for ModInt<M> { type Output = Self; fn sub(self, other: T) -> Self { let other = other.into(); let mut sum = self.x - other.x; if sum < 0 { sum += M::m(); } ModInt::new_internal(sum) } } impl<M: Mod, T: Into<ModInt<M>>> Mul<T> for ModInt<M> { type Output = Self; fn mul(self, other: T) -> Self { ModInt::new(self.x * other.into().x % M::m()) } } impl<M: Mod, T: Into<ModInt<M>>> AddAssign<T> for ModInt<M> { fn add_assign(&mut self, other: T) { *self = *self + other; } } impl<M: Mod, T: Into<ModInt<M>>> SubAssign<T> for ModInt<M> { fn sub_assign(&mut self, other: T) { *self = *self - other; } } impl<M: Mod, T: Into<ModInt<M>>> MulAssign<T> for ModInt<M> { fn mul_assign(&mut self, other: T) { *self = *self * other; } } impl<M: Mod> Neg for ModInt<M> { type Output = Self; fn neg(self) -> Self { ModInt::new(0) - self } } impl<M> ::std::fmt::Display for ModInt<M> { fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result { self.x.fmt(f) } } impl<M: Mod> From<i64> for ModInt<M> { fn from(x: i64) -> Self { Self::new(x) } } } // mod mod_int macro_rules! define_mod { ($struct_name: ident, $modulo: expr) => { #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)] struct $struct_name {} impl mod_int::Mod for $struct_name { fn m() -> i64 { $modulo } } } } const MOD: i64 = 1_000_000_007; define_mod!(P, MOD); type MInt = mod_int::ModInt<P>; fn main() { let out = std::io::stdout(); let mut out = BufWriter::new(out.lock()); macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););} input! { n: usize, a: [usize; n], } const W: usize = 1_000_010; let mut fac = vec![0; W]; let mut top = vec![[0; 2]; W]; for i in 2..W { if fac[i] != 0 { continue; } for j in 1..(W - 1) / i + 1 { fac[i * j] = i; } } let mut prod = MInt::new(1); for &a in &a { prod *= a as i64; let mut v = a; while v > 1 { let p = fac[v]; let mut e = 0; while v % p == 0 { v /= p; e += 1; } top[p][0] = max(top[p][0], e); top[p].sort(); } } let mut ex = MInt::new(1); for i in 2..W { if fac[i] == i { ex *= MInt::new(i as i64).pow(top[i][1]); } } for &a in &a { let mut all = ex; let mut v = a; while v > 1 { let p = fac[v]; let mut e = 0; while v % p == 0 { v /= p; e += 1; } if top[p][1] == e { all *= MInt::new(p as i64).pow(MOD - 1 - top[p][1] + top[p][0]); } } puts!("{}\n", prod * MInt::new(a as i64).inv() - all); } }