Submission details
Task:Hypyt
Sender:zli0122
Submission time:2025-11-02 22:35:59 +0200
Language:C++ (C++11)
Status:READY
Result:60
Feedback
groupverdictscore
#1ACCEPTED10
#2ACCEPTED20
#3ACCEPTED15
#4ACCEPTED15
#50
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.39 s2, 5details
#7ACCEPTED0.34 s2, 5details
#8ACCEPTED0.28 s2, 5details
#9ACCEPTED0.17 s3, 4, 5details
#10ACCEPTED0.14 s3, 4, 5details
#11ACCEPTED0.12 s3, 4, 5details
#12ACCEPTED0.37 s4, 5details
#13ACCEPTED0.24 s4, 5details
#14ACCEPTED0.17 s4, 5details
#15--5details
#16--5details
#17ACCEPTED0.83 s5details
#18ACCEPTED0.56 s5details
#19ACCEPTED0.11 s5details
#20ACCEPTED0.13 s5details
#21ACCEPTED0.09 s5details
#22ACCEPTED0.00 s1, 2, 3, 4, 5details
#23ACCEPTED0.00 s1, 2, 3, 4, 5details
#24ACCEPTED0.11 s5details
#25ACCEPTED0.08 s5details
#26--5details
#27ACCEPTED0.09 s5details

Code

#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;

int grid[N][M];

bool vis[N][N];
int dis[N][N];

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

    unordered_set<int> adj[N];

    unordered_set<int> col_connections[M];
    char t;
    for (int r=0; r<n; r++) {
        for (int c=0; c<m; c++) {
            cin >> t;
            if (t == '.') {
                grid[r][c]=1;
                for (auto i : col_connections[c]) {
                    adj[i].insert(r);
                    adj[r].insert(i);
                }
                col_connections[c].insert(r);
            }
        }
    }

    queue<int> dfs;

    for (int r=0; r<n; r++) {
        vis[r][r] = true;
        dis[r][r] = 0;
        dfs.push(r);
        while (!dfs.empty()) {
            int s = dfs.front(); dfs.pop(); 

            for (auto u : adj[s]) {
                if (vis[r][u]) continue;
                vis[r][u] = true;
                dis[r][u] = dis[r][s]+1;
                dfs.push(u);
            }
        }
    }
    int r1, c1, r2, c2;
    int ans;
    
    unordered_set<int> first_vertical, last_vertical;

    for (int _=0;_<q;_++) {
        first_vertical.clear();
        last_vertical.clear();

        cin >> r1 >> c1 >> r2 >> c2;
        r1--; c1--; r2--; c2--;
        if (!vis[r1][r2]) {cout << -1 << "\n"; continue;}
        if (r1 == r2 && c1 == c2) {cout << 0 << "\n"; continue;}
        if (r1 == r2 || c1 == c2) {cout << 1 << "\n"; continue;}
        
        ans = 2*dis[r1][r2]+1; // hv...vh

        for (auto i : col_connections[c1])
            if (dis[i][r2] < dis[r1][r2]) {first_vertical.insert(i);}

        for (auto j : col_connections[c2])
            if (dis[r1][j] < dis[r1][r2]) {last_vertical.insert(j);}

        bool done = 0;
        if ((!first_vertical.empty()) || (!last_vertical.empty())) ans--;
        if ((!first_vertical.empty()) && (!last_vertical.empty())) {
            for (auto i : first_vertical) {
                for (auto j : last_vertical) {
                    if (dis[i][j] == dis[r1][r2]-2) {
                        ans--;
                        done = 1;
                        break;
                    }
                }
                if ( done ) break;
            }
        }

        cout << ans << "\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:

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

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