Monikulmio

def inp():
    return list(map(int, input().split()))

n, m, k = inp()
pts = []
for _ in range(k):
    y, x = inp()
    pts.append((y, x))

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

def sign(a):
    if a > 0:
        return 1
    if a < 0:
        return -1
    return 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:
                ch = None
                if dy == 0:
                    ch = '='
                elif dx == 0:
                    ch = '|'
                else:
                    if dy * dx > 0:
                        ch = '\\'
                    else:
                        ch = '/'
                if grid[rr][cc] != '*':
                    grid[rr][cc] = ch

def point_in_poly(px, py, poly):
    inside = False
    j = len(poly) - 1
    for i in range(len(poly)):
        yi, xi = poly[i]
        yj, xj = poly[j]
        xi, yi = xi, yi
        xj, yj = xj, yj
        intersect = ((yi > py) != (yj > py)) and (px < (xj - xi) * (py - yi) / (yj - yi) + xi)
        if intersect:
            inside = not inside
        j = i
    return inside

for r in range(1, n + 1):
    for c in range(1, m + 1):
        if grid[r - 1][c - 1] == '.':
            if point_in_poly(c, r, pts):
                grid[r - 1][c - 1] = '#'

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: TIME LIMIT EXCEEDED