Submission #1818689

---

Source Code Expand

#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=LLONG_MAX;
const int inf=INT_MAX;
const int nmax=1e5+5;
const int mod=1e9+7;
using namespace std;
int n,m,i,j;
char a[501][501],b[501][501],c;
int main()
{
    //freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>m;
	for(i=1;i<=n;i++)for(j=1;j<=m;j++)a[i][j]=b[i][j]='*';
	for(i=1;i<=n;i++)a[i][1]=b[i][m]='#';
	for(i=1;i<=n;i++)
	 for(j=2;j<m;j++)
	  if(i&1)a[i][j]='#';
	  else b[i][j]='#';
	for(i=1;i<=n;i++)
	 for(j=1;j<=m;j++)
	 {
	 	cin>>c;
	 	if(c=='#')a[i][j]=b[i][j]='#';
	 }
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=m;j++)cout<<a[i][j];
		cout<<endl;
	}
	cout<<endl;
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=m;j++)cout<<b[i][j];
		cout<<endl;
	}
	return 0;
}

Submission Info

Judge Result