Monikulmio

input/code.cpp: In function 'void c(size_t, size_t, size_t, size_t)':
input/code.cpp:10:35: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   10 |     for(int i = min(x, lx) + 1; i != max(x, lx); ++i)
      |                                 ~~^~~~~~~~~~~~~
input/code.cpp:20:37: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   20 |       for(int i = min(y, ly) + 1; i != max(y, ly); ++i)
      |                                   ~~^~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:62:19: warning: comparison of integer expressions of different signedness: 'int' and 'size_t' {aka 'long unsigned int'} [-Wsign-compare]
   62 |   for(int i {}; i < k; ++i)
      |                 ~~^~~
input/code.cpp:72:12: warning: comparison of integer expressions of different signedness: 'int' and 'size_t' {aka 'long unsigned int'} [-Wsign-c...

#include <bits/stdc++.h>
using namespace std;
vector<vector<char>> t;
vector<vector<int>> q;
size_t n, m, k;
void c(size_t x, size_t lx, size_t y, size_t ly)
{
  if(y == ly)
  {
    for(int i = min(x, lx) + 1; i != max(x, lx); ++i)
    t[i][y] = '=';
  }
  else
  {
    if(ly > y)
      ++q[lx][ly];
    else ++q[x][y];
    if(x == lx)
    {
      for(int i = min(y, ly) + 1; i != max(y, ly); ++i)
      {
        ++q[x][i];
        t[x][i] = '|';
      }
    }
    else
    {
      for(int o = 1; min(lx, x) + o != max(lx, x); ++o)
      {
        if(x > lx && y > ly)
        {
          t[x - o][y - o] = '\\';
          ++q[x - o][y - o];
        }
        else if(x < lx && y < ly)
        {
          t[x + o][y + o] = '\\';
          ++q[x + o][y + o];
        }
        else if(x < lx && y > ly)
        {
          t[x + o][y - o] = '/';
          ++q[x + o][y - o];
        }
        else
        {
          t[x - o][y + o] = '/';
          ++q[x - o][y + o];
        }
      }
    }
  }
}
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n >> m >> k;
  t = vector<vector<char>>(m, vector<char>(n, '.'));
  q = vector<vector<int>>(m, vector<int>(n, 0));
  size_t lx {}, ly {}, fx {}, fy {};
  for(int i {}; i < k; ++i)
  {
    size_t x, y;
    cin >> y >> x;
    --x;
    --y;
    t[x][y] = '*';
    if(i)
    {
      c(x, lx, y, ly);
      if(i == k - 1) c(fx, x, fy, y);
    }
    else
    {
      fx = x;
      fy = y;
    }
    lx = x;
    ly = y;
  }
  int f {};
  for(size_t j {}; j < n; ++j)
  {
    int c {};
    for(size_t i {}; i < m; ++i)
    {
      if(t[i][j] == '.')
        cout << (((c & 1) == 0) ? '.' : '#');
      else
      {
        c += q[i][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