#619034 (Rust) No.1331 Moving Penguin

提出ソース

結果

問題	No.1331 Moving Penguin
ユーザー	nebocco
提出日時	2021-02-17 20:10:44
言語	Rust (1.77.0 + proconio)
結果	RE
実行時間	-
コード長	5,120 bytes
コンパイル時間	13,180 ms
コンパイル使用メモリ	376,856 KB
実行使用メモリ	5,760 KB
最終ジャッジ日時	2024-09-14 05:42:27
合計ジャッジ時間	22,787 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	RE	-
testcase_01	AC	3 ms 5,248 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	RE	-
testcase_05	AC	206 ms 5,632 KB
testcase_06	AC	206 ms 5,632 KB
testcase_07	AC	204 ms 5,632 KB
testcase_08	AC	204 ms 5,632 KB
testcase_09	AC	205 ms 5,632 KB
testcase_10	AC	207 ms 5,760 KB
testcase_11	AC	203 ms 5,632 KB
testcase_12	AC	206 ms 5,504 KB
testcase_13	AC	204 ms 5,632 KB
testcase_14	AC	204 ms 5,632 KB
testcase_15	AC	206 ms 5,632 KB
testcase_16	AC	205 ms 5,632 KB
testcase_17	AC	204 ms 5,632 KB
testcase_18	AC	204 ms 5,632 KB
testcase_19	AC	206 ms 5,632 KB
testcase_20	AC	203 ms 5,760 KB
testcase_21	AC	204 ms 5,504 KB
testcase_22	AC	207 ms 5,504 KB
testcase_23	AC	205 ms 5,632 KB
testcase_24	AC	204 ms 5,504 KB
testcase_25	AC	202 ms 5,632 KB
testcase_26	RE	-
testcase_27	RE	-
testcase_28	RE	-
testcase_29	RE	-
testcase_30	RE	-
testcase_31	RE	-
testcase_32	RE	-
testcase_33	RE	-
testcase_34	RE	-
testcase_35	AC	205 ms 5,760 KB
testcase_36	AC	206 ms 5,760 KB
testcase_37	AC	206 ms 5,760 KB
testcase_38	RE	-
testcase_39	RE	-
testcase_40	RE	-
testcase_41	AC	205 ms 5,760 KB
testcase_42	AC	206 ms 5,760 KB
testcase_43	AC	207 ms 5,632 KB
testcase_44	AC	208 ms 5,760 KB
testcase_45	AC	209 ms 5,632 KB
testcase_46	AC	205 ms 5,760 KB
testcase_47	AC	205 ms 5,760 KB
testcase_48	AC	205 ms 5,632 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

fn main() {
	let mut io = IO::new();
    input!{ from io,
		n: usize,
		a: [usize; n]
    }
	const MOD: i64 = 1_000_000_007;
	const M: usize = 500;
	let mut dp = vec![0; n+1];
	dp[0] = 1;
	let mut table = vec![vec![0; M]; M];
	for i in 0..n {
		for j in 1..M {
			dp[i] += table[j][i%j];
		}
		if i > 0 && a[i-1] > 1 {
			dp[i] += dp[i-1];
		}
		dp[i] %= MOD;
		if a[i] < M {
			table[a[i]][i % a[i]] = (table[a[i]][i % a[i]] + dp[i]) % MOD;
		} else {
			let v = i % a[i];
			for j in (i+v..n).step_by(v) {
				dp[j] += dp[i];
			}
		}
 	}
    io.println(dp[n-1]);
}

// ------------ io module start ------------
use std::io::{stdout, BufWriter, Read, StdoutLock, Write};

pub struct IO {
	iter: std::str::SplitAsciiWhitespace<'static>,
	buf: BufWriter<StdoutLock<'static>>,
}

impl IO {
	pub fn new() -> Self {
		let mut input = String::new();
		std::io::stdin().read_to_string(&mut input).unwrap();
		let input = Box::leak(input.into_boxed_str());
		let out = Box::new(stdout());
		IO {
			iter: input.split_ascii_whitespace(),
			buf: BufWriter::new(Box::leak(out).lock()),
		}
	}
	fn scan_str(&mut self) -> &'static str {
		self.iter.next().unwrap()
	}
	pub fn scan<T: Scan>(&mut self) -> <T as Scan>::Output {
		<T as Scan>::scan(self)
	}
	pub fn scan_vec<T: Scan>(&mut self, n: usize) -> Vec<<T as Scan>::Output> {
		(0..n).map(|_| self.scan::<T>()).collect()
	}
	pub fn print<T: Print>(&mut self, x: T) {
		<T as Print>::print(self, x);
	}
	pub fn println<T: Print>(&mut self, x: T) {
		self.print(x);
		self.print("\n");
	}
	pub fn iterln<T: Print, I: Iterator<Item = T>>(&mut self, mut iter: I, delim: &str) {
		if let Some(v) = iter.next() {
			self.print(v);
			for v in iter {
				self.print(delim);
				self.print(v);
			}
		}
		self.print("\n");
	}
	pub fn flush(&mut self) {
		self.buf.flush().unwrap();
	}
}

