Submission #1511772

---

Source Code Expand

#include <algorithm>
#include <numeric>
#include <cstring>
#include <numeric>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;


char f[505][505];
int c[505][505] = {};
int c2[505][505][3] = {};

lli h, w;

int main()
{
    cin >> h >> w;
    int cnt = 0;
    memset(c, -1, sizeof(c));
    rep(i, h) rep(j, w) cin >> f[i][j];
    rep(i, h) rep(j, w)
    {
        if (i % 2 == 0) {
            c[i][j] = 1;
        } else {
            c[i][j] = 2;
        }
    }
    rep(i, h) rep(j, 2)
    {
        if (j == 0) {
            c[i][0] = 1;
        }
        if (j == 1) {
            c[i][w - 1] = 2;
        }
    }
    for (int col = 1; col < 3; col++) {
        rep(i, h) rep(j, w)
        {
            char hoge = (c[i][j] == col or f[i][j] == '#' ? '#' : '.');
            cout << hoge;
            if (j == w - 1)
                cout << endl;
        }
        puts("");
    }
}

Submission Info

Judge Result