結果
問題 | No.978 Fibonacci Convolution Easy |
ユーザー | hatoo |
提出日時 | 2020-04-01 16:02:48 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 30 ms / 2,000 ms |
コード長 | 3,251 bytes |
コンパイル時間 | 13,770 ms |
コンパイル使用メモリ | 379,300 KB |
実行使用メモリ | 17,576 KB |
最終ジャッジ日時 | 2024-06-26 22:44:58 |
合計ジャッジ時間 | 15,028 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 13 ms
8,064 KB |
testcase_02 | AC | 7 ms
5,248 KB |
testcase_03 | AC | 28 ms
16,888 KB |
testcase_04 | AC | 9 ms
5,888 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 12 ms
7,168 KB |
testcase_07 | AC | 21 ms
11,648 KB |
testcase_08 | AC | 14 ms
8,576 KB |
testcase_09 | AC | 22 ms
13,184 KB |
testcase_10 | AC | 29 ms
17,536 KB |
testcase_11 | AC | 10 ms
6,400 KB |
testcase_12 | AC | 3 ms
5,376 KB |
testcase_13 | AC | 11 ms
7,168 KB |
testcase_14 | AC | 4 ms
5,376 KB |
testcase_15 | AC | 13 ms
7,936 KB |
testcase_16 | AC | 30 ms
17,576 KB |
testcase_17 | AC | 29 ms
17,488 KB |
testcase_18 | AC | 1 ms
5,376 KB |
testcase_19 | AC | 1 ms
5,376 KB |
testcase_20 | AC | 1 ms
5,376 KB |
ソースコード
#[doc = " https://github.com/hatoo/competitive-rust-snippets"] #[allow(unused_imports)] use std::cmp::{max, min, Ordering}; #[allow(unused_imports)] use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque}; #[allow(unused_imports)] use std::io::{stdin, stdout, BufWriter, Write}; #[allow(unused_imports)] use std::iter::FromIterator; mod util { use std::fmt::Debug; use std::io::{stdin, stdout, BufWriter, StdoutLock}; use std::str::FromStr; #[allow(dead_code)] pub fn line() -> String { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.trim().to_string() } #[allow(dead_code)] pub fn chars() -> Vec<char> { line().chars().collect() } #[allow(dead_code)] pub fn gets<T: FromStr>() -> Vec<T> where <T as FromStr>::Err: Debug, { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.split_whitespace() .map(|t| t.parse().unwrap()) .collect() } #[allow(dead_code)] pub fn with_bufwriter<F: FnOnce(BufWriter<StdoutLock>) -> ()>(f: F) { let out = stdout(); let writer = BufWriter::new(out.lock()); f(writer) } } #[allow(unused_macros)] macro_rules ! get { ( [ $ t : ty ] ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . split_whitespace ( ) . map ( | t | t . parse ::<$ t > ( ) . unwrap ( ) ) . collect ::< Vec < _ >> ( ) } } ; ( [ $ t : ty ] ; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( [ $ t ] ) ) . collect ::< Vec < _ >> ( ) } ; ( $ t : ty ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . trim ( ) . parse ::<$ t > ( ) . unwrap ( ) } } ; ( $ ( $ t : ty ) ,* ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; let mut iter = line . split_whitespace ( ) ; ( $ ( iter . next ( ) . unwrap ( ) . parse ::<$ t > ( ) . unwrap ( ) , ) * ) } } ; ( $ t : ty ; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ ( $ t : ty ) ,*; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ ( $ t ) ,* ) ) . collect ::< Vec < _ >> ( ) } ; } #[allow(unused_macros)] macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } } const BIG_STACK_SIZE: bool = true; #[allow(dead_code)] fn main() { use std::thread; if BIG_STACK_SIZE { thread::Builder::new() .stack_size(32 * 1024 * 1024) .name("solve".into()) .spawn(solve) .unwrap() .join() .unwrap(); } else { solve(); } } #[allow(dead_code)] pub const M: u64 = 1_000_000_007; fn solve() { let (n, p) = get!(usize, u64); let mut fib = vec![0, 1]; while fib.len() < n { fib.push((p * fib[fib.len() - 1] + fib[fib.len() - 2]) % M); } let mut t = 0; let mut ans = 0; for a in &fib[..n] { t += a; t %= M; ans += a * t % M; ans %= M; } println!("{}", ans); }