Submission #10344563


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

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

  vector<vector<int>> A(H+2, vector<int>(W+2, 0));

  for(int i=0; i<H; i++){
    for(int j=0; j<W; j++){
      if(S[i][j]=='#'){
        int i_=i+1;
        int j_=j+1;
        A[i_-1][j_-1]++;
        A[i_-1][j_]++;
        A[i_-1][j_+1]++;
        A[i_][j_-1]++;
        A[i_][j_]=-9999;
        A[i_][j_+1]++;
        A[i_+1][j_-1]++;
        A[i_+1][j_]++;
        A[i_+1][j_+1]++;
      }
    }
  }

  vector<string> Ans(H);
  for(int i=1; i<=H; i++){
    for(int j=1; j<=W; j++){
      if(A[i][j]<0){
        int i_=i-1;
        int j_=j-1;
        Ans[i_]+='#';
      }else{
        int i_=i-1;
        int x=A[i][j];
        if(x==0)  Ans[i_]+='0';
        else if(x==1)  Ans[i_]+='1';
        else if(x==2)  Ans[i_]+='2';
        else if(x==3)  Ans[i_]+='3';
        else if(x==4)  Ans[i_]+='4';
        else if(x==5)  Ans[i_]+='5';
        else if(x==6)  Ans[i_]+='6';
        else if(x==7)  Ans[i_]+='7';
        else Ans[i_]+='8';
      }
    }
  }

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

  return 0;
}

Submission Info

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