Submission details
Task:Monikulmio
Sender:3lv11ra
Submission time:2025-11-09 21:02:51 +0200
Language:Python3 (CPython3)
Status:READY
Result:94
Feedback
groupverdictscore
#1ACCEPTED94
Test results
testverdicttimescore
#1ACCEPTED0.02 s10details
#2ACCEPTED0.02 s10details
#3ACCEPTED0.02 s10details
#4ACCEPTED0.02 s10details
#5ACCEPTED0.02 s10details
#6ACCEPTED0.02 s10details
#7ACCEPTED0.03 s10details
#8ACCEPTED0.03 s10details
#9ACCEPTED0.03 s7details
#10ACCEPTED0.09 s7details

Code

from collections import deque

def sign(a: int) -> int:
    """Palauttaa luvun etumerkin (-1, 0, 1)."""
    return (a > 0) - (a < 0)

# --- Syöte ---
n, m, k = map(int, input().split())
points = [tuple(map(lambda v: int(v) - 1, input().split())) for _ in range(k)]

# --- Alustetaan ruudukko ---
grid = [['.' for _ in range(m)] for _ in range(n)]

# --- Piirretään janat ja kärkipisteet ---
for i in range(k):
    y1, x1 = points[i]
    y2, x2 = points[(i + 1) % k]
    dy, dx = sign(y2 - y1), sign(x2 - x1)
    y, x = y1, x1

    while True:
        # Kärkipiste
        if (y, x) in points:
            grid[y][x] = '*'
        else:
            # Valitaan merkki suunnan perusteella
            if dy == 0:
                ch = '='
            elif dx == 0:
                ch = '|'
            elif dy == dx:
                ch = '\\'
            else:
                ch = '/'
            grid[y][x] = ch

        if (y, x) == (y2, x2):
            break
        y += dy
        x += dx

# --- Täytetään sisäpuoli BFS:llä ---
visited = [[False]*m for _ in range(n)]
queue = deque()

# Lisätään reunat BFS:n aloituspisteiksi
for y in [0, n-1]:
    for x in range(m):
        if not visited[y][x]:
            visited[y][x] = True
            if grid[y][x] == '.':
                queue.append((y, x))

for x in [0, m-1]:
    for y in range(n):
        if not visited[y][x]:
            visited[y][x] = True
            if grid[y][x] == '.':
                queue.append((y, x))

# BFS: merkitään kaikki ulkopuolella olevat pisteet
while queue:
    y, x = queue.popleft()
    for dy, dx in [(-1,0),(1,0),(0,-1),(0,1)]:
        ny, nx = y+dy, x+dx
        if 0<=ny<n and 0<=nx<m and not visited[ny][nx] and grid[ny][nx]=='.':
            visited[ny][nx] = True
            queue.append((ny, nx))

# Kaikki pisteet, joita ei saavutettu BFS:llä, ovat sisällä
for y in range(n):
    for x in range(m):
        if grid[y][x] == '.' and not visited[y][x]:
            grid[y][x] = '#'

# --- Tulostus ---
for row in grid:
    print(''.join(row))

Test details

Test 1 (public)

Verdict: ACCEPTED

input
8 9 5
5 2
2 5
5 8
7 8
...

correct output
.........
....*....
.../#\...
../###\..
.*#####*.
...

user output
.........
....*....
.../#\...
../###\..
.*#####*.
...

Test 2 (public)

Verdict: ACCEPTED

input
20 40 4
5 10
5 30
15 30
15 10

correct output
.................................

user output
.................................

Test 3 (public)

Verdict: ACCEPTED

input
20 40 29
8 7
13 2
14 2
9 7
...

correct output
.................................

user output
.................................

Test 4 (public)

Verdict: ACCEPTED

input
20 40 14
5 12
5 25
8 28
13 28
...

correct output
.................................

user output
.................................

Test 5 (public)

Verdict: ACCEPTED

input
20 40 12
3 20
7 16
7 9
11 13
...

correct output
.................................

user output
.................................

Test 6 (public)

Verdict: ACCEPTED

input
9 35 33
2 3
2 8
4 8
4 5
...

correct output
.................................

user output
.................................

Test 7 (public)

Verdict: ACCEPTED

input
30 100 69
6 10
6 14
7 14
7 18
...

correct output
.................................

user output
.................................

Test 8 (public)

Verdict: ACCEPTED

input
40 60 192
11 3
11 5
10 6
11 7
...

correct output
.................................

user output
.................................

Test 9 (public)

Verdict: ACCEPTED

input
50 100 142
1 1
1 7
1 11
1 14
...

correct output
*=====*===*==*...................

user output
*=====*===*==*...................

Feedback: Lines are drawn correctly. Incorrect fill character on row 3, col 9: expected '.', got '#'

Test 10 (public)

Verdict: ACCEPTED

input
100 100 1000
10 1
4 7
1 4
1 9
...

correct output
...*====*........................

user output
...*====*........................

Feedback: Lines are drawn correctly. Incorrect fill character on row 4, col 29: expected '.', got '#'