Submission #3014481

---

Source Code Expand

#include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>

#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#define debug(x) cerr << #x << ": " << x << '\n'
#define debugArray(x,n) for(long long i = 0; (i) < (n); ++ (i)) cerr << #x << "[" << i << "]: " << x[i] << '\n'

using namespace std;

typedef long long ll;
typedef pair<int,int> Pii;
typedef vector<int> vint;
typedef vector<ll> vll;
const ll INF = LLONG_MAX;
const ll MOD = 998244353;

int main() {
  int H,W;cin >> H >> W;
  vector<vector<string> > ans(2,vector<string>(H,string(W,'.')));
  repeat(i,H){
    repeat(j,W){
      char c;cin >> c;
      if(c=='#'){
        ans[0][i][j] = '#';
        ans[1][i][j] = '#';
      }
    }
  }
  repeat(i,H){
    for(int j=1;j<W-1;j++){
      ans[i&1][i][j] = '#';
    }
  }
  repeat(i,H){
    ans[0][i][0] = '#';
    ans[1][i][W-1] = '#';
  }
  repeat(c,2){
    repeat(i,H){
      cout << ans[c][i] << endl;
    }
    if(c==0) cout << endl;
  }
  return 0;
}

Submission Info

Judge Result