結果

問題 No.1949 足し算するだけのパズルゲーム(2)
ユーザー bqnbqn
提出日時 2022-05-22 20:59:52
言語 Rust
(1.77.0)
結果
AC  
実行時間 57 ms / 3,000 ms
コード長 8,102 bytes
コンパイル時間 1,195 ms
コンパイル使用メモリ 183,028 KB
実行使用メモリ 7,556 KB
最終ジャッジ日時 2023-10-20 17:18:18
合計ジャッジ時間 3,169 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,348 KB
testcase_01 AC 1 ms
4,348 KB
testcase_02 AC 1 ms
4,348 KB
testcase_03 AC 1 ms
4,348 KB
testcase_04 AC 1 ms
4,348 KB
testcase_05 AC 1 ms
4,348 KB
testcase_06 AC 1 ms
4,348 KB
testcase_07 AC 21 ms
4,532 KB
testcase_08 AC 17 ms
4,528 KB
testcase_09 AC 28 ms
4,532 KB
testcase_10 AC 27 ms
4,532 KB
testcase_11 AC 27 ms
4,664 KB
testcase_12 AC 23 ms
4,632 KB
testcase_13 AC 41 ms
4,532 KB
testcase_14 AC 57 ms
7,556 KB
testcase_15 AC 57 ms
7,556 KB
testcase_16 AC 9 ms
4,532 KB
testcase_17 AC 21 ms
4,532 KB
testcase_18 AC 10 ms
4,532 KB
testcase_19 AC 1 ms
4,348 KB
testcase_20 AC 1 ms
4,348 KB
testcase_21 AC 1 ms
4,348 KB
testcase_22 AC 19 ms
4,532 KB
testcase_23 AC 1 ms
4,348 KB
testcase_24 AC 13 ms
4,532 KB
testcase_25 AC 23 ms
4,532 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused macro definition: `input_inner`
  --> Main.rs:89:14
   |
89 | macro_rules! input_inner {
   |              ^^^^^^^^^^^
   |
   = note: `#[warn(unused_macros)]` on by default

warning: unused macro definition: `mydbg`
   --> Main.rs:142:14
    |
142 | macro_rules! mydbg {
    |              ^^^^^

warning: 2 warnings emitted

ソースコード

diff # 

#![allow(unused_parens)]
#![allow(unused_imports)]
#![allow(non_upper_case_globals)]
#![allow(non_snake_case)]
#![allow(unused_mut)]
#![allow(unused_variables)]
#![allow(dead_code)]

type Vec2<T> = Vec<Vec<T>>;
type Vec3<T> = Vec<Vec<Vec<T>>>;

#[allow(unused_macros)]
macro_rules! invec {
    ( $ t : ty ) => {{
        let mut s = String::new();
        match std::io::stdin().read_line(&mut s) {
            Ok(0) => Vec::<$t>::new(),
            Ok(n) => s
                .trim()
                .split_whitespace()
                .map(|s| s.parse::<$t>().unwrap())
                .collect::<Vec<$t>>(),
            Err(_) => Vec::<$t>::new(),
        }
    }};
}

#[allow(unused_macros)]
macro_rules! get {
      ($t:ty) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              line.trim().parse::<$t>().unwrap()
          }
      };
      ($($t:ty),*) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              let mut iter = line.split_whitespace();
              (
                  $(iter.next().unwrap().parse::<$t>().unwrap(),)*
              )
          }
      };
      ($t:ty; $n:expr) => {
          (0..$n).map(|_|
              get!($t)
          ).collect::<Vec<_>>()
      };
      ($($t:ty),*; $n:expr) => {
          (0..$n).map(|_|
              get!($($t),*)
          ).collect::<Vec<_>>()
      };
      ($t:ty ;;) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              line.split_whitespace()
                  .map(|t| t.parse::<$t>().unwrap())
                  .collect::<Vec<_>>()
          }
      };
      ($t:ty ;; $n:expr) => {
          (0..$n).map(|_| get!($t ;;)).collect::<Vec<_>>()
      };
}

