Monikulmio

#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
#define all(v) begin(v), end(v)
 
 
char g[102][102];
 
#define Y imag()
#define X real()

using pt = complex<int>;
int cross(pt a, pt b) {
    return (conj(a)*b).Y;
}
int sgn(int x) {
    if (x>0) return 1;
    if (x<0) return -1;
    return 0;
}

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<array<int, 2>> pts(k);
    for (int i=0; i<k; i++) {
        int y, x;
        cin >> y >> x;
        pts[i] = {y, x};
    }
    pts.push_back(pts[0]);
    memset(g, '.', sizeof g);
    for (int i=0; i<k; i++) {
        auto [ay, ax] = pts[i];
        auto [by, bx] = pts[i+1];
        if (ay>by || (ay==by && ax>bx)) {
            swap(ay, by);
            swap(ax, bx);
        }
 
        if (ay==by) {
            for (int j=ax; j<=bx; j++) g[ay][j] = '=';
        } else if (ax==bx) {
            for (int j=ay; j<=by; j++) g[j][ax] = '|';
        } else {
            if (ax<bx) {
                for (int j=ax; j<=bx; j++) g[ay+j-ax][j] = '\\';
            } else {
                for (int j=bx; j<=ax; j++) g[ay+ax-j][j] = '/';
            }
        }
    }
    for (int i=1; i<=n; i++) {
        for (int j=1; j<=m; j++) if (g[i][j]=='.') {
            pt a = {i, j};
            pt b = {i+m*n, j+m*n+1};
            int cnt = 0;
            for (int z=0; z<k; z++) {
                pt c = {pts[z][0], pts[z][1]};
                pt d = {pts[z+1][0], pts[z+1][1]};
                if (sgn(cross(c-a, c-b)) != sgn(cross(d-a, d-b)) && sgn(cross(a-c, a-d)) != sgn(cross(b-c, b-d))) {
                    cnt++;
                }
            }
            if (cnt%2) g[i][j] = '#';
        }
    }

    for (auto [x, y]: pts) g[x][y] = '*';

    for (int i=1; i<=n; i++) {
        for (int j=1; j<=m; j++) {
            cout << g[i][j];
        }
        cout << '\n';
    }
}
 
 
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int tc=1;
    // cin >> tc;
    while (tc--) solve();
}

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