Submission details
Task:Island
Sender:FZiuzin
Submission time:2026-04-16 13:52:08 +0300
Language:C++ (C++20)
Status:READY
Result:16
Feedback
subtaskverdictscore
#10
#20
#3ACCEPTED16
#40
#50
Test results
testverdicttimesubtask
#11.81 s1, 5details
#2ACCEPTED0.00 s1, 2, 3, 4, 5details
#31.64 s1, 5details
#41.65 s1, 5details
#5ACCEPTED0.02 s1, 3, 5details
#61.66 s1, 2, 4, 5details
#71.66 s1, 2, 4, 5details
#81.66 s1, 5details
#91.66 s1, 5details
#10ACCEPTED0.02 s1, 3, 4, 5details
#11ACCEPTED0.02 s1, 3, 5details
#121.98 s1, 4, 5details
#13ACCEPTED0.02 s1, 3, 4, 5details
#14--1, 4, 5details
#151.63 s1, 5details
#161.65 s1, 5details
#171.63 s1, 5details
#181.63 s1, 5details
#191.06 s2, 4, 5details
#201.06 s2, 4, 5details
#211.06 s2, 4, 5details
#221.60 s2, 4, 5details
#23ACCEPTED0.77 s3, 5details
#24ACCEPTED0.74 s3, 5details
#25ACCEPTED0.75 s3, 5details
#26ACCEPTED0.85 s3, 5details
#27ACCEPTED0.75 s3, 4, 5details
#28ACCEPTED0.76 s3, 4, 5details
#291.88 s4, 5details
#30--4, 5details
#311.76 s4, 5details
#321.66 s4, 5details
#331.61 s4, 5details
#34--4, 5details
#351.07 s5details
#361.07 s5details
#371.07 s5details
#381.73 s5details
#391.06 s5details
#401.14 s5details
#411.05 s5details
#421.06 s5details
#431.06 s5details
#441.23 s5details

Code

#include <bits/stdc++.h>

using namespace std;
#define int int64_t
#define all(a) a.begin(), a.end()
#define pb push_back

const int MAXN = 1005;
const int INF = 1e14;
const int LG = 30;

int ind[MAXN][MAXN];
int n,q;
bool left_wall = false;
vector<string> a;
vector<vector<int>> adj;
int dj[4] = {1, 0, -1, 0};
int di[4] = {0, 1, 0, -1};
int h[MAXN * MAXN];
int tin[MAXN * MAXN], tout[MAXN * MAXN], up[MAXN * MAXN][LG];
vector<int> rect = {-1, INF}; // pos i, end j
bool in(int i, int j)
{
    if (i >= 0 && i < n && j >= 0 && j < n)
    {
        return true;
    }
    return false;
}
int timer = 0;
void dfs(int node, int p, int he)
{
    tin[node] = timer++;
    up[node][0] = p;
    h[node] = he;
    for (int j = 1;j < LG;j++)
    {
        if (up[node][j - 1] == -1)
        {
            break;
        }
        up[node][j] = up[up[node][j - 1]][j - 1];
    }
    for (auto edge: adj[node])
    {
        if (edge == p)
        {
            continue;
        }
        dfs(edge, node, he + 1);
    }
    tout[node] = timer;
}
bool inc(int a, int b) // a includes b
{
    if (tin[a] <= tin[b] && tout[a] >= tout[b])
    {
        return true;
    }
    return false;
}
int lca(int a, int b)
{
    if (h[a] > h[b]) // b is lower
    {
        swap(a, b);
    }
    if (inc(a, b))
    {
        return a;
    }
    for (int j = LG -1 ;j >= 0;j--)
    {
        if (up[b][j] == -1)
        {
            continue;
        }
        if (inc(up[b][j], a))
        {
            continue;
        }
        b = up[b][j];
    }
    return up[b][0];
}
signed main()
{
    cin >> n >> q;
    a.resize(n);
    adj.resize(n * n);
    for (int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    int cnt = 0;
    for (int i = 0;i < n;i++)
    {
        for (int j = 0;j < n;j++)
        {
            ind[i][j] = cnt++;
        }
    }
    for (int i = 0;i < n * n;i++)
    {
        for (int j = 0;j < LG;j++)
        {
            up[i][j] = -1;
        }
    }
    int rt = -1;
    for (int i = 0;i < n;i++)
    {
        for (int j = 0; j < n;j++)
        {
            if (a[i][j] == '.')
            {
                continue;
            }
            rt = ind[i][j];
            for (int p = 0;p < 4;p++)
            {
                int ni = i + di[p];
                int nj = j + dj[p];
                if (in(ni, nj) && a[ni][nj] == '#')
                {
                    adj[ind[i][j]].pb(ind[ni][nj]);
                }
            }
        }
    }
    dfs(rt, -1, 0);
    //cout << "i, j " << rect[0] << " " << rect[1] << '\n'; 
    while (q--)
    {
        int ia,ja, ib, jb;
        cin >> ia >> ja >> ib >> jb;
        ia--,ja--,ib--,jb--;
        int A = ind[ia][ja];
        int B = ind[ib][jb];
        int lc = lca(A, B);
        cout << h[A] + h[B] - 2 * h[lc] << '\n';
    }
    return 0;
}


/*

5 1
.##..
.#...
####.
.....
.....
1 3 3 1

*/

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)