Monikulmio

input/code.cpp: In function 'void setIO(std::string)':
input/code.cpp:6:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 |                 freopen((name+".in").c_str(), "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:7:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |                 freopen((name+".out").c_str(), "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include<bits/stdc++.h>
using namespace std;

void setIO(string name="") {
	if(name.length()) {
		freopen((name+".in").c_str(), "r", stdin);
		freopen((name+".out").c_str(), "w", stdout);
	}
}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define ll long long
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << (x) << "\n"
#define ar array
#define fi first
#define se second

const int mxN=101;
int n, m, c;
char grid[mxN][mxN];

void dfs(int i, int j) {
	if(i>n || i<1 || j>m || j<0 || grid[i][j]!='#') return;
	grid[i][j]='.';
	dfs(i-1, j);
	dfs(i+1, j);
	dfs(i, j-1);
	dfs(i, j+1);
}

void solve() {
	cin >> n >> m >> c;
	for(int i=1; i<=n; i++) {
		for(int j=1; j<=m; j++) {
			grid[i][j]='#';
		}
	}
	vector<ar<int, 2>> corners(c);
	for(int i=0; i<c; i++) {
		cin >> corners[i][0] >> corners[i][1];
		grid[corners[i][0]][corners[i][1]]='*';
	}
	for(int k=0; k<c; k++) {
		int a = k-1;
		int b = k;
		if(k==0) a = c-1;
		if(corners[a][1]==corners[b][1]) {
			for(int i=min(corners[a][0], corners[b][0])+1; i<max(corners[a][0], corners[b][0]); i++) {
				grid[i][corners[a][1]]='|';
			}
		}
		if(corners[a][0]==corners[b][0]) {
			for(int i=min(corners[a][1], corners[b][1])+1; i<max(corners[b][1], corners[a][1]); i++) {
				grid[corners[a][0]][i]='=';
			}
		}
		if(corners[a][0]!=corners[b][0] && corners[a][1]!=corners[b][1]) {
			if(corners[a][1]>corners[b][1]) swap(a, b);
			if(corners[a][0] > corners[b][0]) {
				for(int i=1; i<=abs(corners[b][1]-corners[a][1])-1; i++) {
					grid[corners[a][0]-i][corners[a][1]+i]='/';
				}
			} else {
				for(int i=1; i<=corners[b][1]-corners[a][1]-1; i++) {
					grid[corners[a][0]+i][corners[a][1]+i]='\\';
				}
			}
		}
	}
	for(int i=1; i<=m; i++) {
		if(grid[1][i]=='#') dfs(1, i);
		if(grid[n][i]=='#') dfs(n, i);
	}
	for(int i=1; i<=n; i++) {
		if(grid[i][1]=='#') dfs(i, 1);
		if(grid[i][m]=='#') dfs(i, m);
	}
	for(int i=1; i<=n; i++) {
		for(int j=1; j<=m; j++) {
			cout << grid[i][j];
		}
		cout << "\n";
	}
}

int main() {
	cin.tie(0) -> sync_with_stdio(0);
	//setIO("sleepy");
	int T=1;
	//cin >> T;
	while(T--)
		solve();
	return 0;
}

Test 1 (public)

Verdict: ACCEPTED

Test 2 (public)

Verdict: ACCEPTED

Test 3 (public)

Verdict: ACCEPTED

Test 4 (public)

Verdict: ACCEPTED

Test 5 (public)

Verdict: ACCEPTED

Test 6 (public)

Verdict: ACCEPTED

Test 7 (public)

Verdict: ACCEPTED

Test 8 (public)

Verdict: ACCEPTED

Test 9 (public)

Verdict: ACCEPTED

Test 10 (public)

Verdict: ACCEPTED