impl Default for IO {
	fn default() -> Self {
		Self::new()
	}
}

pub trait Scan {
	type Output;
	fn scan(io: &mut IO) -> Self::Output;
}

macro_rules! impl_scan {
	($($t:tt),*) => {
		$(
			impl Scan for $t {
				type Output = Self;
				fn scan(s: &mut IO) -> Self::Output {
					s.scan_str().parse().unwrap()
				}
			}
		)*
	};
}

impl_scan!(i16, i32, i64, isize, u16, u32, u64, usize, String);

pub enum Bytes {}
impl Scan for Bytes {
	type Output = &'static [u8];
	fn scan(s: &mut IO) -> Self::Output {
		s.scan_str().as_bytes()
	}
}

pub enum Chars {}
impl Scan for Chars {
	type Output = Vec<char>;
	fn scan(s: &mut IO) -> Self::Output {
		s.scan_str().chars().collect()
	}
}

pub enum Usize1 {}
impl Scan for Usize1 {
	type Output = usize;
	fn scan(s: &mut IO) -> Self::Output {
		s.scan::<usize>().wrapping_sub(1)
	}
}

impl<T: Scan, U: Scan> Scan for (T, U) {
	type Output = (T::Output, U::Output);
	fn scan(s: &mut IO) -> Self::Output {
		(T::scan(s), U::scan(s))
	}
}

impl<T: Scan, U: Scan, V: Scan> Scan for (T, U, V) {
	type Output = (T::Output, U::Output, V::Output);
	fn scan(s: &mut IO) -> Self::Output {
		(T::scan(s), U::scan(s), V::scan(s))
	}
}

impl<T: Scan, U: Scan, V: Scan, W: Scan> Scan for (T, U, V, W) {
	type Output = (T::Output, U::Output, V::Output, W::Output);
	fn scan(s: &mut IO) -> Self::Output {
		(T::scan(s), U::scan(s), V::scan(s), W::scan(s))
	}
}

pub trait Print {
	fn print(w: &mut IO, x: Self);
}

macro_rules! impl_print_int {
	($($t:ty),*) => {
		$(
			impl Print for $t {
				fn print(w: &mut IO, x: Self) {
					w.buf.write_all(x.to_string().as_bytes()).unwrap();
				}
			}
		)*
	};
}

impl_print_int!(i16, i32, i64, isize, u16, u32, u64, usize);

impl Print for u8 {
	fn print(w: &mut IO, x: Self) {
		w.buf.write_all(&[x]).unwrap();
	}
}

impl Print for &[u8] {
	fn print(w: &mut IO, x: Self) {
		w.buf.write_all(x).unwrap();
	}
}

impl Print for &str {
	fn print(w: &mut IO, x: Self) {
		w.print(x.as_bytes());
	}
}

impl Print for String {
	fn print(w: &mut IO, x: Self) {
		w.print(x.as_bytes());
	}
}

impl<T: Print, U: Print> Print for (T, U) {
	fn print(w: &mut IO, (x, y): Self) {
		w.print(x);
		w.print(" ");
		w.print(y);
	}
}

impl<T: Print, U: Print, V: Print> Print for (T, U, V) {
	fn print(w: &mut IO, (x, y, z): Self) {
		w.print(x);
		w.print(" ");
		w.print(y);
		w.print(" ");
		w.print(z);
	}
}

mod neboccoio_macro {
	#[macro_export]
	macro_rules! input {
		(@start $io:tt @read @rest) => {};

		(@start $io:tt @read @rest, $($rest: tt)*) => {
			input!(@start $io @read @rest $($rest)*)
		};

		(@start $io:tt @read @rest mut $($rest:tt)*) => {
			input!(@start $io @read @mut [mut] @rest $($rest)*)
		};

		(@start $io:tt @read @rest $($rest:tt)*) => {
			input!(@start $io @read @mut [] @rest $($rest)*)
		};

		(@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: [$kind:tt; $len:tt] $($rest:tt)*) => {
			let $($mut)* $var = $io.scan_vec::<$kind>($len);
			input!(@start $io @read @rest $($rest)*)
		};

		(@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: $kind:tt $($rest:tt)*) => {
			let $($mut)* $var = $io.scan::<$kind>();
			input!(@start $io @read @rest $($rest)*)
		};

		(from $io:tt $($rest:tt)*) => {
			input!(@start $io @read @rest $($rest)*)
		};
	}
}

// ------------ io module end ------------

yukicoder

結果

テストケース

ソースコード