Submission details
Task:Island
Sender:Sebastian
Submission time:2026-04-16 12:08:21 +0300
Language:C++ (C++20)
Status:READY
Result:16
Feedback
subtaskverdictscore
#10
#20
#3ACCEPTED16
#40
#50
Test results
testverdicttimesubtask
#10.55 s1, 5details
#2ACCEPTED0.00 s1, 2, 3, 4, 5details
#30.56 s1, 5details
#40.58 s1, 5details
#5ACCEPTED0.01 s1, 3, 5details
#60.75 s1, 2, 4, 5details
#70.75 s1, 2, 4, 5details
#80.56 s1, 5details
#90.57 s1, 5details
#10ACCEPTED0.01 s1, 3, 4, 5details
#11ACCEPTED0.01 s1, 3, 5details
#120.85 s1, 4, 5details
#13ACCEPTED0.01 s1, 3, 4, 5details
#140.56 s1, 4, 5details
#150.76 s1, 5details
#160.58 s1, 5details
#170.58 s1, 5details
#180.58 s1, 5details
#191.21 s2, 4, 5details
#201.14 s2, 4, 5details
#211.19 s2, 4, 5details
#221.29 s2, 4, 5details
#23ACCEPTED0.40 s3, 5details
#24ACCEPTED0.40 s3, 5details
#25ACCEPTED0.39 s3, 5details
#26ACCEPTED0.36 s3, 5details
#27ACCEPTED0.34 s3, 4, 5details
#28ACCEPTED0.26 s3, 4, 5details
#290.62 s4, 5details
#300.60 s4, 5details
#31--4, 5details
#320.84 s4, 5details
#331.42 s4, 5details
#340.59 s4, 5details
#350.66 s5details
#360.68 s5details
#370.68 s5details
#380.67 s5details
#390.67 s5details
#400.69 s5details
#411.25 s5details
#420.73 s5details
#430.68 s5details
#440.69 s5details

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef __int128_t i128;
#define all(x) begin(x), end(x)
#define sz(x) ((int)(x).size())
const ll inf = 4e18;

vector<ll> bfs(vector<vector<ll>> &adj, ll s) {
    ll n = sz(adj);
    vector<ll> dist(n, inf);
    queue<ll> qu;
    dist[s] = 0;
    qu.push(s);
    while (sz(qu)) {
        ll i = qu.front(); qu.pop();
        for (auto &e : adj[i]) {
            if (dist[e] < inf) continue;
            dist[e] = dist[i] + 1;
            qu.push(e);
        }
    }
    return dist;
}

struct binary_lifting {
    vector<ll> dep;
    vector<vector<ll>> jmp;

    binary_lifting(vector<vector<ll>> &adj) {
        ll n = sz(adj);
        vector<ll> par(n);
        dep = vector<ll>(n);
        auto dfs = [&](auto &oink, ll i, ll p, ll d) -> void {
            par[i] = p;
            dep[i] = d;
            for (auto &e : adj[i]) {
                if (e == p) continue;
                oink(oink, e, i, d+1);
            }
        };
        dfs(dfs, 0, 0, 0);
        
        jmp = vector<vector<ll>>(20, par);
        for (ll j = 1; j < 20; j++) {
            for (ll i = 0; i < n; i++) {
                jmp[j][i] = jmp[j-1][jmp[j-1][i]];
            }
        }
    }

    ll lift(ll i, ll k) {
        for (ll j = 20; j--;) {
            if ((1 << j) > k) continue;
            i = jmp[j][i];
            k -= (1 << j);
        }
        return i;
    }

    ll lca(ll a, ll b) {
        if (dep[a] > dep[b]) swap(a, b);
        b = lift(b, dep[b] - dep[a]);
        if (a == b) return a;
        for (ll j = 20; j--;) {
            if (jmp[j][a] == jmp[j][b]) continue;
            a = jmp[j][a], b = jmp[j][b];
        }
        return jmp[0][a];
    }

    ll dist(ll a, ll b) {
        return dep[a] + dep[b] - 2*dep[lca(a, b)];
    }
};

