Submission #15353600
Source Code Expand
use proconio::input;
use proconio::marker::Chars;
fn main() {
input! {
n: usize,
m: usize,
b: [Chars; n]
};
let mut c = vec![vec![0; m]; n];
for i in 0..n {
for j in 0..m {
c[i][j] = b[i][j] as u8 - b'0';
}
}
let mut a = vec![vec![0; m]; n];
let d = [(-1, 0), (0, 1), (1, 0), (0, -1)];
for i in 1..n - 1 {
for j in 1..m - 1 {
let mut min_count = std::u8::MAX;
for &(di, dj) in d.iter() {
min_count = std::cmp::min(
min_count,
c[(i as i16 + di) as usize][(j as i16 + dj) as usize],
);
}
for &(di, dj) in d.iter() {
c[(i as i16 + di) as usize][(j as i16 + dj) as usize] -= min_count;
}
a[i][j] = min_count;
}
}
for i in 0..n {
for j in 0..m {
print!("{}", a[i][j]);
}
println!();
}
}
Submission Info
| Submission Time | |
|---|---|
| Task | B - アメーバ |
| User | bouzuya |
| Language | Rust (1.42.0) |
| Score | 100 |
| Code Size | 993 Byte |
| Status | AC |
| Exec Time | 45 ms |
| Memory | 3912 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 100 / 100 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_01.txt, sample_02.txt, sample_03.txt |
| All | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| sample_01.txt | AC | 10 ms | 2024 KiB |
| sample_02.txt | AC | 1 ms | 2032 KiB |
| sample_03.txt | AC | 1 ms | 1984 KiB |
| subtask1_01.txt | AC | 2 ms | 2020 KiB |
| subtask1_02.txt | AC | 2 ms | 2080 KiB |
| subtask1_03.txt | AC | 44 ms | 3864 KiB |
| subtask1_04.txt | AC | 42 ms | 3820 KiB |
| subtask1_05.txt | AC | 45 ms | 3848 KiB |
| subtask1_06.txt | AC | 38 ms | 3856 KiB |
| subtask1_07.txt | AC | 42 ms | 3808 KiB |
| subtask1_08.txt | AC | 35 ms | 3912 KiB |
| subtask1_09.txt | AC | 42 ms | 3808 KiB |
| subtask1_10.txt | AC | 9 ms | 2200 KiB |
| subtask1_11.txt | AC | 10 ms | 2204 KiB |
| subtask1_12.txt | AC | 31 ms | 3060 KiB |
| subtask1_13.txt | AC | 16 ms | 2620 KiB |
| subtask1_14.txt | AC | 16 ms | 2544 KiB |
| subtask1_15.txt | AC | 22 ms | 2980 KiB |
| subtask1_16.txt | AC | 16 ms | 2552 KiB |
| subtask1_17.txt | AC | 15 ms | 2432 KiB |
| subtask1_18.txt | AC | 3 ms | 2088 KiB |
| subtask1_19.txt | AC | 6 ms | 2104 KiB |
| subtask1_20.txt | AC | 3 ms | 2088 KiB |
| subtask1_21.txt | AC | 18 ms | 2528 KiB |
| subtask1_22.txt | AC | 17 ms | 2316 KiB |
| subtask1_23.txt | AC | 26 ms | 2828 KiB |
| subtask1_24.txt | AC | 24 ms | 2760 KiB |