Submission #867587

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <set>
#include <iomanip>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <bitset>
#include <list>

#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define sqr(x) ((x)*(x))
#define bitcnt(x) __builtin_popcountll(x)
#define rt return


typedef unsigned long long ull;
typedef unsigned int uint;
typedef long long ll;
typedef long double ld;

using namespace std;


const int INF = (int)1e9 + 37;
const ld PI = acos(-1.0);
const int MAXN = (int)300 + 222;
const ll MOD = (ll)1e6 + 3;
const int MAXQ = (int)1e5 + 222;
const char PURPLE = '#';
const int dx[4] = { 0, 0, 1, -1 };
const int dy[4] = { -1, 1, 0, 0 };

char a[MAXN][MAXN], ans1[MAXN][MAXN], ans2[MAXN][MAXN];
bool used[MAXN][MAXN];

int n, m;

bool can(int x, int y) {
	return (x >= 0 && x < n && y >= 0 && y < m);
}

void dfs(int x, int y) {
	used[x][y] = 1;
	ans2[x][y] = PURPLE;
	for (int i = 0; i < 4; i++) {
		int nx = x + dx[i], ny = y + dy[i];
		if (can(nx, ny) && !used[nx][ny] && (ans1[nx][ny] != PURPLE || a[nx][ny] == PURPLE)) {
			dfs(nx, ny);
		}
	}
}

int main() {
	//freopen("input.txt", "rt", stdin);
	//freopen("output.txt", "wt", stdout);

	cin >> n >> m;
	vector <pair <int, int> > purple;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> a[i][j];
			if (a[i][j] == PURPLE) {
				purple.pb(mp(i, j));
			}
			ans2[i][j] = a[i][j];
			if (i == 0 || j == 0 || i == n - 1 || j == m - 1 || a[i][j] == PURPLE) {
				ans1[i][j] = PURPLE;
			}
			else {
				ans1[i][j] = '.';
			}
		}
	}
	
	for (pair <int, int> tmp : purple) {
		pair <int, int> curmin = mp(INF, INF);
		curmin = min(curmin, mp(tmp.X, 1));
		curmin = min(curmin, mp(n - tmp.X, 2));
		curmin = min(curmin, mp(tmp.Y, 3));
		curmin = min(curmin, mp(m - tmp.Y, 4));
		int dir = curmin.Y;
		if (dir == 1) {
			for (int i = 0; i < curmin.X; i++) {
				ans1[i][tmp.Y] = PURPLE;
			}
		}
		else if (dir == 2) {
			for (int i = tmp.X; i < n; i++) {
				ans1[i][tmp.Y] = PURPLE;
			}
		}
		else if (dir == 3) {
			for (int i = 0; i < curmin.X; i++) {
				ans1[tmp.X][i] = PURPLE;
			}
		}
		else {
			for (int i = tmp.Y; i < m; i++) {
				ans1[tmp.X][i] = PURPLE;
			}
		}
	}
	
	for (pair <int, int> tmp : purple) {
		if (!used[tmp.X][tmp.Y]) {
			dfs(tmp.X, tmp.Y);
		}
	}

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << ans1[i][j];
		}
		cout << endl;
	}
	
	cout << endl;

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << ans2[i][j];
		}
		cout << endl;
	}

    
	rt 0;
}

Submission Info

Judge Result