結果

問題 No.5006 Hidden Maze
ユーザー ntk-ta01
提出日時 2022-06-12 15:32:43
言語 Rust
(1.83.0 + proconio)
結果
TLE  
実行時間 -
コード長 4,208 bytes
コンパイル時間 1,365 ms
実行使用メモリ 39,592 KB
スコア 0
最終ジャッジ日時 2022-06-12 15:33:27
合計ジャッジ時間 7,902 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other TLE * 1 -- * 99
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: constant is never used: `TIMELIMIT`
  --> Main.rs:42:1
   |
42 | const TIMELIMIT: f64 = 1.935;
   | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
   |
   = note: `#[warn(dead_code)]` on by default

warning: field is never read: `p`
  --> Main.rs:49:5
   |
49 |     pub p: usize,
   |     ^^^^^^^^^^^^

warning: struct is never constructed: `Grid`
  --> Main.rs:52:8
   |
52 | struct Grid {
   |        ^^^^

warning: 3 warnings emitted

ソースコード

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

macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes.by_ref().map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr,) => {};
    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => { ($(read_value!($next, $t)),*) };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}
type Output = String;
const TIMELIMIT: f64 = 1.935;
const DIJ: [(usize, usize); 4] = [(0, !0), (!0, 0), (0, 1), (1, 0)];
const DIR: [char; 4] = ['L', 'U', 'R', 'D'];
struct Input {
    pub h: usize,
    pub w: usize,
    pub p: usize,
}
struct Grid {
    pub yoko: Vec<Vec<Vec<f64>>>, // 確率的に壁がある
}
fn main() {
    let input = parse_input();
    let mut grid = {
        let mut grid = vec![vec![vec![0.0; 4]; input.w]; input.h];
        for j in 0..input.w {
            grid[0][j][1] = 1.0;
            grid[input.h - 1][j][3] = 1.0;
        }
        for i in 0..input.h {
            grid[i][0][0] = 1.0;
            grid[i][input.w - 1][2] = 1.0;
        }
        grid
    };
    let mut out = vec![3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2];
    loop {
        println!("{}", parse_output(&out));
        let feed = {
            let mut s = String::new();
            std::io::stdin().read_line(&mut s).unwrap();
            let s = s.trim();
            s.parse::<i32>().unwrap()
        };
        if feed == -1 {
            break;
        }
        random_walk(&input, &mut out,&mut grid, feed);
    }
}
fn random_walk(input: &Input, out: &mut Vec<usize>, grid: &mut Vec<Vec<Vec<f64>>>, feed: i32) {
    let feed = feed as usize;
    let mut h = 0;
    let mut w = 0;
    for o in out.iter().take(feed) {
        h += DIJ[*o].0;
        w += DIJ[*o].1;
    }
    grid[h][w][out[feed]] = 1.0;
    // bfsして新しくoutを作る
    let mut que = std::collections::VecDeque::new();
    let mut visited = vec![vec![false; input.w]; input.h];
    let mut prev = vec![vec![4; input.w]; input.h];
    visited[0][0] = true;
    que.push_back((0,0));
    while !que.is_empty() {
        let v = que.pop_front().unwrap();
        for (d,(di, dj)) in DIJ.iter().enumerate() {
            let ni = v.0 + *di;
            let nj = v.1 + *dj;
            if input.h <= ni || input.w <= nj {
                continue;
            }
            if visited[ni][nj] || grid[v.0][v.1][d] == 1.0 {
                continue;
            }
            visited[ni][nj] = true;
            prev[ni][nj] = d;
            que.push_back((ni, nj));
        }
    }
    for row in visited.iter() {
        for b in row {
            if *b {
                eprint!("o");
            } else{
                eprint!("_");
            }
        }
        eprintln!();
    }
    // 経路復元
    let mut new_out = vec![];
    let mut v = (input.h - 1, input.w - 1);
    while v != (0,0) {
        let i = prev[v.0][v.1];
        if i == 4 {
            break;
        }  
        new_out.push(i);
        v.0 += DIJ[i ^ 2].0;
        v.1 += DIJ[i ^ 2].1;
    }
    new_out.reverse();
    *out = new_out;
}
fn parse_input() -> Input {
    input!{
        h: usize,
        w: usize,
        p: usize,
    }
    Input { h, w, p }
}
fn parse_output(out: &Vec<usize>) -> Output {
    out.iter().map(|o| DIR[*o]).collect()
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0