Monikulmio

#include <bits/stdc++.h>
using namespace std;
 
const int N=1005;
 
int n,m,k;
int x[N],y[N];
 
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
 
char grid[N][N];
int power[N][N];
 
struct Node{
    int x,y;
};
 
queue<Node>q;
 
void bfs(){
    q.push({0,0});
    while(!q.empty()){
        int xx=q.front().x;
        int yy=q.front().y;
        q.pop();
        for(int i=0;i<4;++i){
            int nx=xx+dx[i];
            int ny=yy+dy[i];
            if(grid[nx][ny]||nx<0||nx>n+1||ny<0||ny>m+1)continue;
            grid[nx][ny]='.';
            q.push({nx,ny});
        }
    }
}
 
int main(){
    cin>>n>>m>>k;
    n*=3;m*=3;
    for(int i=1;i<=k;++i){
        cin>>x[i]>>y[i];
        x[i]*=3;y[i]*=3;
    }
    x[k+1]=x[1];
    y[k+1]=y[1];
    for(int i=1;i<=k;++i){
        grid[x[i]][y[i]]='*';
        if(x[i]<x[i+1]){
            int d=x[i+1]-x[i];
            if(y[i]<y[i+1]){
                for(int j=1;j<d;++j){
                    grid[x[i]+j][y[i]+j]='\\';
                }
            }
            if(y[i]>y[i+1]){
                for(int j=1;j<d;++j){
                    grid[x[i]+j][y[i]-j]='/';
                }
            }
            if(y[i]==y[i+1]){
                for(int j=1;j<d;++j){
                    grid[x[i]+j][y[i]]='|';
                }
            }
        }
        else if(x[i]>x[i+1]){
            int d=x[i]-x[i+1];
            if(y[i]<y[i+1]){
                for(int j=1;j<d;++j){
                    grid[x[i]-j][y[i]+j]='/';
                }
            }
            if(y[i]>y[i+1]){
                for(int j=1;j<d;++j){
                    grid[x[i]-j][y[i]-j]='\\';
                }
            }
            if(y[i]==y[i+1]){
                for(int j=1;j<d;++j){
                    grid[x[i]-j][y[i]]='|';
                }
            }
        }
        else if(x[i]==x[i+1]){
            if(y[i]<y[i+1]){  
                int d=y[i+1]-y[i];
                for(int j=1;j<d;++j){
                    grid[x[i]][y[i]+j]='=';
                }
            }
            if(y[i]>y[i+1]){  
                int d=y[i]-y[i+1];
                for(int j=1;j<d;++j){
                    grid[x[i]][y[i]-j]='=';
                }
            }
        }
    }
    bfs();
    for(int i=1;i<=n/3;++i){
        for(int j=1;j<=m/3;++j){
            if(!grid[i*3][j*3])cout<<'#';
            else cout<<grid[i*3][j*3];
        }
        cout<<endl;
    }
    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