Submission #1358001

---

Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	int H,W;
	cin >> H >> W;
	vector< vector<bool> > R(H,vector<bool>(W,false));
	vector< vector<bool> > B(H,vector<bool>(W,false));
	for(int h=0;h<H;++h){
		for(int w=0;w<W;++w){
			if( w==W-1 || ((h&1) && w!=0) ){
				B[h][w] = true;
			}else{
				R[h][w] = true;
			}
		}
	}
	for(int h=0;h<H;++h){
		string str;
		cin >> str;
		for(int w=0;w<W;++w){
			if( str[w] != '#' ) continue;
			if( w==W-1 || ((h&1) && w!=0) ){
				R[h][w] = true;
			}else{
				B[h][w] = true;
			}
		}
	}
	for(int h=0;h<H;++h){
		for(int w=0;w<W;++w){
			if( R[h][w] ){
				cout << '#';
			}else{
				cout << '.';
			}
		}cout << endl;
	}
	cout << endl;
	for(int h=0;h<H;++h){
		for(int w=0;w<W;++w){
			if( B[h][w] ){
				cout << '#';
			}else{
				cout << '.';
			}
		}cout << endl;
	}
}
#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	
	
	solve();
}
#pragma endregion //main()

Submission Info

Judge Result