Monikulmio

import collections

n, m, k = map(int, input().split())
p = []
for _ in range(k):
    y, x = map(int, input().split())
    p.append((y - 1, x - 1))

g = [['.' for _ in range(m)] for _ in range(n)]

for i in range(k):
    y1, x1 = p[i]
    y2, x2 = p[(i + 1) % k]
    
    g[y1][x1] = '*'
    
    dy = y2 - y1
    dx = x2 - x1
    l = max(abs(dy), abs(dx))
    
    sy = 0 if dy == 0 else dy // abs(dy)
    sx = 0 if dx == 0 else dx // abs(dx)
    
    ch = ''
    if sy == 0: ch = '='
    elif sx == 0: ch = '|'
    elif sy * sx > 0: ch = '\\'
    else: ch = '/'
    
    for j in range(1, l):
        cy = y1 + j * sy
        cx = x1 + j * sx
        g[cy][cx] = ch

q = collections.deque()
v = set()

def aq(r, c):
    if 0 <= r < n and 0 <= c < m and (r, c) not in v and g[r][c] == '.':
        q.append((r, c))
        v.add((r, c))

for r in range(n):
    aq(r, 0)
    aq(r, m - 1)

for c in range(m):
    aq(0, c)
    aq(n - 1, c)

while q:
    r, c = q.popleft()
    aq(r + 1, c)
    aq(r - 1, c)
    aq(r, c + 1)
    aq(r, c - 1)
    
    if r + 1 < n and c + 1 < m and g[r+1][c] == '.' and g[r][c+1] == '.':
        aq(r + 1, c + 1)
    if r + 1 < n and c - 1 >= 0 and g[r+1][c] == '.' and g[r][c-1] == '.':
        aq(r + 1, c - 1)
    if r - 1 >= 0 and c + 1 < m and g[r-1][c] == '.' and g[r][c+1] == '.':
        aq(r - 1, c + 1)
    if r - 1 >= 0 and c - 1 >= 0 and g[r-1][c] == '.' and g[r][c-1] == '.':
        aq(r - 1, c - 1)

for r in range(n):
    for c in range(m):
        if g[r][c] == '.' and (r, c) not in v:
            g[r][c] = '#'

for row in g:
    print("".join(row))

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