Monikulmio

#include <iostream>
#include <vector>
#include <string>

using namespace std;

void print(vector<vector<int>>& arr, int n, int m){
    vector<char> convert={'.', '*', '=', '|', '/', char(92), char(35)};
    for (int i=4;i<=4*n;i+=4){
        for (int j=4;j<=4*m;j+=4){
            cout<<convert[arr[i][j]];
        }
        cout<<"\n";
    }
}

void drawLine(vector<vector<int>>& arr, int x1, int y1, int x2, int y2){
    int x=x1;
    int y=y1;
    if (x2-x1>0 && y2-y1>0){
        while(x<x2){
            x++;
            y++;
            arr[y][x]=5;
        }
    }
    if (x2-x1>0 && y2-y1<0){
        while(x<x2){
            x++;
            y--;
            arr[y][x]=4;
        }
    }
    if (x2-x1<0 && y2-y1>0){
        while(x>x2){
            x--;
            y++;
            arr[y][x]=4;
        }
    }
    if (x2-x1<0 && y2-y1<0){
        while(x>x2){
            x--;
            y--;
            arr[y][x]=5;
        }
    }
    if (x2-x1<0 && y2-y1==0){
        while(x>x2){
            x--;
            arr[y][x]=2;
        }
    }
    if (x2-x1>0 && y2-y1==0){
        while(x<x2){
            x++;
            arr[y][x]=2;
        }
    }
    if (x2-x1==0 && y2-y1<0){
        while(y>y2){
            y--;
            arr[y][x]=3;
        }
    }
    if (x2-x1==0 && y2-y1>0){
        while(y<y2){
            y++;
            arr[y][x]=3;
        }
    }
    arr[y][x]=1;
}

std::vector<int> findInsidePoint(vector<vector<int>>& arr, int n, int m){
    for (int i=1;i<=4*n;i++){
        for (int j=1;j<4*n;j++){
            if (arr[i][j]>1 && arr[i][j+1]==0 && arr[i][j+2]==0){
                return {i, j+1};
            }
            if (arr[i][j]>1){
                break;
            }
        }
    }
    return {-1, -1};
}

void recursiveFill(vector<vector<int>>& arr, int n, int m, int x, int y){
    if (arr[y][x]!=0){
        return;
    }
    arr[y][x]=6;
    if (x-1>=0){
        recursiveFill(arr, n, m, x-1, y);
    }
    if (x+1<=4*m){
        recursiveFill(arr, n, m, x+1, y);
    }
    if (y-1>=0){
        recursiveFill(arr, n, m, x, y-1);
    }
    if (y+1<=4*n){
        recursiveFill(arr, n, m, x, y+1);
    }
}

void fill2Drawing(vector<vector<int>>& arr, int n, int m){
    std::vector<int> P=findInsidePoint(arr, n, m);
    recursiveFill(arr, n, m, P[1], P[0]);
}

void calcInfo(vector<vector<vector<int>>>& info, vector<vector<int>>& coords){
    int k=coords.size();
    for (int i=0;i<k;i++){
        int x1=coords[i][0];
        int y1=coords[i][1];
        info[y1][x1][0]=i;
        int y2=coords[(i+1)%k][1];
        if (y2-y1>0){
            info[y1][x1][1]=1;
        }
        if (y2-y1==0){
            info[y1][x1][1]=2;
        }
        if (y2-y1<0){
            info[y1][x1][1]=3;
        }
    }
}

int main(){
    int m;
    int n;
    int k;
    cin>>n>>m>>k;
    vector<vector<int>> arr(4*n+2, vector<int>(4*m+2, 0));
    vector<vector<int>> coords;
    int x1;
    int y1;
    int x2;
    int y2;
    int x;
    int y;
    cin>>y1>>x1;
    x1*=4;
    y1*=4;
    coords.push_back({x1,y1});
    x=x1;
    y=y1;
    int OrigX=x;
    int OrigY=y;
    arr[y][x]=1;
    for (int f=1;f<k;f++){
        cin>>y2>>x2;
        x2*=4;
        y2*=4;
        coords.push_back({x2,y2});
        drawLine(arr, x1, y1, x2, y2);
        
        x1=x2;
        y1=y2;
    }
    
    drawLine(arr, x1, y1, OrigX, OrigY);
    fill2Drawing(arr, n, m);
    print(arr, n, m);

    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