#714201 (Rust) No.866 レベルKの正方形

• 問題: No.866 レベルKの正方形
• ユーザー: koba-e964
• 提出日時: 2021-11-08 22:31:53
• 言語: Rust (1.77.0 + proconio)
• 結果: TLE
• 実行時間: -
• コード長: 3,849 bytes
• コンパイル時間: 13,094 ms
• コンパイル使用メモリ: 403,228 KB
• 実行使用メモリ: 433,060 KB
• 最終ジャッジ日時: 2024-11-17 00:17:23
• 合計ジャッジ時間: 114,338 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 13,768 KB
testcase_01	AC	1 ms; 432,928 KB
testcase_02	AC	1 ms; 432,932 KB
testcase_03	AC	1 ms; 432,932 KB
testcase_04	AC	2 ms; 432,928 KB
testcase_05	AC	1 ms; 433,056 KB
testcase_06	AC	1 ms; 432,936 KB
testcase_07	AC	2 ms; 433,056 KB
testcase_08	TLE	-
testcase_09	TLE	-
testcase_10	TLE	-
testcase_11	TLE	-
testcase_12	TLE	-
testcase_13	TLE	-
testcase_14	TLE	-
testcase_15	TLE	-
testcase_16	TLE	-
testcase_17	TLE	-
testcase_18	TLE	-
testcase_19	TLE	-
testcase_20	TLE	-
testcase_21	TLE	-
testcase_22	AC	1 ms; 6,816 KB
testcase_23	AC	1 ms; 6,816 KB
testcase_24	AC	1 ms; 433,056 KB

コンパイルメッセージ

warning: unused import: `BufWriter`
 --> src/main.rs:5:22
  |
5 | use std::io::{Write, BufWriter};
  |                      ^^^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unused import: `Write`
 --> src/main.rs:5:15
  |
5 | use std::io::{Write, BufWriter};
  |               ^^^^^

ソースコード

#[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() {
    input! {
        h: usize, w: usize, k: usize,
        c: [chars; h],
    }
    let mut acc = vec![vec![vec![0; w + 1]; h + 1]; 26];
    for u in 0..26 {
        for i in 0..h {
            for j in 0..w {
                acc[u][i + 1][j + 1] = acc[u][i + 1][j] + acc[u][i][j + 1]
                    - acc[u][i][j] + if c[i][j] as u8 - b'a' == u as u8 {
                        1
                    } else {
                        0
                    };
            }
        }
    }
    let mut tot = 0;
    for i in 0..h {
        for j in 0..w {
            let mut pass = 0;
            let mut fail = min(w - j, h - i) + 1;
            while fail - pass > 1 {
                let mid = (fail + pass) / 2;
                let mut ans = 0;
                for u in 0..26 {
                    if acc[u][i + mid][j + mid] - acc[u][i][j + mid]
                        - acc[u][i + mid][j] + acc[u][i][j] > 0 {
                            ans += 1;
                        }
                }
                if ans < k {
                    pass = mid;
                } else {
                    fail = mid;
                }
            }
            let lb = fail;
            let mut pass = 0;
            let mut fail = min(w - j, h - i) + 1;
            while fail - pass > 1 {
                let mid = (fail + pass) / 2;
                let mut ans = 0;
                for u in 0..26 {
                    if acc[u][i + mid][j + mid] - acc[u][i][j + mid]
                        - acc[u][i + mid][j] + acc[u][i][j] > 0 {
                            ans += 1;
                        }
                }
                if ans <= k {
                    pass = mid;
                } else {
                    fail = mid;
                }
            }
            let ub = fail;
            if lb < ub {
                tot += (ub - lb) as i64;
            }
        }
    }
    println!("{}", tot);
}