Submission #8854557
Source Code Expand
#include<iostream> #include<cstdio> #include<cstring> using namespace std; char a[105][105]; int main() { int n,m,b,c; cin>>n>>m; for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) cin>>a[i][j]; for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) { if(a[i][j]=='#') continue; a[i][j]='0'; if(a[i+1][j-1]=='#') a[i][j]++; if(a[i+1][j]=='#') a[i][j]++; if(a[i+1][j+1]=='#') a[i][j]++; if(a[i][j+1]=='#') a[i][j]++; if(a[i][j-1]=='#') a[i][j]++; if(a[i-1][j+1]=='#') a[i][j]++; if(a[i-1][j]=='#') a[i][j]++; if(a[i-1][j-1]=='#') a[i][j]++; } for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) cout<<a[i][j]; cout<<endl; } }
Submission Info
Submission Time | |
---|---|
Task | B - Minesweeper |
User | luogu_bot3 |
Language | C++ (GCC 5.4.1) |
Score | 200 |
Code Size | 706 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 |