結果
問題 | No.1595 The Final Digit |
ユーザー |
![]() |
提出日時 | 2021-07-09 21:30:15 |
言語 | Rust (1.59.0) |
結果 |
AC
|
実行時間 | 1 ms / 2,000 ms |
コード長 | 2,470 bytes |
コンパイル時間 | 1,564 ms |
使用メモリ | 2,052 KB |
最終ジャッジ日時 | 2023-02-01 22:14:33 |
合計ジャッジ時間 | 2,688 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
1,820 KB |
testcase_01 | AC | 1 ms
1,996 KB |
testcase_02 | AC | 1 ms
2,008 KB |
testcase_03 | AC | 1 ms
1,988 KB |
testcase_04 | AC | 1 ms
1,956 KB |
testcase_05 | AC | 1 ms
2,028 KB |
testcase_06 | AC | 1 ms
1,964 KB |
testcase_07 | AC | 1 ms
2,004 KB |
testcase_08 | AC | 1 ms
1,900 KB |
testcase_09 | AC | 1 ms
2,004 KB |
testcase_10 | AC | 1 ms
1,928 KB |
testcase_11 | AC | 1 ms
2,016 KB |
testcase_12 | AC | 1 ms
1,892 KB |
testcase_13 | AC | 1 ms
1,928 KB |
testcase_14 | AC | 1 ms
2,052 KB |
testcase_15 | AC | 1 ms
1,968 KB |
testcase_16 | AC | 1 ms
1,920 KB |
testcase_17 | AC | 1 ms
1,956 KB |
testcase_18 | AC | 1 ms
1,876 KB |
testcase_19 | AC | 1 ms
1,964 KB |
コンパイルメッセージ
warning: unused import: `std::io::Write` --> Main.rs:51:5 | 51 | use std::io::Write; | ^^^^^^^^^^^^^^ | = note: `#[warn(unused_imports)]` on by default warning: type alias is never used: `Map` --> Main.rs:54:1 | 54 | type Map<K, V> = BTreeMap<K, V>; | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ | = note: `#[warn(dead_code)]` on by default warning: type alias is never used: `Set` --> Main.rs:55:1 | 55 | type Set<T> = BTreeSet<T>; | ^^^^^^^^^^^^^^^^^^^^^^^^^^ warning: type alias is never used: `Deque` --> Main.rs:56:1 | 56 | type Deque<T> = VecDeque<T>; | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ warning: 4 warnings emitted
ソースコード
// ---------- begin input macro ---------- // reference: 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") }; } // ---------- end input macro ---------- use std::io::Write; use std::collections::*; type Map<K, V> = BTreeMap<K, V>; type Set<T> = BTreeSet<T>; type Deque<T> = VecDeque<T>; fn run() { input! { p: u32, q: u32, r: u32, k: usize, } let m = 10; let p = p % 10; let q = q % 10; let r = r % 10; type Mat = [[u32; 3]; 3]; let mul = |a: &Mat, b: &Mat| -> Mat { let mut c = Mat::default(); for (c, a) in c.iter_mut().zip(a) { for (a, b) in a.iter().zip(b) { for (c, b) in c.iter_mut().zip(b) { *c = (*c + *a * *b) % m; } } } c }; let mut t = Mat::default(); for i in 0..3 { t[i][i] = 1; } let mut s = [[1, 1, 1], [1, 0, 0], [0, 1, 0]]; let mut k = k - 3; while k > 0 { if k & 1 == 1 { t = mul(&t, &s); } s = mul(&s, &s); k >>= 1; } let ans = r * t[0][0] + q * t[0][1] + p * t[0][2]; println!("{}", ans % m); } fn main() { run(); }