結果
問題 | No.3071 Double Speedrun |
ユーザー |
![]() |
提出日時 | 2025-03-21 22:45:19 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 2,006 ms / 6,000 ms |
コード長 | 5,086 bytes |
コンパイル時間 | 13,754 ms |
コンパイル使用メモリ | 378,740 KB |
実行使用メモリ | 5,888 KB |
最終ジャッジ日時 | 2025-03-21 22:45:48 |
合計ジャッジ時間 | 28,408 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 14 |
コンパイルメッセージ
warning: variable does not need to be mutable --> src/main.rs:107:9 | 107 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` | = note: `#[warn(unused_mut)]` on by default warning: variable does not need to be mutable --> src/main.rs:113:9 | 113 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:118:9 | 118 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:124:9 | 124 | let mut vec: Vec<f64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:129:9 | 129 | let mut vec: Vec<char> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:134:9 | 134 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:139:9 | 139 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:145:9 | 145 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut`
ソースコード
#![allow(dead_code)] #![allow(unused_imports)] #![allow(unused_macros)] use std::cmp::*; use std::fmt::*; use std::hash::*; use std::io::BufRead; use std::iter::FromIterator; use std::*; use std::{cmp, collections, fmt, io, iter, ops, str}; const INF: i64 = 1223372036854775807; const UINF: usize = INF as usize; const LINF: i64 = 2147483647; const INF128: i128 = 1223372036854775807000000000000; const MOD1: i64 = 1000000007; const MOD9: i64 = 998244353; const MOD: i64 = MOD9; const UMOD: usize = MOD as usize; const M_PI: f64 = 3.14159265358979323846; use cmp::Ordering::*; use std::collections::*; use std::io::stdin; use std::io::stdout; use std::io::Write; macro_rules! p { ($x:expr) => { println!("{}", $x); }; } macro_rules! vp { ($x:expr) => { println!( "{}", $x.iter() .map(|x| x.to_string()) .collect::<Vec<_>>() .join(" ") ); }; } macro_rules! d { ($x:expr) => { eprintln!("{:?}", $x); }; } macro_rules! yn { ($val:expr) => { if $val { println!("Yes"); } else { println!("No"); } }; } macro_rules! map{ ($($key:expr => $val:expr),*) => { { let mut map = ::std::collections::BTreeMap::new(); $( map.insert($key, $val); )* map } }; } macro_rules! set{ ($($key:expr),*) => { { let mut set = ::std::collections::BTreeSet::new(); $( set.insert($key); )* set } }; } #[allow(dead_code)] 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() } #[allow(dead_code)] fn read_vec<T: std::str::FromStr>() -> Vec<T> { read::<String>() .split_whitespace() .map(|e| e.parse().ok().unwrap()) .collect() } #[allow(dead_code)] fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> { (0..n).map(|_| read_vec()).collect() } #[allow(dead_code)] fn readii() -> (i64, i64) { let mut vec: Vec<i64> = read_vec(); (vec[0], vec[1]) } #[allow(dead_code)] fn readiii() -> (i64, i64, i64) { let mut vec: Vec<i64> = read_vec(); (vec[0], vec[1], vec[2]) } #[allow(dead_code)] fn readuu() -> (usize, usize) { let mut vec: Vec<usize> = read_vec(); (vec[0], vec[1]) } #[allow(dead_code)] fn readff() -> (f64, f64) { let mut vec: Vec<f64> = read_vec(); (vec[0], vec[1]) } fn readcc() -> (char, char) { let mut vec: Vec<char> = read_vec(); (vec[0], vec[1]) } fn readuuu() -> (usize, usize, usize) { let mut vec: Vec<usize> = read_vec(); (vec[0], vec[1], vec[2]) } #[allow(dead_code)] fn readiiii() -> (i64, i64, i64, i64) { let mut vec: Vec<i64> = read_vec(); (vec[0], vec[1], vec[2], vec[3]) } #[allow(dead_code)] fn readuuuu() -> (usize, usize, usize, usize) { let mut vec: Vec<usize> = read_vec(); (vec[0], vec[1], vec[2], vec[3]) } fn main() { let (h, w) = readuu(); let mut g = vec![vec![false; w + 1]; h + 1]; for i in 1..=h { let mut s = String::new(); stdin().read_line(&mut s).unwrap(); for (j, c) in s.trim().chars().enumerate() { g[i][j + 1] = c == '.'; } } let t = h + w - 2; let mut dp = vec![vec![0i64; h + 1]; h + 1]; let mut dp2 = vec![vec![0i64; h + 1]; h + 1]; if h >= 2 && w >= 2 && g[2][1] && g[1][2] { dp[2][1] = 1; } // 動いた回数とr1 r2がわかれば一意にw1 w2が決まる // dp[r1][r2] の情報だけ持てば良い for x in 1..t { for i in 1..=h { for j in 1..=h { dp2[i][j] = 0; } } for r1 in 1..=h { for r2 in 1..=h { let v = dp[r1][r2]; if v == 0 { continue; } let c1 = x + 2 - r1; let c2 = x + 2 - r2; if c1 > w || c2 > w { continue; } let mut a = vec![]; if r1 < h && g[r1 + 1][c1] { a.push((r1 + 1, c1)); } if c1 < w && g[r1][c1 + 1] { a.push((r1, c1 + 1)); } let mut b = vec![]; if r2 < h && g[r2 + 1][c2] { b.push((r2 + 1, c2)); } if c2 < w && g[r2][c2 + 1] { b.push((r2, c2 + 1)); } for (nr1, nc1) in &a { for (nr2, nc2) in &b { if x + 1 < t && nr1 == nr2 && nc1 == nc2 { continue; } dp2[*nr1][*nr2] = (dp2[*nr1][*nr2] + v) % MOD; } } } } std::mem::swap(&mut dp, &mut dp2); } let ans = dp[h][h] % MOD; p!(ans); }