#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let mut s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
    ($iter:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($next:expr, [$t:tt]) => {
        {
            let len = read_value!($next, usize);
            (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
        }
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
#[cfg(debug_assertions)]
macro_rules! mydbg {
    //($arg:expr) => (dbg!($arg))
    //($arg:expr) => (println!("{:?}",$arg));
      ($($a:expr),*) => {
          eprintln!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
      }
}
#[cfg(not(debug_assertions))]
macro_rules! mydbg {
    ($($arg:expr),*) => {};
}

macro_rules! echo {
    ($($a:expr),*) => {
          $(println!("{}",$a))*
      }
}

use std::cmp::*;
use std::collections::*;
use std::ops::{Add, Div, Mul, Rem, Sub};

trait SafeRangeContain {
    fn safe_contains(&self, x: i64) -> bool;
}

impl SafeRangeContain for std::ops::Range<usize> {
    fn safe_contains(&self, x: i64) -> bool {
        if x < 0 {
            return false;
        }
        return self.contains(&(x as usize));
    }
}

#[allow(dead_code)]
static INF_I64: i64 = i64::max_value() / 2;
#[allow(dead_code)]
static INF_I32: i32 = i32::max_value() / 2;
#[allow(dead_code)]
static INF_USIZE: usize = usize::max_value() / 2;
#[allow(dead_code)]
static M_O_D: usize = 1000000007;
#[allow(dead_code)]
static PAI: f64 = 3.1415926535897932;

trait IteratorExt: Iterator {
    fn toVec(self) -> Vec<Self::Item>;
}

impl<T: Iterator> IteratorExt for T {
    fn toVec(self) -> Vec<Self::Item> {
        self.collect()
    }
}

trait CharExt {
    fn toNum(&self) -> usize;
    fn toAlphabetIndex(&self) -> usize;
    fn toNumIndex(&self) -> usize;
}
impl CharExt for char {
    fn toNum(&self) -> usize {
        return *self as usize;
    }
    fn toAlphabetIndex(&self) -> usize {
        return self.toNum() - 'a' as usize;
    }
    fn toNumIndex(&self) -> usize {
        return self.toNum() - '0' as usize;
    }
}

trait VectorExt {
    fn joinToString(&self, s: &str) -> String;
}
impl<T: ToString> VectorExt for Vec<T> {
    fn joinToString(&self, s: &str) -> String {
        return self
            .iter()
            .map(|x| x.to_string())
            .collect::<Vec<_>>()
            .join(s);
    }
}

trait StringExt {
    fn get_reverse(&self) -> String;
}
impl StringExt for String {
    fn get_reverse(&self) -> String {
        self.chars().rev().collect::<String>()
    }
}

trait UsizeExt {
    fn pow(&self, n: usize) -> usize;
}
impl UsizeExt for usize {
    fn pow(&self, n: usize) -> usize {
        return ((*self as u64).pow(n as u32)) as usize;
    }
}

struct Direction {
    H: usize,
    W: usize,
    mx: Vec<i64>,
    my: Vec<i64>,
    direction: Vec<char>,
}
impl Direction {
    fn new(h: usize, w: usize) -> Self {
        Direction {
            H: h,
            W: w,
            mx: vec![0, -1, 0, 1],
            my: vec![1, 0, -1, 0],
            direction: vec!['D', 'L', 'U', 'R'],
        }
    }
    fn getIndex(&self, y: usize, x: usize) -> usize {
        y * self.W + x
    }
    fn getPos(&self, index: usize) -> (usize, usize) {
        (index / self.W, index % self.W)
    }
    fn dir(&self, y: usize, x: usize, k: usize) -> Option<(usize, usize)> {
        let nx = self.mx[k] + x as i64;
        let ny = self.my[k] + y as i64;
        if nx < 0 || ny < 0 || nx >= self.W as i64 || ny >= self.H as i64 {
            None
        } else {
            Some((ny as usize, nx as usize))
        }
    }
}

fn main() {
    solve();
}

fn solve() {
    let mut ans: u64 = 0;

    let (H, W, Y, X) = get!(usize, usize, usize, usize);
    let mut map = vec![];
    for _ in 0..H {
        map.push(invec!(i64));
    }
    let mut dir = Direction::new(H, W);

    let mut now = map[Y - 1][X - 1];
    let mut h = BinaryHeap::new();
    let mut kouho = VecDeque::new();
    kouho.push_back((Y - 1, X - 1));
    let mut used = vec![vec![false; W]; H];
    let mut finished = vec![vec![false; W]; H];
    used[Y - 1][X - 1] = true;
    finished[Y - 1][X - 1] = true;

    while !kouho.is_empty() {
        let (y, x) = kouho.pop_front().unwrap();
        for k in 0..4 {
            if let Some((ny, nx)) = dir.dir(y, x, k) {
                if used[ny][nx] {
                    continue;
                }
                used[ny][nx] = true;
                h.push((Reverse(map[ny][nx]), ny, nx));
            }
        }
        while !h.is_empty() {
            let (Reverse(attack), ny, nx) = h.pop().unwrap();
            if now > attack {
                kouho.push_back((ny, nx));
                finished[ny][nx] = true;
                now += attack;
            } else {
                h.push((Reverse(attack), ny, nx));
                break;
            }
        }
    }

    let mut ans = true;
    for i in 0..H {
        for j in 0..W {
            ans &= finished[i][j];
        }
    }
    echo!(if ans { "Yes" } else { "No" });
}
0