Submission #1346848

#TimeUsernameProblemLanguageResultExecution timeMemory
1346848novruzovMinesweeper (COCI25_minesweeper)C++20
50 / 50
15 ms1932 KiB
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define yes "Yes"
#define no "No"
#define pp pop_back
using namespace std;
int mat[505][505];
void solve() {
    int n,m,k;
    cin>>n>>m>>k;
    for (int i=0;i<k;i++){
        int r,s;
        cin>>r>>s;
        mat[r][s]=-1e4;
        if (r-1>0 && s-1>0){
            mat[r-1][s-1]++;
        }
        if (r-1>0 && s+1<=m){
           mat[r-1][s+1]++;
        }
        if (r+1<=n && s-1>0){
            mat[r+1][s-1]++;
        }
        if (r+1>0 && s+1<=m){
            mat[r+1][s+1]++;
        }
        if (s-1>0){
            mat[r][s-1]++;
        }
        if (s+1<=m) mat[r][s+1]++;
        if (r-1>0) mat[r-1][s]++;
        if (r+1<=n) mat[r+1][s]++;
    }
    for (int i=1;i<=n;i++){
        for (int j=1;j<=m;j++){
            if (mat[i][j]<0){
                cout<<"B ";
            }
            else cout<<mat[i][j]<<" ";
        }
        cout<<"\n";
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...