Submission #3234661


Source Code Expand

#include<iostream>
using namespace std;
int main() {
	int H, W;
	cin >> H >> W;

	string board[H];
	for (int i = 0; i < H; i++)
		cin >> board[i];

	int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
	int dy[8] = { 0,1,1,1,0,-1,-1,-1 };

	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			if (board[i][j] == '#')
				continue;
			int sum = 0;
			for (int d = 0; d < 8; d++) {
				int ni = i + dx[d], nj = j + dy[d];
				if (ni < 0 or H <= ni)
					continue;
				if (nj < 0 or W <= nj)
					continue;
				if (board[ni][nj] == '#')
					sum++;
			}
			board[i][j] = char(sum + '0');
		}
	}

	for (int i = 0; i < H; i++)
		cout << board[i] << endl;

	return 0;
}

Submission Info

Submission Time
Task B - Minesweeper
User O1O1
Language C++14 (GCC 5.4.1)
Score 200
Code Size 696 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 15
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