結果

問題 No.611 Day of the Mountain
ユーザー lzy9
提出日時 2018-04-07 10:45:24
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 317 ms / 2,017 ms
コード長 2,676 bytes
コンパイル時間 24,081 ms
コンパイル使用メモリ 378,264 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-06-26 11:00:11
合計ジャッジ時間 26,017 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 9
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused import: `std::rc::Rc`
 --> src/main.rs:4:5
  |
4 | use std::rc::Rc;
  |     ^^^^^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: static `DX` is never used
  --> src/main.rs:19:8
   |
19 | static DX: &'static [i32] = &[0, 0, 1, -1];
   |        ^^
   |
   = note: `#[warn(dead_code)]` on by default

warning: static `DY` is never used
  --> src/main.rs:20:8
   |
20 | static DY: &'static [i32] = &[1, -1, 0, 0];
   |        ^^

ソースコード

diff #
プレゼンテーションモードにする

use std::io::*;
use std::str::FromStr;
use std::cmp::{min, max};
use std::rc::Rc;
use std::mem::swap;
fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin_lock = stdin.lock();
    let s = stdin_lock
        .bytes()
        .map(|c| c.unwrap() as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect::<String>();
    s.parse::<T>().ok().unwrap()
}
static DX: &'static [i32] = &[0, 0, 1, -1];
static DY: &'static [i32] = &[1, -1, 0, 0];
fn main() {
    let mut h: usize = read();
    let mut w: usize = read();
    let input: Vec<Vec<i32>> = (0..h).map(|_| read::<String>().chars().map(|c| if c == '?' { -1 } else { c.to_digit(10).unwrap() as i32 }).collect
        ()).collect();
    let map = if h < w {
        let mut tmp = vec![vec![0 as i32; h]; w];
        for i in 0..h {
            for j in 0..w {
                tmp[j][i] = input[i][j];
            }
        }
        swap(&mut h, &mut w);
        tmp
    } else {
        input
    };
    let mut dist = vec![vec![1010101010; w]; h];
    dist[0][0] = 0;
    for i in 0..h {
        for j in 0..w {
            if i != 0 {
                dist[i][j] = min(dist[i][j], dist[i - 1][j]);
            }
            if j != 0 {
                dist[i][j] = min(dist[i][j], dist[i][j - 1]);
            }
            dist[i][j] += max(1, map[i][j]);
        }
    }
    println!("{}", dist[h - 1][w - 1]);
    let mut dp = vec![0 as u64; 1 << w];
    dp[1] = 1;
    let m = 201712111u64;
    for i in 0..h {
        for j in 0..w {
            let mut dp2 = vec![0 as u64; 1 << w];
            for k in 0..(1 << w) {
                let mut f = false;
                let c = if map[i][j] == -1 { 1 } else { map[i][j] };
                if (k >> j) & 1 == 1 && (i == 0 || dist[i - 1][j] + c == dist[i][j]) {
                    f = true;
                }
                if j != 0 && (k >> (j - 1)) & 1 == 1 && dist[i][j - 1] + c == dist[i][j] {
                    f = true;
                }
                if f {
                    dp2[k | (1 << j)] += dp[k];
                    dp2[k | (1 << j)] %= m;
                    if map[i][j] == -1 {
                        dp2[k & !(1 << j)] += dp[k] * 8;
                        dp2[k & !(1 << j)] %= m;
                    }
                } else {
                    dp2[k & !(1 << j)] += dp[k] * if map[i][j] == -1 { 9 } else { 1 };
                    dp2[k & !(1 << j)] %= m;
                }
            }
            dp = dp2;
        }
    }
    let mut ans = 0u64;
    for i in 1 << (w - 1)..1 << w {
        ans += dp[i];
        ans %= m;
    }
    println!("{}", ans);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0