Submission #1791988
Source Code Expand
import std.stdio; import std.string; import std.conv; import std.bigint; import std.typecons; import std.algorithm; import std.array; import std.math; import std.range; void main() { auto tmp = readln.split.to!(int[]); auto H = tmp[0], W = tmp[1]; char[][] S; foreach (i; 0..H) { S ~= readln.chomp.dup; } foreach (i; 0..W) { foreach (j; 0..H) { if (S[j][i] == '#') continue; auto c = 0; foreach (k; -1..2) { if (i+k == -1) continue; if (i+k == W) continue; foreach (l; -1..2) { if (j+l == -1) continue; if (j+l == H) continue; if (S[j+l][i+k] == '#') c++; } } S[j][i] = cast(char)(c + '0'); } } foreach (i; 0..H) { writeln(S[i]); } }
Submission Info
Submission Time | |
---|---|
Task | B - Minesweeper |
User | sobaya |
Language | D (DMD64 v2.070.1) |
Score | 200 |
Code Size | 925 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
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, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_1.txt | AC | 1 ms | 256 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |
subtask_1_12.txt | AC | 1 ms | 256 KB |
subtask_1_2.txt | AC | 1 ms | 256 KB |
subtask_1_3.txt | AC | 1 ms | 256 KB |
subtask_1_4.txt | AC | 1 ms | 256 KB |
subtask_1_5.txt | AC | 1 ms | 256 KB |
subtask_1_6.txt | AC | 1 ms | 256 KB |
subtask_1_7.txt | AC | 1 ms | 256 KB |
subtask_1_8.txt | AC | 1 ms | 256 KB |
subtask_1_9.txt | AC | 1 ms | 256 KB |