void solve() {
    ll n, q; cin >> n >> q;
    vector<vector<bool>> grid(n, vector<bool>(n));
    vector<vector<ll>> id(n, vector<ll>(n));
    ll t = 0;
    for (ll i = 0; i < n; i++) {
        for (ll j = 0; j < n; j++) {
            char c; cin >> c;
            grid[i][j] = (c == '#');
            if (grid[i][j]) id[i][j] = t++;
        }
    }

    vector<vector<ll>> adj(t);
    for (ll i = 0; i+1 < n; i++) {
        for (ll j = 0; j < n; j++) {
            if (!grid[i][j] || !grid[i+1][j]) continue;
            adj[id[i][j]].push_back(id[i+1][j]);
            adj[id[i+1][j]].push_back(id[i][j]);
        }
    }
    for (ll i = 0; i < n; i++) {
        for (ll j = 0; j+1 < n; j++) {
            if (!grid[i][j] || !grid[i][j+1]) continue;
            adj[id[i][j]].push_back(id[i][j+1]);
            adj[id[i][j+1]].push_back(id[i][j]);
        }
    }

    binary_lifting lca(adj);
    while (q--) {
        ll sr, sc, tr, tc; cin >> sr >> sc >> tr >> tc;
        sr--; sc--; tr--; tc--;
        ll a = id[sr][sc], b = id[tr][tc];
        cout << lca.dist(a, b) << '\n';
    }
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    solve();
}

Test details

Test 1

Subtask: 1, 5

Verdict:

input
8 4
........
..####..
.##.###.
.##.###.
...

correct output
5
0
17
3

user output
(empty)

Test 2

Subtask: 1, 2, 3, 4, 5

Verdict: ACCEPTED

input
3 1
...
.#.
...
2 2 2 2

correct output
0

user output
0

Test 3

Subtask: 1, 5

Verdict:

input
199 196
.................................

correct output
468
605
825
532
496
...

user output
(empty)

Test 4

Subtask: 1, 5

Verdict:

input
200 200
.................................

correct output
112
347
142
459
239
...

user output
(empty)

Test 5

Subtask: 1, 3, 5

Verdict: ACCEPTED

input
200 200
.................................

correct output
381
544
94
532
98
...

user output
381
544
94
532
98
...

Test 6

Subtask: 1, 2, 4, 5

Verdict:

input
200 200
.................................

correct output
133
73
81
82
53
...

user output
(empty)

Test 7

Subtask: 1, 2, 4, 5

Verdict:

input
200 200
.................................

correct output
139
52
101
14
144
...

user output
(empty)

Test 8

Subtask: 1, 5

Verdict:

input
200 200
.................................

correct output
236
555
878
632
829
...

user output
(empty)

Test 9

Subtask: 1, 5

Verdict:

input
200 200
.................................

correct output
425
296
698
577
422
...

user output
(empty)

Test 10

Subtask: 1, 3, 4, 5

Verdict: ACCEPTED

input
200 200
.................................

correct output
1365
7284
11808
6136
9283
...

user output
1365
7284
11808
6136
9283
...

Test 11

Subtask: 1, 3, 5

Verdict: ACCEPTED

input
200 200
.................................

correct output
6292
17954
16728
8938
1335
...

user output
6292
17954
16728
8938
1335
...

Test 12

Subtask: 1, 4, 5

Verdict:

input
200 200
.................................

correct output
27
141
269
127
61
...

user output
(empty)

Test 13

Subtask: 1, 3, 4, 5

Verdict: ACCEPTED

input
200 200
.................................

correct output
19552
19544
19478
19402
19456
...

user output
19552
19544
19478
19402
19456
...

Test 14

Subtask: 1, 4, 5

Verdict:

input
200 200
.................................

correct output
17624
17515
17468
17689
17510
...

user output
(empty)

Test 15

Subtask: 1, 5

Verdict:

input
200 200
.................................

correct output
1584
1433
567
2248
1030
...

user output
(empty)

Test 16

Subtask: 1, 5

Verdict:

input
200 200
.................................

correct output
5872
6374
60
323
5311
...

user output
(empty)

Test 17

Subtask: 1, 5

Verdict:

input
200 200
.................................

correct output
1852
213
252
3861
1835
...

user output
(empty)

Test 18

Subtask: 1, 5

Verdict:

input
200 200
.................................

correct output
1564
2709
866
1318
1758
...

user output
(empty)

Test 19

Subtask: 2, 4, 5

