Monikulmio

#include <bits/stdc++.h>

using namespace std;

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<char>> v(n, vector<char>(m, '.'));
    vector<pair<int, int>> l(k);
    map<pair<int, int>, int> cnt;

    for (int i = 0; i < k; i++) {
        int x, y;
        cin >> x >> y;
        x--;
        y--;
        l[i].first = x;
        l[i].second = y;
        v[x][y] = '*';
    }
    for (int i = 0; i < k; i++) {
        int next = (i + 1) % k;
        // connect l[i] and l[i + 1]
        if (l[i].first == l[next].first) {
            for (int j = min(l[i].second, l[next].second) + 1; j < max(l[i].second, l[next].second); j++) {
                v[l[i].first][j] = '=';
            }
        } else if (l[i].second == l[next].second) {
            for (int j = min(l[i].first, l[next].first) + 1; j < max(l[i].first, l[next].first); j++) {
                v[j][l[i].second] = '|';
            }
        } else {
            int y = l[i].first;
            int x = l[i].second;
            char sp;
            if (y < l[next].first) {
                if (x < l[next].second) {
                    sp = '\\';
                } else {
                    sp = '/';
                }
            } else {
                if (x < l[next].second) {
                    sp = '/';
                } else {
                    sp = '\\';
                }
            }
            while (abs(x - l[next].second) != 1) {
                if (y < l[next].first) {
                    y++;
                } else {
                    y--;
                }
                if (x < l[next].second) {
                    x++;
                } else {
                    x--;
                }

                v[y][x] = sp;
            }
        }

        if (l[i].first < l[next].first) {
            cnt[l[i]]++;
        } else if (l[i].first > l[next].first) {
            cnt[l[next]]++;
        }
    }

    // fill
    for (int i = 0; i < n; i++) {
        bool in = false;
        for (int j = 0; j < m; j++) {
            if (v[i][j] == '.') {
                if (in) {
                    v[i][j] = '#';
                }
            } else if (v[i][j] == '*') {
                if (cnt[{i, j}] == 1) {
                    in = !in;
                }
            } else if (v[i][j] != '=') {
                in = !in;
            }
        }
    }

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

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    // cout << fixed << setprecision(6) << endl;

    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