結果
問題 | No.2412 YOU Grow Bigger! |
ユーザー | koba-e964 |
提出日時 | 2023-08-16 00:02:35 |
言語 | Rust (1.77.0 + proconio) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,771 bytes |
コンパイル時間 | 22,509 ms |
コンパイル使用メモリ | 378,596 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-24 09:22:40 |
合計ジャッジ時間 | 14,664 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | AC | 17 ms
5,248 KB |
testcase_04 | AC | 17 ms
5,248 KB |
testcase_05 | AC | 17 ms
5,248 KB |
testcase_06 | AC | 17 ms
5,248 KB |
testcase_07 | AC | 17 ms
5,248 KB |
testcase_08 | AC | 17 ms
5,248 KB |
testcase_09 | AC | 19 ms
5,248 KB |
testcase_10 | AC | 11 ms
5,248 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 13 ms
5,248 KB |
testcase_14 | AC | 11 ms
5,248 KB |
testcase_15 | AC | 15 ms
5,248 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 9 ms
5,248 KB |
testcase_20 | WA | - |
testcase_21 | AC | 8 ms
5,248 KB |
testcase_22 | AC | 14 ms
5,248 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 9 ms
5,248 KB |
testcase_26 | AC | 10 ms
5,248 KB |
testcase_27 | AC | 8 ms
5,248 KB |
testcase_28 | AC | 13 ms
5,248 KB |
testcase_29 | AC | 16 ms
5,248 KB |
testcase_30 | AC | 1 ms
5,248 KB |
コンパイルメッセージ
warning: unused macro definition: `puts` --> src/main.rs:63:18 | 63 | macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););} | ^^^^ | = note: `#[warn(unused_macros)]` on by default warning: unused import: `Write` --> src/main.rs:5:15 | 5 | use std::io::{Write, BufWriter}; | ^^^^^ | = note: `#[warn(unused_imports)]` on by default warning: unused variable: `out` --> src/main.rs:62:13 | 62 | let mut out = BufWriter::new(out.lock()); | ^^^ help: if this is intentional, prefix it with an underscore: `_out` | = note: `#[warn(unused_variables)]` on by default warning: variable does not need to be mutable --> src/main.rs:62:9 | 62 | let mut out = BufWriter::new(out.lock()); | ----^^^ | | | help: remove this `mut` | = note: `#[warn(unused_mut)]` on by default
ソースコード
#[allow(unused_imports)] use std::cmp::*; #[allow(unused_imports)] use std::collections::*; use std::io::{Write, BufWriter}; // https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 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")); } trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); } impl<T: PartialOrd> Change for T { fn chmax(&mut self, x: T) { if *self < x { *self = x; } } fn chmin(&mut self, x: T) { if *self > x { *self = x; } } } // Solved with hints fn main() { // In order to avoid potential stack overflow, spawn a new thread. let stack_size = 104_857_600; // 100 MB let thd = std::thread::Builder::new().stack_size(stack_size); thd.spawn(|| solve()).unwrap().join().unwrap(); } fn solve() { let out = std::io::stdout(); let mut out = BufWriter::new(out.lock()); macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););} #[allow(unused)] macro_rules! putvec { ($v:expr) => { for i in 0..$v.len() { puts!("{}{}", $v[i], if i + 1 == $v.len() {"\n"} else {" "}); } } } input! { h: usize, w: usize, s: [chars; h], } let mut s = s; for i in 0..h { s[i].insert(0, '.'); s[i].push('.'); } s.insert(0, vec!['.'; w + 1]); s.push(vec!['.'; w + 1]); const INF: i32 = 1 << 28; let mut que = BinaryHeap::new(); let mut dist = vec![vec![INF; w + 2]; h + 2]; for i in 4..w + 2 { que.push((Reverse(0), 0, i)); } for i in 0..h - 2 { que.push((Reverse(0), i, w + 1)); } while let Some((Reverse(d), x, y)) = que.pop() { if dist[x][y] <= d { continue; } dist[x][y] = d; for dx in -3i32..=3 { for dy in -3i32..=3 { if dx.abs() == 3 && dy.abs() == 3 { continue; } let nx = (x as i32 + dx) as usize; let ny = (y as i32 + dy) as usize; if nx >= h || ny >= w { continue; } if nx <= 3 && ny <= 3 { continue; } if nx >= h - 2 && ny >= w - 2 { continue; } que.push((Reverse(d + if s[nx][ny] == '#' { 0 } else { 1 }), nx, ny)); } } } let mut ans = INF; for i in 4..h + 2 { ans = min(ans, dist[i][0]); } for i in 0..w - 2 { ans = min(ans, dist[h + 1][i]); } println!("{}", ans - 1); }