Submission #1793493


Source Code Expand

#include <iostream>
using namespace std;
int dx[] = {1, 1, 1, 0, 0, -1, -1, -1};
int dy[] = {1, 0, -1, 1, -1, 1, 0, -1};

int main(){
    int h, w;
    cin >> h >> w;
    string a[h];
    for(int i=0; i<h; i++){
        cin >> a[i];
    }
    
    for(int i=0; i<h; i++){
        for(int j=0; j<w; j++){
            if(a[i][j] == '.'){
                a[i][j] = '0';
                for(int k=0; k<8; k++){
                    int nx = j+dx[k], ny = i+dy[k];
                    if(0<=nx && nx<w && 0<=ny && ny<h && a[ny][nx] =='#'){
                        a[i][j]++;
                    }
                }
            }
        }
    }

    for(int i=0; i<h; i++){
        for(int j=0; j<w; j++){
            cout << a[i][j];
        }
        cout << "\n";
    }
    return 0;
}

Submission Info

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