Monikulmio

input/code.cpp: In function 'int main()':
input/code.cpp:137:67: warning: 'previousTurn' may be used uninitialized in this function [-Wmaybe-uninitialized]
  137 |           if ((previousTurn < 4 && nextTurn > 4) || (previousTurn > 4 && nextTurn < 4)) {
      |                                                      ~~~~~~~~~~~~~^~~

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

struct Vertex {
  int posY, posX;
  int dir1, dir2; // [0, 7]; counterclockwise from 'right'

  Vertex(int y, int x) {
    posY = y;
    posX = x;
  }

  void setDir1(int d1) {
    dir1 = d1;
  }

  void setDir2(int d2) {
    dir2 = d2;
  }

  bool isVerticalSeparator() {
    if (dir1 == 0 || dir2 == 0 || dir1 == 4 || dir2 == 4) return false;
    return (dir1 < 4 && dir2 > 4) || (dir1 > 4 && dir2 < 4);
  }

  bool hasHorizontal() {
    return dir1 == 0 || dir2 == 0 || dir1 == 4 || dir2 == 4;
  }
};

char art[100][100];
Vertex* vertices[100][100];

void connect(int aY, int aX, int bY, int bX) {
  if (vertices[aY][aX] == nullptr) {
    vertices[aY][aX] = new Vertex(aY, aX);
  }
  if (vertices[bY][bX] == nullptr) {
    vertices[bY][bX] = new Vertex(bY, bX);
  }
  if (aY == bY) {
    int left = min(aX, bX);
    for (int i = 1; i < abs(aX - bX); i++) {
      art[bY][left + i] = '=';
    }
    vertices[aY][aX]->setDir2(0);
    vertices[bY][bX]->setDir1(0);
  } else if (aX == bX) {
    int top = min(aY, bY);
    for (int i = 1; i < abs(aY - bY); i++) {
      art[top + i][bX] = '|';
    }
    if (aY < bY) {
      vertices[aY][aX]->setDir2(6);
      vertices[bY][bX]->setDir1(2);
    } else {
      vertices[aY][aX]->setDir2(2);
      vertices[bY][bX]->setDir1(6);
    }

  } else {
    int left;
    int vert1;
    int vert2;
    if (aX < bX) {
      left = aX;
      vert1 = aY;
      vert2 = bY;
    } else {
      left = bX;
      vert1 = bY;
      vert2 = aY;
    }
    if (vert1 > vert2) {
      for (int i = 1; i < abs(aX - bX); i++) {
        art[vert1 - i][left + i] = '/';
      }
      if (aX < bX) {
        vertices[aY][aX]->setDir2(1);
        vertices[bY][bX]->setDir1(5);
      } else {
        vertices[aY][aX]->setDir2(5);
        vertices[bY][bX]->setDir1(1);
      }
    } else {
      for (int i = 1; i < abs(aX - bX); i++) {
        art[vert1 + i][left + i] = '\\';
      }
      if (aX < bX) {
        vertices[aY][aX]->setDir2(7);
        vertices[bY][bX]->setDir1(3);
      } else {
        vertices[aY][aX]->setDir2(3);
        vertices[bY][bX]->setDir1(7);
      }
    }
  }
}

int main() {
  int n, m, k;
  cin >> n >> m >> k;
  int previous[2] = {-1, -1};
  int first[2] = {-1, -1};
  for (int _ = 0; _ < k; _++) {
    int y, x;
    cin >> y >> x;
    --y;
    --x;
    art[y][x] = '*';
    if (first[0] == -1) {
      first[0] = y;
      first[1] = x;
    }
    if (previous[0] != -1) {
      connect(previous[0], previous[1], y, x);
    }
    previous[0] = y;
    previous[1] = x;
  }
  connect(previous[0], previous[1], first[0], first[1]);

  for (int i = 0; i < n; i++) {
    bool inside = false;
    bool maybe = false;
    int previousTurn;
    for (int j = 0; j < m; j++) {
      if (art[i][j] == '=') continue;
      if (art[i][j] == '|' || art[i][j] == '/' || art[i][j] == '\\') {
        inside = !inside;
      } else if (art[i][j] == '*') {
        if (vertices[i][j]->isVerticalSeparator()) {
          inside = !inside;
        } else if (maybe && (vertices[i][j]->dir1 != 0 || vertices[i][j]->dir1 != 0)) {
          int nextTurn = (vertices[i][j]->dir1 != 0) ? vertices[i][j]->dir1 : vertices[i][j]->dir2;
          if (nextTurn == 0) continue;
          if ((previousTurn < 4 && nextTurn > 4) || (previousTurn > 4 && nextTurn < 4)) {
            inside = !inside;
          }
          maybe = false;
        } else if (vertices[i][j]->hasHorizontal()) {
          maybe = true;
          previousTurn = (vertices[i][j]->dir1 != 0) ? vertices[i][j]->dir1 : vertices[i][j]->dir2;
        }
      } else {
        art[i][j] = inside ? '#' : '.';
      }
    }
  }

  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cout << art[i][j];
    }
    cout << '\n';
  }

  // cout << "finished" << endl;
  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