Submission details
Task:Hypyt
Sender:Toitsu
Submission time:2025-10-30 15:59:42 +0200
Language:Python3 (PyPy3)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED10
#2ACCEPTED20
#3ACCEPTED15
#4ACCEPTED15
#5ACCEPTED40
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1, 2, 3, 4, 5details
#2ACCEPTED0.05 s1, 2, 3, 4, 5details
#3ACCEPTED0.05 s1, 2, 3, 4, 5details
#4ACCEPTED0.04 s1, 2, 3, 4, 5details
#5ACCEPTED0.04 s1, 2, 3, 4, 5details
#6ACCEPTED0.26 s2, 5details
#7ACCEPTED0.21 s2, 5details
#8ACCEPTED0.15 s2, 5details
#9ACCEPTED0.47 s3, 4, 5details
#10ACCEPTED0.47 s3, 4, 5details
#11ACCEPTED0.46 s3, 4, 5details
#12ACCEPTED0.48 s4, 5details
#13ACCEPTED0.48 s4, 5details
#14ACCEPTED0.47 s4, 5details
#15ACCEPTED0.69 s5details
#16ACCEPTED0.64 s5details
#17ACCEPTED0.58 s5details
#18ACCEPTED0.55 s5details
#19ACCEPTED0.52 s5details
#20ACCEPTED0.53 s5details
#21ACCEPTED0.47 s5details
#22ACCEPTED0.04 s1, 2, 3, 4, 5details
#23ACCEPTED0.04 s1, 2, 3, 4, 5details
#24ACCEPTED0.47 s5details
#25ACCEPTED0.46 s5details
#26ACCEPTED0.71 s5details
#27ACCEPTED0.41 s5details

Code

height, width, question_count = map(int, input().split())

# create the grid from input
grid = []
for _ in range(height):
    grid.append(list(input()))

# read all queries first
queries = []
for _ in range(question_count):
    # convert 1-based Y1 X1 Y2 X2 to 0-based (X2, Y2, X2, Y2)
    y1, x1, y2, x2 = map(int, input().split())
    queries.append((y1 - 1, x1 - 1, y2 - 1, x2 - 1))

node_count = height + width
adjacency_list = []
for _ in range(node_count):
    adjacency_list.append([])

for row_index in range(height):
    row = grid[row_index]

    for col_index, cell in enumerate(row):
        if cell == '.':
            row_node = row_index
            col_node = height + col_index
            
            adjacency_list[row_node].append(col_node)
            adjacency_list[col_node].append(row_node)

distances = []
for _ in range(node_count):
    distances.append([-1] * node_count)

for start_node in range(node_count):
    queue = []
    queue.append(start_node)
    distance_from_start = distances[start_node]
    distance_from_start[start_node] = 0

    while queue:
        current_node = queue.pop(0)
        current_distance = distance_from_start[current_node]

        for neighbor in adjacency_list[current_node]:
            if distance_from_start[neighbor] == -1:
                distance_from_start[neighbor] = current_distance + 1
                queue.append(neighbor)

# now process all queries
answers = []

for (start_row, start_col, end_row, end_col) in queries:
    if start_row == end_row and start_col == end_col:
        answers.append(0)
        continue

    shortest_distance = 10 ** 9 # big placeholder value for upper bound
    for start_node in (start_row, height + start_col):
        for end_node in (end_row, height + end_col):
            distance = distances[start_node][end_node]
            if distance != -1:
                shortest_distance = min(shortest_distance, distance + 1)

    answers.append(shortest_distance if shortest_distance != 10 ** 9 else -1)

for answer in answers:
    print(answer)

Test details

Test 1 (public)

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

input
4 6 5
.*.***
*...**
*****.
*..*.*
...

correct output
1
0
3
3
-1

user output
1
0
3
3
-1

Test 2

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

input
10 10 10
..........
.....*....
........*.
*.*....*..
...

correct output
1
2
1
2
2
...

user output
1
2
1
2
2
...

Test 3

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

input
10 10 10
*...***.**
*****.*...
**..**.**.
..**.**.*.
...

correct output
1
2
2
1
2
...

user output
1
2
2
1
2
...

Test 4

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

input
10 10 10
***.*.****
**********
*.********
.*.***.**.
...

correct output
3
4
2
3
4
...

user output
3
4
2
3
4
...

Test 5

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

input
10 10 1
.****.****
**.**..***
**********
*******..*
...

