Submission #2856982
Source Code Expand
#include <iostream> #include <string> #include <algorithm> using namespace std; int main() { int H, W; cin >> H >> W; string S[50]; for (int i = 0; i < H; i++) cin >> S[i]; for (int i = 0; i < H; i++) { for (int j = 0; j < W; j++) { int n = 0; for (int k = -1; k <= 1; k++) { for (int l = -1; l <= 1; l++) { if (i + k < 0 || i + k >= H || j + l < 0 || j + l >= W) continue; if (S[i + k][j + l] == '#') n++; } } if (S[i][j] == '#') cout << "#"; else cout << n; } cout << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Minesweeper |
User | lice666 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 617 Byte |
Status | AC |
Exec Time | 2 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 | 2 ms | 256 KB |
subtask_1_10.txt | AC | 2 ms | 256 KB |
subtask_1_11.txt | AC | 2 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 |