#344401 (Rust) No.179 塗り分け

• 問題: No.179 塗り分け
• ユーザー: MasuqaT
• 提出日時: 2019-05-02 21:33:03
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 36 ms / 3,000 ms
• コード長: 5,120 bytes
• コンパイル時間: 13,139 ms
• コンパイル使用メモリ: 380,060 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-07-23 15:00:00
• 合計ジャッジ時間: 14,659 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

ファイルパターン	結果
sample	AC * 6
other	AC * 40

コンパイルメッセージ

warning: unused `Result` that must be used
   --> src/main.rs:139:17
    |
139 |                 write!(writer, "YES");
    |                 ^^^^^^^^^^^^^^^^^^^^^
    |
    = note: this `Result` may be an `Err` variant, which should be handled
    = note: `#[warn(unused_must_use)]` on by default
    = note: this warning originates in the macro `write` (in Nightly builds, run with -Z macro-backtrace for more info)

warning: unused `Result` that must be used
   --> src/main.rs:142:17
    |
142 |                 write!(writer, "NO");
    |                 ^^^^^^^^^^^^^^^^^^^^
    |
    = note: this `Result` may be an `Err` variant, which should be handled
    = note: this warning originates in the macro `write` (in Nightly builds, run with -Z macro-backtrace for more info)

warning: unused `Result` that must be used
   --> src/main.rs:148:5
    |
148 |     write!(writer, "NO");
    |     ^^^^^^^^^^^^^^^^^^^^
    |
    = note: this `Result` may be an `Err` variant, which should be handled
    = note: this warning originates in the macro `write` (in Nightly builds, run with -Z macro-backtrace for more info)

ソースコード

use std::io;
use std::io::{BufRead, Write};

macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    (stdin = $s:expr, $($r:tt)*) => {
        let s = {
            let mut s = String::new();
            $s.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)*}
    };
}

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<_>>()
    };

    ($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)]
macro_rules! assert_judge {
    ($method:ident, $input:expr, $expected:expr) => {
        {
            let input = $input.as_bytes();
            let mut output = Vec::new();

            $method(&input[..], &mut output);

            let output = String::from_utf8(output).expect("Not UTF-8");

            assert_eq!($expected, output);
        }
    };
}

#[allow(unused_macros)]
macro_rules! assert_judge_with_output {
    ($method:ident, $input:expr) => {
        {
            let input = $input.as_bytes();
            let mut output = Vec::new();

            $method(&input[..], &mut output);

            String::from_utf8(output).expect("Not UTF-8")
        }
    };
}

fn main() {
    let stdio = io::stdin();
    let input = stdio.lock();

    let output = io::stdout();

    process(input, output);
}

fn process<R, W>(mut reader: R, mut writer: W) -> () where
    R: BufRead,
    W: Write {
    input! {
        stdin = reader,
        h: usize, w: usize,
        s: [chars; h]
    }

    // referred editorial comments :(

    for di in 0..h as i32 {
        'attempt: for dj in (1 - w as i32)..w as i32 {
            if di == 0 && dj < 0 {
                continue;
            }

            let mut map = vec![vec!['.'; w]; h];
            let mut is_modified = false;

            // copy
            for i in 0..h {
                for j in 0..w {
                    map[i][j] = s[i][j];
                }
            }

            for i in 0..h {
                for j in 0..w {
                    if map[i][j] == '#' {
                        map[i][j] = '!';

                        if i as i32 + di >= h as i32 || j as i32 + dj < 0 || j as i32 + dj >= w as i32 {
                            continue 'attempt;
                        }
                        let idi = (i as i32 + di) as usize;
                        let jdj = (j as i32 + dj) as usize;
                        if map[idi][jdj] == '#' {
                            map[idi][jdj] = '?';
                            is_modified = true;
                        } else {
                            continue 'attempt;
                        }
                    }
                }
            }

            if is_modified {
                write!(writer, "YES");
            } else {
                // All squares are white
                write!(writer, "NO");
            }
            return;
        }
    }

    write!(writer, "NO");
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn sample1() {
        assert_judge!(process,
"
3 3
##.
###
.#.
", "YES");
    }

    #[test]
    fn sample2() {
        assert_judge!(process,
"
5 3
.#.
.#.
.#.
.#.
.#.
", "NO");
    }

    #[test]
    fn sample3() {
        assert_judge!(process,
"
3 9
######...
#.####.#.
######...
", "YES");
    }

    #[test]
    fn sample4() {
        assert_judge!(process,
"
3 5
#...#
##.##
#...#
", "NO");
    }

    #[test]
    fn sample5() {
        assert_judge!(process,
"
5 8
###.....
#.####..
..####..
..####.#
.....###
", "YES");
    }

    #[test]
    fn sample6() {
        assert_judge!(process,
"
23 33
...............##................
...........##########............
.......##################........
...##########################....
.##....##################....##..
.######....##########....######..
.##########....##....##########..
.##....########..##############..
.######....####..##############..
.##############..##############..
.##############..##############..
.##############..##############..
...############..############....
.......########..########........
...........####..####............
...............##................
.................................
........#...#...........#........
........#...............#........
#.#.#.#.#.#.#.###.###.###.###.#.#
#.#.#.#.##..#.#...#.#.#.#.##..##.
.#..###.#.#.#.###.###.###.###.#..
#................................
", "NO");
    }
}