Submission #854275

---

Source Code Expand

#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <climits>
#include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <vector>
#include <sstream>
#include <typeinfo>
#include <fstream>

#define DIV 1000000007

using namespace std;

long long N;
string S[800];
bool ban[800][800];



int main(){
	cin >> N;
	for(int i = 0; i < N; i++){
		cin >> S[i];
	}

	for(int y = 0; y < N - 1; y++){
		for(int x = 0; x < N; x++){
			bool now, r1, r2, r3;
			if(S[y][x] == '#'){
				now = true;
			}else{
				now = false;
			}
			if(y - 1 >= 0){
				now^=ban[y-1][x];
				//if(S[y-1][x] == '#'){
				//	now ^= true;
				//}else{
				//	now ^= false;
				//}
			}
			if(x - 1 >= 0){
				now^=ban[y][x-1];
				//if(S[y][x-1] == '#'){
				//	now ^= true;
				//}else{
				//	now ^= false;
				//}
			}
			if(x + 1 < N){
				now^=ban[y][x+1];
				//if(S[y][x+1] == '#'){
				//	now ^= true;
				//}else{
				//	now ^= false;
				//}
			}
			ban[y+1][x] = now;
		}
	}
	for(int y = 0; y < N; y++){
		for(int x = 0; x < N; x++){
			if(ban[y][x]){
				cout << '#';
			}else{
				cout << '.';
			}
		}
		cout << endl;
	}





}

Submission Info

Judge Result