correct output
7

user output
7

Test 6

Group: 2, 5

Verdict: ACCEPTED

input
250 250 250
.*...*.....*******..**...*.......

correct output
2
3
3
2
2
...

user output
2
3
3
2
2
...

Test 7

Group: 2, 5

Verdict: ACCEPTED

input
250 250 250
...*......**.**.*.*..**..*..**...

correct output
2
2
2
2
3
...

user output
2
2
2
2
3
...

Test 8

Group: 2, 5

Verdict: ACCEPTED

input
250 250 250
**..**..****.****.*.***.***..*...

correct output
2
3
3
3
3
...

user output
2
3
3
3
3
...

Test 9

Group: 3, 4, 5

Verdict: ACCEPTED

input
40 40 200000
...*.**.*..*.............*.*.....

correct output
2
2
2
2
2
...

user output
2
2
2
2
2
...

Test 10

Group: 3, 4, 5

Verdict: ACCEPTED

input
40 40 200000
**.**..*.*.*.******....****.*....

correct output
2
1
3
2
2
...

user output
2
1
3
2
2
...

Test 11

Group: 3, 4, 5

Verdict: ACCEPTED

input
40 40 200000
.*.*.**.*****.***.*.****.**.**...

correct output
3
3
3
3
3
...

user output
3
3
3
3
3
...

Test 12

Group: 4, 5

Verdict: ACCEPTED

input
80 80 200000
*....**.***..****...*.....*......

correct output
2
2
2
2
2
...

user output
2
2
2
2
2
...

Test 13

Group: 4, 5

Verdict: ACCEPTED

input
80 80 200000
.***.*..*.***..*****....**...*...

correct output
3
2
2
3
2
...

user output
3
2
2
3
2
...

Test 14

Group: 4, 5

Verdict: ACCEPTED

input
80 80 200000
*******.*****.*..*..****...***...

correct output
2
3
1
2
2
...

user output
2
3
1
2
2
...

Test 15

Group: 5

Verdict: ACCEPTED

input
250 250 200000
*....*..*..*..**..*.........**...

correct output
3
2
2
2
2
...

user output
3
2
2
2
2
...

Test 16

Group: 5

Verdict: ACCEPTED

input
250 250 200000
..*....*..*......*.**.*.*..***...

correct output
2
2
2
2
2
...

user output
2
2
2
2
2
...

Test 17

Group: 5

Verdict: ACCEPTED

input
250 250 200000
*..*.*****.*********.****.****...

correct output
3
3
2
2
2
...

user output
3
3
2
2
2
...

Test 18

Group: 5

Verdict: ACCEPTED

input
250 250 200000
*********.**********.******.**...

correct output
3
3
3
3
3
...

user output
3
3
3
3
3
...

Test 19

Group: 5

Verdict: ACCEPTED

input
250 250 200000
.*****************************...

correct output
104
422
145
93
65
...

user output
104
422
145
93
65
...

Test 20

Group: 5

Verdict: ACCEPTED

input
250 250 200000
..****************************...

correct output
57
155
38
65
98
...

user output
57
155
38
65
98
...

Test 21

Group: 5

Verdict: ACCEPTED

input
250 250 200000
.*****************************...

correct output
498
498
498
498
498
...

user output
498
498
498
498
498
...

Test 22

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

input
10 1 10
*
*
.
*
...

correct output
0
1
1
0
0
...

user output
0
1
1
0
0
...

Test 23

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

input
1 10 10
........*.
1 7 1 10
1 4 1 7
1 5 1 1
...

correct output
1
1
1
1
1
...

user output
1
1
1
1
1
...

Test 24

Group: 5

Verdict: ACCEPTED

input
250 1 200000
*
.
*
.
...

correct output
1
1
1
1
1
...

user output
1
1
1
1
1
...

Test 25

Group: 5

Verdict: ACCEPTED

input
1 250 200000
*.*.*...*.*.**.***..**.*.*..**...

correct output
1
1
1
1
1
...

user output
1
1
1
1
1
...

Test 26

Group: 5

Verdict: ACCEPTED

input
250 250 200000
.................................

correct output
2
2
2
2
2
...

user output
2
2
2
2
2
...

Test 27

Group: 5

Verdict: ACCEPTED

input
250 250 200000
******************************...

correct output
0
0
0
0
0
...

user output
0
0
0
0
0
...