Submission #2216410


Source Code Expand

#include <iostream>
using namespace std;

int main(){
	int H, W;
	cin >> H >> W;
	char S[H][W];
	for(int i=0; i<H; i++){
		for(int j=0; j<W; j++){
			cin >> S[i][j];
		}
	}

	for(int i=0; i<H; i++){
		for(int j=0; j<W; j++){
			int c=0;

			if(S[i][j]=='#'){
				cout << '#' << endl;
			} else if(S[i][j]=='.'){
				if(0<i&&0<j&&S[i-1][j-1]=='#') c++;
				if(0<i&&S[i-1][ j ]=='#') c++;
				if(0<i&&j<W-1&&S[i-1][j+1]=='#') c++;
				if(0<j&&S[ i ][j-1]=='#') c++;
				if(j<W-1&&S[ i ][j+1]=='#') c++;
				if(i<H-1&&0<j&&S[i+1][j-1]=='#') c++;
				if(i<H-1&&S[i+1][ j ]=='#') c++;
				if(i<H-1&&j<W-1&&S[i+1][j+1]=='#') c++;
				cout << c;
			}
		}
		cout << endl;
	}
}

Submission Info

Submission Time
Task B - Minesweeper
User gobeyond
Language C++14 (GCC 5.4.1)
Score 0
Code Size 701 Byte
Status WA
Exec Time 5 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
WA × 3
AC × 3
WA × 12
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 WA 1 ms 256 KB
sample_02.txt WA 1 ms 256 KB
sample_03.txt WA 1 ms 256 KB
subtask_1_1.txt WA 3 ms 256 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt WA 5 ms 256 KB
subtask_1_12.txt WA 1 ms 256 KB
subtask_1_2.txt WA 1 ms 256 KB
subtask_1_3.txt WA 2 ms 256 KB
subtask_1_4.txt WA 1 ms 256 KB
subtask_1_5.txt AC 1 ms 256 KB
subtask_1_6.txt WA 1 ms 256 KB
subtask_1_7.txt WA 1 ms 256 KB
subtask_1_8.txt WA 2 ms 256 KB
subtask_1_9.txt AC 1 ms 256 KB