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)]

# Draw corner points
for y, x in points:
    grid[y-1][x-1] = '*'

# Bresenham-like line drawing
for i in range(k):
    y1, x1 = points[i]
    y2, x2 = points[(i+1) % k]
    y1 -= 1; x1 -= 1; y2 -= 1; x2 -= 1

    dy = y2 - y1
    dx = x2 - x1
    steps = max(abs(dy), abs(dx))
    for s in range(1, steps):
        yy = y1 + dy * s // steps
        xx = x1 + dx * s // steps
        if grid[yy][xx] == '*':
            continue
        if dy == 0:
            grid[yy][xx] = '='
        elif dx == 0:
            grid[yy][xx] = '|'
        elif (dy > 0 and dx > 0) or (dy < 0 and dx < 0):
            grid[yy][xx] = '\\'
        else:
            grid[yy][xx] = '/'

# Fill polygon interior using optimized scanline (ray-casting for each row)
for i in range(n):
    intersections = []
    for j in range(k):
        y1, x1 = points[j]
        y2, x2 = points[(j+1) % k]
        y1 -= 1; x1 -= 1; y2 -= 1; x2 -= 1
        if y1 == y2:  # horizontal edge
            if i == y1:
                intersections.extend(sorted([x1, x2]))
            continue
        if min(y1, y2) <= i < max(y1, y2):
            t = (i - y1) / (y2 - y1)
            x_cross = x1 + t * (x2 - x1)
            intersections.append(x_cross)
    intersections.sort()
    for idx in range(0, len(intersections), 2):
        if idx+1 >= len(intersections):
            break
        x_start = int(round(intersections[idx])) + 1
        x_end = int(round(intersections[idx+1]))
        for x in range(x_start, x_end):
            if grid[i][x] == '.':
                grid[i][x] = '#'

# Print the final grid
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