Monikulmio

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, m, p, y, x;
    cin >> n >> m >> p;

    vector<vector<int>> points;
    for (int index = 0; index < n; index++) {
        points.push_back({});
        for (int jndex = 0; jndex < m; jndex++) {
            points[index].push_back(0);
        }
    }
    vector<pair<int, int>> lines;
    vector<vector<pair<bool, int>>> crosses;
    for (int index = 0; index < n; index++) {
        crosses.push_back({});
        for (int jndex = 0; jndex < m; jndex++) {
            crosses[index].push_back({false, 0});
        }
    }
    vector<string> grid;
    for (int index = 0; index < p; index++) {
        cin >> y >> x;
        lines.push_back({y-1, x-1});
        points[y-1][x-1] = true;
        points[y-1][x-1] = 1;
    }

    for (int depth = 0; depth < n; depth++) {
        grid.push_back("");
        for (int width = 0; width < m; width++) {
            if (points[depth][width] == 0) grid[depth] += ".";
            else grid[depth] += "*";
        }
    }
    for (int point = 0; point < p; point++) {
        int y = lines[point].first;
        int x = lines[point].second;
        int lastY = lines[point-1].first;
        int lastX = lines[point-1].second;
        int nextY = lines[point+1].first;
        if (point == 0) {
            lastY = lines[p-1].first;
            lastX = lines[p-1].second;
        } else if (point == p-1) {
            nextY = lines[0].first;
        }
        pair<int, int> direction;
        if (y > nextY && y < lastY) crosses[y][x].first = true;
        else if (y < nextY && y > lastY) crosses[y][x].first = true;
        else if (y == nextY && y > lastY) crosses[y][x].second = 1;
        else if (y == nextY && y < lastY) crosses[y][x].second = -1;
        else if (y < nextY && y == lastY) crosses[y][x].second = -1;
        else if (y > nextY && y == lastY) crosses[y][x].second = 1;
        char ascii = '0';
        if (y == lastY && x < lastX) {
            direction = {0, 1};
            ascii = '=';
        }
        else if (y > lastY && x < lastX) {
            direction = {-1, 1};
            ascii = '/';
        }
        else if (x == lastX && y > lastY) {
            direction = {-1, 0};
            ascii = '|';
        }
        else if (y > lastY && x > lastX) {
            direction = {-1, -1};
            ascii = '\\';
        }
        else if (y == lastY && x > lastX) {
            direction = {0, -1};
            ascii = '=';
        }
        else if (y < lastY && x > lastX) {
            direction = {1, -1};
            ascii = '/';
        }
        else if (x == lastX && y < lastY) {
            direction = {1, 0};
            ascii = '|';
        }
        else if (y < lastY && x < lastX) {
            direction = {1, 1};
            ascii = '\\';
        }

        for (int index = 0; index < max(n, m); index++) {
            if (grid[y + direction.first][x + direction.second] == '*') break;
            y += direction.first;
            x += direction.second;
            grid[y][x] = ascii;
        }
    }
    for (int index = 0; index < n; index++) {
        pair<int, int> directions = {10, 10};
        bool add = false;
        for (int x = 0; x < m; x++) {
            if (grid[index][x] == '*') {
                if (crosses[index][x].first == 1 || x == m-1) add = !add;
                else if (grid[index][x+1] == '=') directions.first = crosses[index][x].second;
                else if (grid[index][x-1] == '=') {
                    if (directions.first == -crosses[index][x].second) add = !add;
                    directions = {10, 10};
                }
            } else if (grid[index][x] == '.') {
                if (add) grid[index][x] = '#';
                //grid[index].replace(start.first, x-start.first, x-start.first, '#');
            } else if (grid[index][x] == '|' || grid[index][x] == '/' || grid[index][x] == '\\') {
                add = !add;
            }
        }
    }
    for (int index = 0; index < n; index++) {
        cout << grid[index] << endl; 
    }
}

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