| Task: | Monikulmio |
| Sender: | OK123 |
| Submission time: | 2025-11-06 08:18:43 +0200 |
| Language: | Python3 (CPython3) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 100 |
| test | verdict | time | score | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.02 s | 10 | details |
| #2 | ACCEPTED | 0.02 s | 10 | details |
| #3 | ACCEPTED | 0.02 s | 10 | details |
| #4 | ACCEPTED | 0.02 s | 10 | details |
| #5 | ACCEPTED | 0.02 s | 10 | details |
| #6 | ACCEPTED | 0.02 s | 10 | details |
| #7 | ACCEPTED | 0.02 s | 10 | details |
| #8 | ACCEPTED | 0.03 s | 10 | details |
| #9 | ACCEPTED | 0.03 s | 10 | details |
| #10 | ACCEPTED | 0.10 s | 10 | details |
Code
n, m, k = map(int, input().split())
kords=[]
for l in range(k):
y, x = map(int, input().split())
kords.append((y, x))
kords.append(kords[0])
lists = [["." for s in range(m)] for g in range(n)]
for point in kords:
(lists[point[0]-1])[point[1]-1]="*"
import math
for i in range(0, k):
if (kords[i])[0]==(kords[i+1][0]):
for d in range(min((kords[i])[1], (kords[i+1])[1]), max((kords[i])[1], (kords[i+1])[1])-1):
(lists[(kords[i])[0]-1])[d]="="
#kerkki===
if (kords[i])[1]==(kords[i+1][1]):
for d in range(min((kords[i])[0], (kords[i+1])[0]), max((kords[i])[0], (kords[i+1])[0])-1):
(lists[d])[(kords[i])[1]-1]="|"
#merkki |||||||
else:
t=0
if (kords[i])[0]<(kords[i+1][0]) and (kords[i])[1]<(kords[i+1][1]):
for d in range(min((kords[i])[0], (kords[i+1])[0]), max((kords[i])[0], (kords[i+1])[0])-1):
(lists[d])[min((kords[i])[1], (kords[i+1])[1])+t]="\\"
t+=1
if (kords[i])[0]<(kords[i+1][0]) and (kords[i])[1]>(kords[i+1][1]):
for d in range(min((kords[i])[0], (kords[i+1])[0]), max((kords[i])[0], (kords[i+1])[0])-1):
(lists[d])[max((kords[i])[1], (kords[i+1])[1])-t-2]="/"
t+=1
#merkki \\\
if (kords[i])[0]>(kords[i+1][0]) and (kords[i])[1]<(kords[i+1][1]):
for d in range(min((kords[i])[0], (kords[i+1])[0]), max((kords[i])[0], (kords[i+1])[0])-1):
(lists[d])[max((kords[i])[1], (kords[i+1])[1])-t-2]="/"
t+=1
if (kords[i])[0]>(kords[i+1][0]) and (kords[i])[1]>(kords[i+1][1]):
for d in range(min((kords[i])[0], (kords[i+1])[0]), max((kords[i])[0], (kords[i+1])[0])-1):
(lists[d])[min((kords[i])[1], (kords[i+1])[1])+t]="\\"
t+=1
#merkki \\\
#täyttö:
for y in range(n):
väli = []
for i in range(k):
y1, x1 = kords[i]
y2, x2 = kords[i + 1]
if y1 == y2:
continue
#ei ==
if y+0.5>=min(y1, y2) and y+0.5<max(y1, y2):
t=(y+0.5-y1)/(y2-y1)
xv=x1+t*(x2-x1)
väli.append(xv)
väli.sort()
for i in range(0, len(väli)-1, 2):
alku = math.ceil(väli[i]-1)
loppu = math.floor(väli[i+1]-1)
for x in range(alku, loppu+1):
if 0<=x<m and lists[y][x]==".":
lists[y][x]="#"
for i in range(n):
for j in range(m):
print((lists[i])[j],end="")
print("")
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 |
|---|
| *=====*===*==*................... |
Test 10 (public)
Verdict: ACCEPTED
| input |
|---|
| 100 100 1000 10 1 4 7 1 4 1 9 ... |
| correct output |
|---|
| ...*====*........................ |
| user output |
|---|
| ...*====*........................ |
