Monikulmio

input/code.cpp: In function 'int main()':
input/code.cpp:116:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |         for (ll j = 0; j < v.size(); j += 2) {
      |                        ~~^~~~~~~~~~

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

#define fastio               \
    ios::sync_with_stdio(0); \
    cin.tie(0);              \
    cout.tie(0);
#define ll long long
#define pb push_back
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x).size()

const int MOD = 1e9 + 7;
const ll INF = 1e18;

int main() {

    int n, m, k;
    cin >> n >> m >> k;
    int q = k - 1;

    vector<vector<char> > matrix(n, vector<char>(m, '.'));

    vector<pair<int, int> > points;

    ll a, b;
    cin >> a >> b;

    points.pb(make_pair(a, b));
    matrix[a - 1][b - 1] = '*';

    while (q--) 
    {
        int a, b;
        cin >> a >> b;
        matrix[a - 1][b - 1] = '*';
        points.pb(make_pair(a, b));
    }
    
    points.pb(make_pair(a, b));
    
    
    for (int i = 1; i <= k; i++) {
        int y1 = points[i-1].first;
        int x1 = points[i-1].second;
        int y2 = points[i].first;
        int x2 = points[i].second;

        if (y2 == y1) {
            int s = min(x2, x1);
            int b = max(x2, x1);
            for (int j = s; j < b-1; j++) {
                matrix[y2 - 1][j] = '=';
            }
        }

        if (x2 == x1) {
            int s = min(y2, y1);
            int b = max(y2, y1);
            for (int j = s; j < b - 1; j++)
            {
                matrix[j][x2 - 1] = '|';
            }
        }

        if ((y2 - y1) * (x2 - x1) != 0)
        {                           
            ll steps = abs(x2 - x1) - 1; 

            ll x = x1 - 1;
            ll y = y1 - 1;

            ll step_x, step_y;

            if (x2 > x1) {
                step_x = 1;
            }
            else {
                step_x = -1;
            }
            if (y2 > y1) {
                step_y = 1;
            }
            else {
                step_y = -1;
            }

            for (ll j = 0; j < steps; j++)
            { 
                x += step_x;
                y += step_y;

                if ((step_x > 0 && step_y > 0) || (step_x < 0 && step_y < 0)) {
                    matrix[y][x] = '\\';
                }
                else {
                    matrix[y][x] = '/';
                }
            }
        }
}

    for (ll i = 0; i < n; i++) {
        vector<ll>v;
        for (ll j = 0; j < m; j++) {
            if (matrix[i][j] != '.') {
                v.pb(j);
            }
        }

        if (v.size() > 1) {
            if (v.size() % 2 == 1) {
                v.pop_back();
            }
        
        for (ll j = 0; j < v.size(); j += 2) {
            ll l = v[j];
            ll r = v[j+1]; // possible out of bounds
                
            for (ll k = l + 1; k < r; k++) {
                matrix[i][k] = '#';
            }
        }
        }
    }

for (ll i = 0; i < n; i++) {
    for (ll j = 0; j < m; j++)
    {
        cout << matrix[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