Monikulmio

#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--) // REMEMBER TO ADD THE FIRST AGAIN (TO DO)
    {
        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 t = abs(y2 - y1) - 1;
            ll y_min = min(y2, y1) + 1;
            ll x_min = min(x2, x1) + 1;

            for (ll j = 0; j < t; j++) {
                matrix[y_min][x_min] = '\\';
                y_min--;
                x_min--;

            }
        }

        if (((y2 - y1) / (x2 - x1)) < 0) {
            ll t = abs(y2 - y1) - 1;
            ll y_min = min(y2, y1) - 0;
            ll x_max = max(x2, x1) - 2;

            for (ll j = 0; j < t; j++) {
                matrix[y_min][x_max] = '/';
                y_min++;
                x_max--;
            }
        }

    for (ll i = 0; i < n; i++) {
        for (ll j = 0; j < m; j++) {
            cout << matrix[i][j];
        }
        cout << "\n";
    }


}
}

Test 1 (public)

Verdict: RUNTIME ERROR

Test 2 (public)

Verdict: RUNTIME ERROR

Test 3 (public)

Verdict: RUNTIME ERROR

Test 4 (public)

Verdict: RUNTIME ERROR

Test 5 (public)

Verdict: WRONG ANSWER

Test 6 (public)

Verdict: RUNTIME ERROR

Test 7 (public)

Verdict: RUNTIME ERROR

Test 8 (public)

Verdict: WRONG ANSWER

Test 9 (public)

Verdict: RUNTIME ERROR

Test 10 (public)

Verdict: RUNTIME ERROR