Monikulmio

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

using ll = long long;
#define all(v) begin(v), end(v)


char g[102][102];


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 || 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 (auto [y, x]: pts) g[y][x] = '*';
    queue<array<int, 2>> q;
    q.push({0, 0});
    g[0][0] = '.';
    while (!q.empty()) {
        auto go = [&](int ni, int nj) {
            if (ni<0 || ni>n || nj<0 || nj>m) return;
            if (g[ni][nj] != '#') return;
            g[ni][nj] = '.';
            q.push({ni, nj});
        };
        auto [i, j] = q.front(); q.pop();
        go(i+1, j);
        go(i-1, j);
        go(i, j+1);
        go(i, j-1);
    }
    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: WRONG ANSWER

Test 4 (public)

Verdict: WRONG ANSWER

Test 5 (public)

Verdict: WRONG ANSWER

Test 6 (public)

Verdict: WRONG ANSWER

Test 7 (public)

Verdict: WRONG ANSWER

Test 8 (public)

Verdict: WRONG ANSWER

Test 9 (public)

Verdict: ACCEPTED

Test 10 (public)

Verdict: WRONG ANSWER