Submission details
Task:Hypyt
Sender:zli0122
Submission time:2025-11-03 14:57:09 +0200
Language:C++ (C++11)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED10
#2ACCEPTED20
#3ACCEPTED15
#4ACCEPTED15
#5ACCEPTED40
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3, 4, 5details
#2ACCEPTED0.00 s1, 2, 3, 4, 5details
#3ACCEPTED0.00 s1, 2, 3, 4, 5details
#4ACCEPTED0.00 s1, 2, 3, 4, 5details
#5ACCEPTED0.00 s1, 2, 3, 4, 5details
#6ACCEPTED0.12 s2, 5details
#7ACCEPTED0.08 s2, 5details
#8ACCEPTED0.05 s2, 5details
#9ACCEPTED0.10 s3, 4, 5details
#10ACCEPTED0.10 s3, 4, 5details
#11ACCEPTED0.09 s3, 4, 5details
#12ACCEPTED0.17 s4, 5details
#13ACCEPTED0.14 s4, 5details
#14ACCEPTED0.12 s4, 5details
#15ACCEPTED0.79 s5details
#16ACCEPTED0.70 s5details
#17ACCEPTED0.46 s5details
#18ACCEPTED0.23 s5details
#19ACCEPTED0.13 s5details
#20ACCEPTED0.13 s5details
#21ACCEPTED0.12 s5details
#22ACCEPTED0.00 s1, 2, 3, 4, 5details
#23ACCEPTED0.00 s1, 2, 3, 4, 5details
#24ACCEPTED0.10 s5details
#25ACCEPTED0.09 s5details
#26ACCEPTED0.79 s5details
#27ACCEPTED0.12 s5details

Code

//FLOYD WARSHALL

#include<bits/stdc++.h>
using namespace std;
 
#define debug(x) cout << #x << ": " << (x) << " | "
#define Debug(x) cout << #x << ": " << (x) << "\n"

const int N = 250;
const int M = 250;

const int INF = 1000;

int row_dis[N][N], col_dis[M][M];
unordered_set<int> col_connections[M];
vector<int> row_connections;

void solve() {
    int n, m, q;
    cin >> n >> m >> q;

    for (int r1=0; r1<n; r1++) for (int r2=0; r2<n; r2++) if (r1!=r2) row_dis[r1][r2] = INF;
    for (int c1=0; c1<m; c1++) for (int c2=0; c2<m; c2++) if (c1!=c2) col_dis[c1][c2] = INF;

    char t;
    for (int r=0; r<n; r++) {
        row_connections.clear();
        for (int c=0; c<m; c++) {
            cin >> t;
            if (t == '.') {
                for (auto i : col_connections[c]) {
                    row_dis[i][r]=1;
                    row_dis[r][i]=1;
                }
                for (auto j : row_connections) {
                    col_dis[j][c]=1;
                    col_dis[c][j]=1;
                }
                col_connections[c].insert(r);
                row_connections.push_back(c);
            }
        }
    }
  
    for (int r1=0; r1<n; r1++) {
        for (int r2=0; r2<n; r2++) {
            for (int r3=0; r3<n; r3++) {
                row_dis[r2][r3] = min(row_dis[r2][r3], row_dis[r2][r1] + row_dis[r1][r3]);
            }
        }
    }

    for (int c1=0; c1<m; c1++) {
        for (int c2=0; c2<m; c2++) {
            for (int c3=0; c3<m; c3++) {
                col_dis[c2][c3] = min(col_dis[c2][c3], col_dis[c2][c1] + col_dis[c1][c3]);
            }
        }
    }

    int r1, c1, r2, c2;
    
    bool done;
 
    for (int _=0;_<q;_++) {
 
        cin >> r1 >> c1 >> r2 >> c2;
        r1--; c1--; r2--; c2--;
        if (row_dis[r1][r2]==INF) {cout << -1 << "\n"; continue;}
        if (r1 == r2 && c1 == c2) {cout << 0 << "\n"; continue;}
    
        if (col_dis[c1][c2] < row_dis[r1][r2]) {cout << 2*col_dis[c1][c2]+1 << "\n"; continue;} //h...h
        if (row_dis[r1][r2] < col_dis[c1][c2]) {cout << 2*row_dis[r1][r2]+1 << "\n"; continue;} //v...v
        
        done=false;
        
        for (auto i : col_connections[c1])
            if (row_dis[i][r2] < row_dis[r1][r2]) {cout << 2*row_dis[r1][r2] << "\n"; done=true; break;}
        
        if (done) continue;
 
        for (auto i : col_connections[c2])
            if (row_dis[r1][i] < row_dis[r1][r2]) {cout << 2*row_dis[r1][r2] << "\n"; done=true; break;}
        
        if (done) continue;

        cout << 2*row_dis[r1][r2]+1 << "\n";
    }
}
int main () {
    cin.tie(0) -> ios::sync_with_stdio(0);
    solve();
}

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
...