結果

問題 No.2456 Stamp Art
コンテスト
ユーザー koba-e964
提出日時 2023-09-03 03:45:06
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 556 ms / 5,000 ms
コード長 3,766 bytes
コンパイル時間 11,463 ms
コンパイル使用メモリ 380,236 KB
実行使用メモリ 49,152 KB
最終ジャッジ日時 2024-06-12 13:28:59
合計ジャッジ時間 20,079 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 23
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused macro definition: `puts`
  --> src/main.rs:62:18
   |
62 |     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:61:13
   |
61 |     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:61:9
   |
61 |     let mut out = BufWriter::new(out.lock());
   |         ----^^^
   |         |
   |         help: remove this `mut`
   |
   = note: `#[warn(unused_mut)]` on by default

ソースコード

diff # 

#[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; } }
}

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 acc = vec![vec![0; w + 1]; h + 1];
    for i in 0..h {
        for j in 0..w {
            acc[i + 1][j + 1] = acc[i + 1][j] + acc[i][j + 1] - acc[i][j]
                + if s[i][j] == '.' {
                    1
                } else {
                    0
                };
        }
    }
    let mut fail = min(h, w) + 1;
    let mut pass = 1;
    while fail - pass > 1 {
        let mid = (fail + pass) / 2;
        let mut imos = vec![vec![0; w + 1]; h + 1];
        for i in 0..h + 1 - mid {
            for j in 0..w + 1 - mid {
                if acc[i + mid][j + mid] + acc[i][j] == acc[i + mid][j] + acc[i][j + mid] {
                    imos[i][j] += 1;
                    imos[i][j + mid] -= 1;
                    imos[i + mid][j] -= 1;
                    imos[i + mid][j + mid] += 1;
                }
            }
        }
        for i in 0..h + 1 {
            for j in 0..w {
                imos[i][j + 1] += imos[i][j];
            }
        }
        for i in 0..h {
            for j in 0..w + 1 {
                imos[i + 1][j] += imos[i][j];
            }
        }
        let mut ok = true;
        for i in 0..h {
            for j in 0..w {
                ok &= (imos[i][j] != 0) == (s[i][j] == '#');
            }
        }
        if ok {
            pass = mid;
        } else {
            fail = mid;
        }
    }
    println!("{}", pass);
}
0