Monikulmio

n, m, k = map(int, input().split())
points = [tuple(map(int, input().split())) for _ in range(k)]
grid = [[' ' for _ in range(m)] for _ in range(n)]


for i in range(k):
    y1, x1 = points[i]
    y2, x2 = points[(i + 1) % k]
    dy = (y2 > y1) - (y2 < y1)
    dx = (x2 > x1) - (x2 < x1)
    y, x = y1, x1
    while True:
        if (y, x) in points:
            grid[y-1][x-1] = '*'
        else:
            if dy == 0:
                grid[y-1][x-1] = '='
            elif dx == 0:
                grid[y-1][x-1] = '|'
            elif dy == dx:
                grid[y-1][x-1] = '\\'
            else:
                grid[y-1][x-1] = '/'
        if (y, x) == (y2, x2):
            break
        y += dy
        x += dx


def point_in_poly(x, y, poly):
    cnt = 0
    n = len(poly)
    for i in range(n):
        x1, y1 = poly[i][1]-1, poly[i][0]-1
        x2, y2 = poly[(i+1)%n][1]-1, poly[(i+1)%n][0]-1
        if y1 == y2:  
            continue
        if y < min(y1, y2) or y >= max(y1, y2):
            continue
        interx = x1 + (y - y1) * (x2 - x1) / (y2 - y1)
        if interx > x:
            cnt += 1
    return cnt % 2 == 1


for i in range(n):
    for j in range(m):
        if grid[i][j] == ' ':
            if point_in_poly(j, i, points):
                grid[i][j] = '#'
            else:
                grid[i][j] = '.'


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