結果
問題 | No.1588 Connection |
ユーザー | koba-e964 |
提出日時 | 2021-10-06 14:12:13 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 107 ms / 2,000 ms |
コード長 | 2,219 bytes |
コンパイル時間 | 1,168 ms |
コンパイル使用メモリ | 156,740 KB |
実行使用メモリ | 24,384 KB |
平均クエリ数 | 562.59 |
最終ジャッジ日時 | 2023-09-30 08:46:41 |
合計ジャッジ時間 | 5,427 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 34 ms
23,448 KB |
testcase_01 | AC | 26 ms
24,060 KB |
testcase_02 | AC | 26 ms
23,508 KB |
testcase_03 | AC | 26 ms
23,916 KB |
testcase_04 | AC | 25 ms
23,328 KB |
testcase_05 | AC | 25 ms
23,520 KB |
testcase_06 | AC | 27 ms
23,640 KB |
testcase_07 | AC | 25 ms
24,120 KB |
testcase_08 | AC | 28 ms
24,120 KB |
testcase_09 | AC | 29 ms
23,292 KB |
testcase_10 | AC | 29 ms
23,532 KB |
testcase_11 | AC | 28 ms
23,388 KB |
testcase_12 | AC | 58 ms
24,384 KB |
testcase_13 | AC | 64 ms
24,048 KB |
testcase_14 | AC | 25 ms
23,316 KB |
testcase_15 | AC | 26 ms
23,568 KB |
testcase_16 | AC | 26 ms
24,228 KB |
testcase_17 | AC | 26 ms
23,376 KB |
testcase_18 | AC | 26 ms
23,508 KB |
testcase_19 | AC | 26 ms
23,328 KB |
testcase_20 | AC | 28 ms
23,544 KB |
testcase_21 | AC | 103 ms
23,532 KB |
testcase_22 | AC | 102 ms
23,544 KB |
testcase_23 | AC | 58 ms
23,436 KB |
testcase_24 | AC | 43 ms
23,436 KB |
testcase_25 | AC | 67 ms
23,652 KB |
testcase_26 | AC | 66 ms
23,652 KB |
testcase_27 | AC | 42 ms
23,532 KB |
testcase_28 | AC | 38 ms
24,060 KB |
testcase_29 | AC | 107 ms
23,316 KB |
testcase_30 | AC | 106 ms
23,988 KB |
testcase_31 | AC | 25 ms
23,268 KB |
ソースコード
#[allow(unused_imports)] use std::cmp::*; #[allow(unused_imports)] use std::collections::*; use std::io::Read; #[allow(dead_code)] fn getline() -> String { let mut ret = String::new(); std::io::stdin().read_line(&mut ret).ok().unwrap(); ret } fn get_word() -> String { let stdin = std::io::stdin(); let mut stdin=stdin.lock(); let mut u8b: [u8; 1] = [0]; loop { let mut buf: Vec<u8> = Vec::with_capacity(16); loop { let res = stdin.read(&mut u8b); if res.unwrap_or(0) == 0 || u8b[0] <= b' ' { break; } else { buf.push(u8b[0]); } } if buf.len() >= 1 { let ret = String::from_utf8(buf).unwrap(); return ret; } } } #[allow(dead_code)] fn get<T: std::str::FromStr>() -> T { get_word().parse().ok().unwrap() } fn ask(a: usize, b: usize) -> i32 { println!("{} {}", a + 1, b + 1); let s = get_word(); if s == "Black" { 1 } else if s == "White" { 0 } else { panic!(); } } fn solve() { let n: usize = get(); let _m: usize = get(); let mut col = vec![vec![2; n]; n]; col[0][0] = 1; col[n - 1][n - 1] = 1; let mut que = VecDeque::new(); que.push_back((0, 0)); let dxy = [(0i32, 1i32), (1, 0), (0, -1), (-1, 0)]; let mut vis = vec![vec![false; n]; n]; while let Some((x, y)) = que.pop_front() { if vis[x][y] { continue; } vis[x][y] = true; for &(dx, dy) in &dxy { let nx = (x as i32 + dx) as usize; let ny = (y as i32 + dy) as usize; if nx >= n || ny >= n { continue; } if col[nx][ny] == 2 { col[nx][ny] = ask(nx, ny); } if col[nx][ny] == 1 { que.push_back((nx, ny)); } } } println!("{}", if vis[n - 1][n - 1] { "Yes" } else { "No" }); } 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(); }