結果
問題 | No.1331 Moving Penguin |
ユーザー | fukafukatani |
提出日時 | 2021-01-09 09:38:34 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 193 ms / 1,500 ms |
コード長 | 6,564 bytes |
コンパイル時間 | 15,737 ms |
コンパイル使用メモリ | 378,788 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-07 15:00:58 |
合計ジャッジ時間 | 23,574 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | AC | 1 ms
5,248 KB |
testcase_04 | AC | 153 ms
5,248 KB |
testcase_05 | AC | 152 ms
5,248 KB |
testcase_06 | AC | 153 ms
5,248 KB |
testcase_07 | AC | 151 ms
5,248 KB |
testcase_08 | AC | 152 ms
5,248 KB |
testcase_09 | AC | 152 ms
5,248 KB |
testcase_10 | AC | 151 ms
5,248 KB |
testcase_11 | AC | 152 ms
5,248 KB |
testcase_12 | AC | 152 ms
5,248 KB |
testcase_13 | AC | 150 ms
5,248 KB |
testcase_14 | AC | 151 ms
5,248 KB |
testcase_15 | AC | 151 ms
5,248 KB |
testcase_16 | AC | 152 ms
5,248 KB |
testcase_17 | AC | 151 ms
5,248 KB |
testcase_18 | AC | 152 ms
5,248 KB |
testcase_19 | AC | 153 ms
5,248 KB |
testcase_20 | AC | 151 ms
5,248 KB |
testcase_21 | AC | 153 ms
5,248 KB |
testcase_22 | AC | 151 ms
5,248 KB |
testcase_23 | AC | 152 ms
5,248 KB |
testcase_24 | AC | 152 ms
5,248 KB |
testcase_25 | AC | 154 ms
5,248 KB |
testcase_26 | AC | 155 ms
5,248 KB |
testcase_27 | AC | 169 ms
5,248 KB |
testcase_28 | AC | 155 ms
5,248 KB |
testcase_29 | AC | 155 ms
5,248 KB |
testcase_30 | AC | 32 ms
5,248 KB |
testcase_31 | AC | 67 ms
5,248 KB |
testcase_32 | AC | 27 ms
5,248 KB |
testcase_33 | AC | 48 ms
5,248 KB |
testcase_34 | AC | 87 ms
5,248 KB |
testcase_35 | AC | 181 ms
5,248 KB |
testcase_36 | AC | 174 ms
5,248 KB |
testcase_37 | AC | 174 ms
5,248 KB |
testcase_38 | AC | 34 ms
5,248 KB |
testcase_39 | AC | 148 ms
5,248 KB |
testcase_40 | AC | 57 ms
5,248 KB |
testcase_41 | AC | 154 ms
5,248 KB |
testcase_42 | AC | 175 ms
5,248 KB |
testcase_43 | AC | 179 ms
5,248 KB |
testcase_44 | AC | 175 ms
5,248 KB |
testcase_45 | AC | 193 ms
5,248 KB |
testcase_46 | AC | 193 ms
5,248 KB |
testcase_47 | AC | 190 ms
5,248 KB |
testcase_48 | AC | 150 ms
5,248 KB |
コンパイルメッセージ
warning: associated items `set_modulus`, `pow`, and `inv` are never used --> src/main.rs:78:8 | 77 | impl Modulo { | ----------- associated items in this implementation 78 | fn set_modulus(m: i64) { | ^^^^^^^^^^^ ... 96 | fn pow(self, p: i64) -> Modulo { | ^^^ ... 108 | fn inv(self) -> Modulo { | ^^^ | = note: `#[warn(dead_code)]` on by default warning: function `mod_comb` is never used --> src/main.rs:236:4 | 236 | fn mod_comb(n: usize, k: usize, fact: &[Modulo], fact_inv: &[Modulo]) -> Modulo { | ^^^^^^^^
ソースコード
#![allow(unused_imports)] use std::cmp::*; use std::collections::*; use std::io::Write; use std::ops::Bound::*; #[allow(unused_macros)] macro_rules! debug { ($($e:expr),*) => { #[cfg(debug_assertions)] $({ let (e, mut err) = (stringify!($e), std::io::stderr()); writeln!(err, "{} = {:?}", e, $e).unwrap() })* }; } fn main() { let n = read::<usize>(); let a = read_vec::<usize>(); let mut root_n = 0; for i in 1.. { if i * i > n { root_n = i; break; } } let mut dp = vec![Modulo(0); n + 1]; let mut sum = vec![vec![Modulo(0); root_n]; root_n]; dp[0] += 1; for i in 0..n { for j in 1..root_n { dp[i] += sum[j][(i + 1) % j]; } if i > 0 && a[i - 1] > 1 { let val = dp[i - 1]; dp[i] += val; } if a[i] >= root_n { let mut cur = i + a[i]; let val = dp[i]; while cur < n { if cur == i + 1 { continue; } dp[cur] += val; cur += a[i]; } } else { sum[a[i]][(i + 1) % a[i]] += dp[i]; } } println!("{}", dp[n - 1]); } fn read<T: std::str::FromStr>() -> T { let mut s = String::new(); std::io::stdin().read_line(&mut s).ok(); s.trim().parse().ok().unwrap() } fn read_vec<T: std::str::FromStr>() -> Vec<T> { read::<String>() .split_whitespace() .map(|e| e.parse().ok().unwrap()) .collect() } #[derive(Clone, Copy, Debug, Default, Eq, Hash, Ord, PartialEq, PartialOrd)] struct Modulo(i64); static mut MODULUS: i64 = 1000_000_000 + 7; impl Modulo { fn set_modulus(m: i64) { unsafe { MODULUS = m; } } fn get_modulus() -> i64 { unsafe { MODULUS } } fn new(x: i64) -> Modulo { let m = Modulo::get_modulus(); if x < 0 { Modulo(x % m + m) } else if x < m { Modulo(x) } else { Modulo(x % m) } } fn pow(self, p: i64) -> Modulo { if p == 0 { Modulo(1) } else { let mut t = self.pow(p / 2); t *= t; if p & 1 == 1 { t *= self; } t } } fn inv(self) -> Modulo { self.pow(Modulo::get_modulus() - 2) } } impl std::fmt::Display for Modulo { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { self.0.fmt(f) } } impl std::ops::AddAssign for Modulo { fn add_assign(&mut self, other: Modulo) { let m = Modulo::get_modulus(); self.0 += other.0; if self.0 >= m { self.0 -= m; } } } impl std::ops::MulAssign for Modulo { fn mul_assign(&mut self, other: Modulo) { let m = Modulo::get_modulus(); self.0 *= other.0; self.0 %= m; } } impl std::ops::SubAssign for Modulo { fn sub_assign(&mut self, other: Modulo) { let m = Modulo::get_modulus(); self.0 += m - other.0; if self.0 >= m { self.0 -= m; } } } macro_rules! impl_modulo_ops { ($imp:ident, $method:ident, $assign_imp:ident, $assign_method:ident) => { impl<'a> std::ops::$assign_imp<&'a Modulo> for Modulo { fn $assign_method(&mut self, other: &'a Modulo) { std::ops::$assign_imp::$assign_method(self, *other); } } impl std::ops::$imp for Modulo { type Output = Modulo; fn $method(self, other: Modulo) -> Modulo { let mut x = self; std::ops::$assign_imp::$assign_method(&mut x, other); x } } impl<'a> std::ops::$imp<Modulo> for &'a Modulo { type Output = Modulo; fn $method(self, other: Modulo) -> Modulo { std::ops::$imp::$method(*self, other) } } impl<'a> std::ops::$imp<&'a Modulo> for Modulo { type Output = Modulo; fn $method(self, other: &'a Modulo) -> Modulo { std::ops::$imp::$method(self, *other) } } impl<'a, 'b> std::ops::$imp<&'b Modulo> for &'a Modulo { type Output = Modulo; fn $method(self, other: &'b Modulo) -> Modulo { std::ops::$imp::$method(*self, *other) } } impl std::ops::$assign_imp<i64> for Modulo { fn $assign_method(&mut self, other: i64) { std::ops::$assign_imp::$assign_method(self, Modulo::new(other)); } } impl<'a> std::ops::$assign_imp<&'a i64> for Modulo { fn $assign_method(&mut self, other: &'a i64) { std::ops::$assign_imp::$assign_method(self, *other); } } impl std::ops::$imp<i64> for Modulo { type Output = Modulo; fn $method(self, other: i64) -> Modulo { let mut x = self; std::ops::$assign_imp::$assign_method(&mut x, other); x } } impl<'a> std::ops::$imp<&'a i64> for Modulo { type Output = Modulo; fn $method(self, other: &'a i64) -> Modulo { std::ops::$imp::$method(self, *other) } } impl<'a> std::ops::$imp<i64> for &'a Modulo { type Output = Modulo; fn $method(self, other: i64) -> Modulo { std::ops::$imp::$method(*self, other) } } impl<'a, 'b> std::ops::$imp<&'b i64> for &'a Modulo { type Output = Modulo; fn $method(self, other: &'b i64) -> Modulo { std::ops::$imp::$method(*self, *other) } } }; } impl_modulo_ops!(Add, add, AddAssign, add_assign); impl_modulo_ops!(Mul, mul, MulAssign, mul_assign); impl_modulo_ops!(Sub, sub, SubAssign, sub_assign); use std::iter::Sum; impl Sum for Modulo { fn sum<I>(iter: I) -> Self where I: Iterator<Item = Modulo>, { iter.fold(Modulo(0), |a, b| a + b) } } impl<'a> Sum<&'a Modulo> for Modulo { fn sum<I>(iter: I) -> Self where I: Iterator<Item = &'a Self>, { iter.fold(Modulo(0), |a, b| a + b) } } fn mod_comb(n: usize, k: usize, fact: &[Modulo], fact_inv: &[Modulo]) -> Modulo { assert!(n >= k); fact[n] * fact_inv[n - k] * fact_inv[k] }