Monikulmio

#include <iostream>
#include <vector>

using namespace std;

int main() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<char>> t(n, vector<char> (m, '.'));
    vector<vector<int>> ind(n, vector<int> (m, 0));
    vector<pair<int, int>> points;
    for (int i = 0; i < k; i++) {
        int y, x;
        cin >> y >> x;
        y--; x--;
        t[y][x] = '*';
        ind[y][x] = i + 1;
        points.push_back({y, x});
    }
    points.push_back(points[0]);
    for (int i = 1; i <= k; i++) {
        int y0 = points[i - 1].first;
        int x0 = points[i - 1].second;
        int y1 = points[i].first;
        int x1 = points[i].second;
        if (y1 == y0) {
            for (int j = min(x0, x1) + 1; j < max(x0, x1); j++) {
                t[y0][j] = '=';
            }
        } else if (x1 == x0) {
            for (int j = min(y0, y1) + 1; j < max(y0, y1); j++) {
                t[j][x0] = '|';
            }
        } else if (y0 > y1 && x0 < x1) {
            int dif = y0 - y1;
            for (int j = 1; j < dif; j++) {
                t[y0 - j][x0 + j] = '/';
            }
        } else if (y0 > y1 && x0 > x1) {
            int dif = y0 - y1;
            for (int j = 1; j < dif; j++) {
                t[y0 - j][x0 - j] = '\\';
            }
        } else if (y0 < y1 && x0 < x1) {
            int dif = y1 - y0;
            for (int j = 1; j < dif; j++) {
                t[y0 + j][x0 + j] = '\\';
            }
        } else if (y0 < y1 && x0 > x1) {
            int dif = y1 - y0;
            for (int j = 1; j < dif; j++) {
                t[y0 + j][x0 - j] = '/';
            }
        }
    }
    vector<vector<int>> tmp(n, vector<int> (m, 0));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (t[i][j] != '.' && t[i][j] != '*' && t[i][j] != '=') {
                tmp[i][j] = 1;
            } else if (t[i][j] == '*') {
                if (i - 1 < 0) continue;
                if (j - 1 >= 0 && (t[i - 1][j - 1] == '\\' || t[i - 1][j - 1] == '*')) {
                    int ts = abs(ind[i - 1][j - 1] - ind[i][j]);
                    if (t[i - 1][j - 1] == '\\') {
                        tmp[i][j]++;
                        continue;
                    }
                    if (t[i - 1][j - 1] == '*' && ts != 1 && ts != k - 1) continue;
                    tmp[i][j]++;
                }
                if (t[i - 1][j] == '|' || t[i - 1][j] == '*') {
                    int ts = abs(ind[i - 1][j] - ind[i][j]);
                    if (t[i - 1][j] == '|') {
                        tmp[i][j]++;
                        continue;
                    }
                    if (t[i - 1][j] == '*' && ts != 1 && ts != k - 1) continue;
                    tmp[i][j]++;
                }
                if (j + 1 < m && (t[i - 1][j + 1] == '/' || t[i - 1][j + 1] == '*')) {
                    int ts = abs(ind[i - 1][j + 1] - ind[i][j]);
                    if (t[i - 1][j + 1] == '/') {
                        tmp[i][j]++;
                        continue;
                    }
                    if (t[i - 1][j + 1] == '*' && ts != 1 && ts != k - 1) continue;
                    tmp[i][j]++;
                }
            }
        }
    }
    for (int i = 0; i < n; i++) {
        int cnt = 0;
        for (int j = 0; j < m; j++) {
            cnt += tmp[i][j];
            if (t[i][j] == '.' && cnt % 2 == 1 && cnt != 0) {
                t[i][j] = '#';
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cout << t[i][j];
        }
        cout << '\n';
    }
}

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