Submission #2225676


Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)

using namespace std;
typedef long long int lli;

int main() {
	int H, W;
	cin >> H >> W;
	string S[50];
	rep(i, H) cin >> S[i];

	rep(i, H) {
		rep(j, W) {
			if (S[i][j] == '#') continue;
			int mine = 0;
			for (int dx = 1;dx >= -1;dx--) {
				for (int dy = 1;dy >= -1;dy--) {
					int nx = i + dx;
					int ny = j + dy;
					if (0 <= nx && nx < H && 0 <= ny && ny < W&&S[nx][ny] == '#') mine++;
				}
			}
			S[i][j] = char(mine + '0');
		}
	}
	rep(i, H) cout << S[i]<<endl;
}

Submission Info

Submission Time
Task B - Minesweeper
User spawn
Language C++14 (GCC 5.4.1)
Score 200
Code Size 681 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