Submission details
Task:Hypyt
Sender:MaksimMoz
Submission time:2025-11-09 12:29:36 +0200
Language:Python3 (CPython3)
Status:READY
Result:30
Feedback
groupverdictscore
#1ACCEPTED10
#2ACCEPTED20
#30
#40
#50
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1, 2, 3, 4, 5details
#2ACCEPTED0.02 s1, 2, 3, 4, 5details
#3ACCEPTED0.02 s1, 2, 3, 4, 5details
#4ACCEPTED0.02 s1, 2, 3, 4, 5details
#5ACCEPTED0.02 s1, 2, 3, 4, 5details
#6ACCEPTED0.07 s2, 5details
#7ACCEPTED0.06 s2, 5details
#8ACCEPTED0.05 s2, 5details
#9--3, 4, 5details
#10--3, 4, 5details
#11--3, 4, 5details
#12--4, 5details
#13--4, 5details
#14--4, 5details
#15--5details
#16--5details
#17--5details
#18--5details
#19--5details
#20--5details
#21--5details
#22ACCEPTED0.02 s1, 2, 3, 4, 5details
#23ACCEPTED0.02 s1, 2, 3, 4, 5details
#24ACCEPTED0.54 s5details
#25ACCEPTED0.51 s5details
#26--5details
#27ACCEPTED0.29 s5details

Code

import sys
from collections import deque
from array import array


def main():
    data = sys.stdin.buffer.read().split()
    it = iter(data)

    n = int(next(it)); m = int(next(it)); q = int(next(it))
    rows = [[] for _ in range(n)]
    cols = [[] for _ in range(m)]
    for r in range(n):
        s = next(it).decode()
        for c, ch in enumerate(s):
            if ch == '.':
                rows[r].append(c)
                cols[c].append(r)
    N = n + m
    visS = array('I', [0]) * N
    visT = array('I', [0]) * N
    distS = array('I', [0]) * N
    distT = array('I', [0]) * N
    cur = 0

    out = []
    for _ in range(q):
        r1 = int(next(it)) - 1
        c1 = int(next(it)) - 1
        r2 = int(next(it)) - 1
        c2 = int(next(it)) - 1

        if r1 == r2 and c1 == c2:
            out.append("0")
            continue

        cur += 1
        sQ, tQ = deque(), deque()
        for u in (r1, n + c1):
            visS[u] = cur
            distS[u] = 0
            sQ.append(u)
        for u in (r2, n + c2):
            visT[u] = cur
            distT[u] = 0
            tQ.append(u)
        if visS[r2] == cur or visS[n + c2] == cur:
            out.append("1")
            continue

        found = -1
        while sQ and tQ:
            if len(sQ) <= len(tQ):
                size = len(sQ)
                best = None
                for _ in range(size):
                    u = sQ.popleft()
                    du = distS[u] + 1
                    if u < n:
                        for c in rows[u]:
                            v = n + c
                            if visS[v] != cur:
                                visS[v] = cur
                                distS[v] = du
                                if visT[v] == cur:
                                    cand = du + distT[v]
                                    best = cand if best is None else min(best, cand)
                                else:
                                    sQ.append(v)
                    else:
                        c = u - n
                        for r in cols[c]:
                            v = r
                            if visS[v] != cur:
                                visS[v] = cur
                                distS[v] = du
                                if visT[v] == cur:
                                    cand = du + distT[v]
                                    best = cand if best is None else min(best, cand)
                                else:
                                    sQ.append(v)
                if best is not None:
                    found = best
                    break
            else:
                size = len(tQ)
                best = None
                for _ in range(size):
                    u = tQ.popleft()
                    du = distT[u] + 1
                    if u < n:
                        for c in rows[u]:
                            v = n + c
                            if visT[v] != cur:
                                visT[v] = cur
                                distT[v] = du
                                if visS[v] == cur:
                                    cand = du + distS[v]
                                    best = cand if best is None else min(best, cand)
                                else:
                                    tQ.append(v)
                    else:
                        c = u - n
                        for r in cols[c]:
                            v = r
                            if visT[v] != cur:
                                visT[v] = cur
                                distT[v] = du
                                if visS[v] == cur:
                                    cand = du + distS[v]
                                    best = cand if best is None else min(best, cand)
                                else:
                                    tQ.append(v)
                if best is not None:
                    found = best
                    break

        out.append(str(found + 1) if found != -1 else "-1")

    sys.stdout.write("\n".join(out))


if __name__ == "__main__":
    main()

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:

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

correct output
2
2
2
2
2
...

user output
(empty)

Test 10

Group: 3, 4, 5

Verdict:

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

correct output
2
1
3
2
2
...

user output
(empty)

Test 11

Group: 3, 4, 5

Verdict:

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

correct output
3
3
3
3
3
...

user output
(empty)

Test 12

Group: 4, 5

Verdict:

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

correct output
2
2
2
2
2
...

user output
(empty)

Test 13

Group: 4, 5

Verdict:

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

correct output
3
2
2
3
2
...

user output
(empty)

Test 14

Group: 4, 5

Verdict:

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

correct output
2
3
1
2
2
...

user output
(empty)

Test 15

Group: 5

Verdict:

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

correct output
3
2
2
2
2
...

user output
(empty)

Test 16

Group: 5

Verdict:

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

correct output
2
2
2
2
2
...

user output
(empty)

Test 17

Group: 5

Verdict:

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

correct output
3
3
2
2
2
...

user output
(empty)

Test 18

Group: 5

Verdict:

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

correct output
3
3
3
3
3
...

user output
(empty)

Test 19

Group: 5

Verdict:

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

correct output
104
422
145
93
65
...

user output
(empty)

Test 20

Group: 5

Verdict:

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

correct output
57
155
38
65
98
...

user output
(empty)

Test 21

Group: 5

Verdict:

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

correct output
498
498
498
498
498
...

user output
(empty)

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:

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

correct output
2
2
2
2
2
...

user output
(empty)

Test 27

Group: 5

Verdict: ACCEPTED

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

correct output
0
0
0
0
0
...

user output
0
0
0
0
0
...