Monikulmio

import math
def inp():
    return list(map(int, input().split()))
n,m,k = inp()
pts = [tuple(inp()) for _ in range(k)]
grid = [['.' for _ in range(m)] for _ in range(n)]
def sign(a):
    return (a>0)-(a<0)
for i in range(k):
    y1,x1 = pts[i]
    y2,x2 = pts[(i+1)%k]
    dy = y2-y1
    dx = x2-x1
    steps = max(abs(dy), abs(dx))
    sy = sign(dy)
    sx = sign(dx)
    for t in range(steps+1):
        r = y1 + t*sy
        c = x1 + t*sx
        rr = r-1
        cc = c-1
        if 0<=rr<n and 0<=cc<m:
            if t==0 or t==steps:
                grid[rr][cc]='*'
            else:
                if dy==0:
                    ch='='
                elif dx==0:
                    ch='|'
                else:
                    ch='\\' if dy*dx>0 else '/'
                if grid[rr][cc] != '*':
                    grid[rr][cc]=ch
eps = 1e-9
for r in range(1, n+1):
    y_center = r - 0.5
    inters = []
    for i in range(k):
        y1,x1 = pts[i]
        y2,x2 = pts[(i+1)%k]
        if y1 == y2:
            continue
        ymin = min(y1,y2)
        ymax = max(y1,y2)
        if not (ymin < y_center < ymax):
            continue
        x = x1 + (x2-x1) * (y_center - y1) / (y2 - y1)
        inters.append(x)
    if not inters:
        continue
    inters.sort()
    for j in range(0, len(inters), 2):
        xl = inters[j]
        xr = inters[j+1]
        L = math.ceil(xl + 0.5 - eps)
        R = math.floor(xr + 0.5 + eps)
        if L < 1:
            L = 1
        if R > m:
            R = m
        for c in range(L, R+1):
            rr = r-1
            cc = c-1
            if grid[rr][cc] == '.':
                grid[rr][cc] = '#'
for row in grid:
    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