Monikulmio

s = input()

inputlist = [int(x) for x in s.split()]

n = inputlist[0]
m = inputlist[1]
k = inputlist[2]

for i in range(int(k)):
    s = input()
    for item in s.split():
        inputlist.append(int(item))

xlist = [x for index, x in enumerate(inputlist) if index>2 and index%2!=0]
ylist = [y for index, y in enumerate(inputlist) if index>2 and index%2==0]

coordlist = [(x, y) for x, y in zip(xlist, ylist)]

def map_borders():
    rowlist = []
    collist = []
    backslash = []
    slash = []

    prevcoord = coordlist[0]

    for i in range(1, len(coordlist)+1):
        
        if i >= len(coordlist):
            currentcoord = coordlist[0]
            prevcoord = coordlist[-1]
        else:
            currentcoord = coordlist[i]

        if currentcoord[0] == prevcoord[0]:
            if prevcoord[1] < currentcoord[1]:
                for x in range(prevcoord[1]+1, currentcoord[1]):
                    currentcoords = (currentcoord[0], x)
                    rowlist.append(currentcoords)
            else:
                for x in range(currentcoord[1], prevcoord[1]):
                    currentcoords = (currentcoord[0], x)
                    rowlist.append(currentcoords)

        elif currentcoord[1] == prevcoord[1]:
            if prevcoord[0] < currentcoord[0]:
                for y in range(prevcoord[0]+1 , currentcoord[0]):
                    currentcoords = (y, currentcoord[1])
                    collist.append(currentcoords)
            else:
                for y in range(currentcoord[0], prevcoord[0]):
                    currentcoords = (y, currentcoord[1])
                    collist.append(currentcoords)
 
        elif prevcoord[1] < currentcoord[1]: #to the right
            distance = abs(prevcoord[0]-currentcoord[0])
            if prevcoord[0] < currentcoord[0]: #down right \
                for i in range(1, distance):
                    currentcoords = (prevcoord[0]+i, prevcoord[1]+i)
                    backslash.append(currentcoords)
            elif prevcoord[0] > currentcoord[0]: #up right /
                for i in range(1, distance):
                    currentcoords = (prevcoord[0]-i, prevcoord[1]+i)
                    slash.append(currentcoords)

        elif prevcoord[1] > currentcoord[1]: #to the left
            distance = abs(prevcoord[0]-currentcoord[0])
            if prevcoord[0] < currentcoord[0]: #down left /
                for i in range(1, distance):
                    currentcoords = (prevcoord[0]+i, prevcoord[1]-i)
                    slash.append(currentcoords)
            elif prevcoord[0] > currentcoord[0]: #up left \
                for i in range(1, distance):
                    currentcoords = (prevcoord[0]-i, prevcoord[1]-i)
                    backslash.append(currentcoords)
        
        prevcoord = currentcoord

    return [rowlist, collist, backslash, slash]



def draw_rows():
    cont = map_borders()

    rowlist = cont[0]
    collist = cont[1]
    backslash = cont[2]
    slash = cont[3]

    for row in range(1, n+1):
        currentrow = ["." for x in range(m)]

        for col in range(1, m+1):

            if (row, col) in coordlist:
                currentrow[col-1] = "*"

            elif (row, col) in rowlist:
                currentrow[col-1] = "="
            
            elif (row, col) in collist:
                currentrow[col-1] = "|"

            elif (row, col) in slash:
                currentrow[col-1] = "/"
            
            elif (row, col) in backslash:
                currentrow[col-1] = '\\'

            
        print("".join(currentrow))

draw_rows()

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