제출 #1337042

#제출 시각아이디문제언어결과실행 시간메모리
1337042joacruMinesweeper (COCI25_minesweeper)C++20
50 / 50
68 ms1684 KiB
#include <iostream>
#include <vector>

#define forn(i,n) for(int i=0;i<(int)n;++i)

using namespace std;

int rv[8] = {-1, -1, -1, 0, +1, +1, +1, 0}, cv[8] = {-1, 0, +1, +1, +1, 0, -1, -1};

int main(){
	
	int n, m, b;
	cin>>n>>m>>b;
	
	vector<vector<int>> grid(n,vector<int>(m));
	
	forn(i,b){
		int r, c;
		cin>>r>>c;
		grid[r-1][c-1] = -1;
	}
	
	forn(i,n){
		forn(j,m){
			if(grid[i][j] == -1) continue;
			forn(k,8){
				int nr = i + rv[k];
				int nc = j + cv[k];
				if(nr>=0&&nr<n&&nc>=0&&nc<m){
					grid[i][j] += grid[nr][nc] == -1;
				}
			}
		}
	}	
	
	forn(i,n){
		forn(j,m){
			if(grid[i][j] == -1) cout<<"B ";
			else cout<<grid[i][j]<<" ";
		}	
		cout<<"\n";
	}
	
	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...