Monikulmio

input/code.cpp: In function 'int main()':
input/code.cpp:93:17: warning: unused variable 'endY' [-Wunused-variable]
   93 |             int endY=max(y,firstY);
      |                 ^~~~

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

int main(void){
    int n,m,k; //n = korkeus; m = leveys; k = kärkien lukumäärä
    cin >> n >> m >> k;
    vector<vector<char>> arr(n,vector<char>(m,'.')); 
    int x,y,firstX,firstY,prevX,prevY;
    cin >> firstY >> firstX;
    arr[firstY-1][firstX-1]='*';
    prevX=firstX;
    prevY=firstY;
    //iterate over the points
    for(int i=0; i<k-1;i++){
        cin >> y >> x;
        arr[y-1][x-1]='*';
        //point straight to the side
        if(prevY==y){
            int start = min(x,prevX);
            int end = max(x,prevX)-1;
            for(int j=start;j<end;j++){
                arr[y-1][j] = '=';
            }
        }
        //point straight down
        else if(prevX==x){
            int start = min(y,prevY);
            int end = max(y,prevY)-1;
            for(int j=start;j<end;j++){
                arr[j][x-1] = '|';
            }

        }

    
        //rising diagonal
        else if ((prevY > y && prevX < x) || (y > prevY && x < prevX)) {
            int startX = min(x, prevX);
            int endX = max(x, prevX);
            int startY = max(y, prevY) - 1; 
            for (int j = 1; j < endX - startX; j++) {
            arr[startY - j ][startX + j - 1] = '/';
            }
        }
        //falling diagonal
       else {
        int startX = min(x, prevX);
        int endX = max(x, prevX);
        int startY = min(y, prevY); 
        for (int j = 1; j < endX - startX; j++) {
        arr[startY + j - 1][startX + j - 1] = '\\';
    }
}


        //set previous x and y
        prevX = x;
        prevY = y;
    }
    //connect first and last point
    //point straight to the side
        if(firstY==y){
            int start = min(x,firstX);
            int end = max(x,firstX)-1;
            for(int j=start;j<end;j++){
                arr[y-1][j] = '=';
            }
        }
        //point straight down //**CHECK IF WORKS STRAIGHT UP**
        else if(firstX==x){
            int start = min(y,firstY);
            int end = max(y,firstY)-1;
            for(int j=start;j<end;j++){
                arr[j][x-1] = '|';
            }

        }

    
        //rising diagonal
        else if((firstY > y && firstX < x) || (y > firstY && x < firstX)){
        int startX = min(x, firstX);
        int startY = max(y, firstY) - 1; 
        int endX = max(x, firstX);
        for (int j = 1; j < endX - startX; j++) {
        arr[startY - j ][startX + j - 1] = '/';
    }
}
        else {
            int startX=min(x,firstX);
            int startY=min(y,firstY);
            int endX=max(x,firstX)-1;
            int endY=max(y,firstY);
            for(int j=0; j<endX-startX;j++){
                arr[startY+j][startX+j]='\\'; 
            }
        }
    //fill the array

    //print the array
    for(int i=0; i<n;i++){
        for(int j=0;j<m;j++){
            cout << arr[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