Verdict:

input
997 100000
.................................

correct output
150
531
370
518
508
...

user output
(empty)

Test 20

Subtask: 2, 4, 5

Verdict:

input
1000 100000
.................................

correct output
390
278
783
1269
249
...

user output
(empty)

Test 21

Subtask: 2, 4, 5

Verdict:

input
1000 100000
.................................

correct output
63
142
813
683
731
...

user output
(empty)

Test 22

Subtask: 2, 4, 5

Verdict:

input
1000 100000
.................................

correct output
949
876
1209
494
1033
...

user output
(empty)

Test 23

Subtask: 3, 5

Verdict: ACCEPTED

input
997 100000
.................................

correct output
714
2683
3699
2085
7850
...

user output
714
2683
3699
2085
7850
...

Test 24

Subtask: 3, 5

Verdict: ACCEPTED

input
1000 100000
.................................

correct output
5081
1819
1050
4610
528
...

user output
5081
1819
1050
4610
528
...

Test 25

Subtask: 3, 5

Verdict: ACCEPTED

input
1000 100000
.................................

correct output
3554
6322
6648
2882
1490
...

user output
3554
6322
6648
2882
1490
...

Test 26

Subtask: 3, 5

Verdict: ACCEPTED

input
1000 100000
.................................

correct output
433976
81646
87810
48080
110879
...

user output
433976
81646
87810
48080
110879
...

Test 27

Subtask: 3, 4, 5

Verdict: ACCEPTED

input
1000 100000
.................................

correct output
207982
140036
208364
51912
56826
...

user output
207982
140036
208364
51912
56826
...

Test 28

Subtask: 3, 4, 5

Verdict: ACCEPTED

input
1000 100000
.................................

correct output
497525
497563
498000
496804
497335
...

user output
497525
497563
498000
496804
497335
...

Test 29

Subtask: 4, 5

Verdict:

input
1000 100000
.................................

correct output
38580
2097
9795
38033
1639
...

user output
(empty)

Test 30

Subtask: 4, 5

Verdict:

input
1000 100000
.................................

correct output
33
20900
25028
1782
13599
...

user output
(empty)

Test 31

Subtask: 4, 5

Verdict:

input
1000 100000
.................................

correct output
1421
1122
1840
834
443
...

user output
(empty)

Test 32

Subtask: 4, 5

Verdict:

input
1000 100000
.................................

correct output
1378
1751
2274
250
811
...

user output
(empty)

Test 33

Subtask: 4, 5

Verdict:

input
1000 100000
.................................

correct output
1126
886
544
223
272
...

user output
(empty)

Test 34

Subtask: 4, 5

Verdict:

input
1000 100000
.................................

correct output
327286
447779
447534
448307
446997
...

user output
(empty)

Test 35

Subtask: 5

Verdict:

input
1000 100000
.................................

correct output
2597
1473
1933
2691
1837
...

user output
(empty)

Test 36

Subtask: 5

Verdict:

input
1000 100000
.................................

correct output
553
4357
3147
6951
1573
...

user output
(empty)

Test 37

Subtask: 5

Verdict:

input
1000 100000
.................................

correct output
1723
2039
1871
5638
4256
...

user output
(empty)

Test 38

Subtask: 5

Verdict:

input
1000 100000
.................................

correct output
1546
704
2796
3802
1870
...

user output
(empty)

Test 39

Subtask: 5

Verdict:

input
1000 100000
.................................

correct output
3115
2042
2083
3227
740
...

user output
(empty)

Test 40

Subtask: 5

Verdict:

input
1000 100000
.................................

correct output
5222
3211
5230
1772
2310
...

user output
(empty)

Test 41

Subtask: 5

Verdict:

input
1000 100000
.................................

correct output
159214
68851
200821
141404
145704
...

user output
(empty)

Test 42

Subtask: 5

Verdict:

input
1000 100000
.................................

correct output
1843
25028
124430
84542
131339
...

user output
(empty)

Test 43

Subtask: 5

Verdict:

input
1000 100000
.................................

correct output
111206
75799
12026
142133
20483
...

user output
(empty)

Test 44

Subtask: 5

Verdict:

input
1000 100000
.................................

correct output
20360
9075
12187
54923
54574
...

user output
(empty)