Submission details
Task:Island
Sender:Daniel_1997
Submission time:2026-04-16 13:43:35 +0300
Language:C++ (C++17)
Status:READY
Result:0
Feedback
subtaskverdictscore
#10
#20
#30
#40
#50
Test results
testverdicttimesubtask
#1ACCEPTED0.01 s1, 5details
#2ACCEPTED0.01 s1, 2, 3, 4, 5details
#30.01 s1, 5details
#40.01 s1, 5details
#50.01 s1, 3, 5details
#60.01 s1, 2, 4, 5details
#70.01 s1, 2, 4, 5details
#80.01 s1, 5details
#90.01 s1, 5details
#100.01 s1, 3, 4, 5details
#110.01 s1, 3, 5details
#120.01 s1, 4, 5details
#130.01 s1, 3, 4, 5details
#140.01 s1, 4, 5details
#150.01 s1, 5details
#160.01 s1, 5details
#170.01 s1, 5details
#180.01 s1, 5details
#190.01 s2, 4, 5details
#200.01 s2, 4, 5details
#210.01 s2, 4, 5details
#220.01 s2, 4, 5details
#230.02 s3, 5details
#240.02 s3, 5details
#250.02 s3, 5details
#260.01 s3, 5details
#270.01 s3, 4, 5details
#280.01 s3, 4, 5details
#290.01 s4, 5details
#300.01 s4, 5details
#310.01 s4, 5details
#320.01 s4, 5details
#330.01 s4, 5details
#340.01 s4, 5details
#350.02 s5details
#360.02 s5details
#370.02 s5details
#380.02 s5details
#390.02 s5details
#400.02 s5details
#410.01 s5details
#420.01 s5details
#430.02 s5details
#440.02 s5details

Code

#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define pb push_back
#define int long long
#define all(x) x.begin(), x.end()
#define ios ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0)
 
const int oo = 1e18;
const int mod = 1e8 + 7;
const int my[8]={0, 0, 1, -1, 1, 1, -1, -1};
const int mx[8]={1, -1, 0, 0, 1, -1, -1, 1};

const int N = 1001;
vector<vector<bool> > visi(N + 1, vector<bool> (N + 1, 0));
vector<vector<int> > id(N + 1, vector<int> (N + 1, 0));
vector<int> d(N + 1,0);
vector<int> p(N + 1,0);

void bfs(int x1, int y1, const int& n, const vector<string>& v)
{
    queue<pair<int,int> > q;
    visi[x1][y1] = 1;
    q.push({x1, y1});

    while(!q.empty())
    {
        auto [x,y] = q.front();q.pop();

        for(int i = 0; i < 4; i++)
        {
            int nx = x + mx[i];
            int ny = y + my[i];

            if(nx >= 1 && ny >= 1 && nx <= n && ny <= n && !visi[nx][ny] && v[nx][ny] != '.')
            {
                d[id[nx][ny]] = d[id[x][y]] + 1;
                visi[nx][ny] = 1;
                p[id[nx][ny]] = id[x][y];
                q.push({nx, ny});
            }
        }
    }
} 

struct infeliz {
    vector<vector<int> >bl;
    infeliz(int n, const vector<int>& f)
    {
        bl.assign(31, vector<int>(n + 1));

        bl[0] = f;

        for(int i = 1; i <= 29; i++)
        {
            for(int j = 1; j <= n; j++)
            {
                bl[i][j] = bl[i - 1][bl[i - 1][j]];
            }
        }
    }

    int lca(int a,int b)
    {
        if(a == b) {
            return a;
        }
        if(d[a] > d[b]) {
            swap(a,b);
        }
 
        int dist = abs(d[a] - d[b]);
 
        for(int i = 0; i < 27; i++)
        {
            if(dist & (1 << i)) {
                b = bl[i][b];
            }
        }
        //cout << a << " " << b << endl;
 
        if(a == b) {
            return a;
        }
 
        for(int i = 26; i >= 0; i--) {
            int x = bl[i][a];
            int y = bl[i][b];
            if(x == y)continue;
            a = x;
            b = y;
        }
 
        return bl[0][a];

    }

};

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

    vector<string> v(n + 1);

    int ct = 0;

    for(int i = 1; i <= n; i++)
    {
        cin >> v[i];
        v[i] = '0' + v[i];
        for(int j = 1; j <= n; j++)
        {
            if(v[i][j] == '#')
            {
                id[i][j] = ct;
                //cerr << id[i][j] << endl;
                ct++;
            }
        }
    }



    
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            if(v[i][j] == '#')
            {
                p[id[i][j]] = id[i][j];
                bfs(i, j, n, v);
                break;
            }
        }
    }

    
    infeliz B(ct, p);

    while(q--)
    {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;

        int a = id[x1][y1];
        int b = id[x2][y2];
        int pa = B.lca(a,b);

        cout << abs(d[pa] - d[a]) + abs(d[pa] - d[b]) << endl;

    }


    
}
 
int32_t main() {
    ios;
    int t = 1;
    //cin >> t;
    while(t--)solve();
}

Test details

Test 1

Subtask: 1, 5

Verdict: ACCEPTED

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

correct output
5
0
17
3

user output
5
0
17
3

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:

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

correct output
381
544
94
532
98
...

user output
(empty)

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:

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

correct output
1365
7284
11808
6136
9283
...

user output
(empty)

Test 11

Subtask: 1, 3, 5

Verdict:

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

correct output
6292
17954
16728
8938
1335
...

user output
(empty)

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:

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

correct output
19552
19544
19478
19402
19456
...

user output
(empty)

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:

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

correct output
714
2683
3699
2085
7850
...

user output
(empty)

Test 24

Subtask: 3, 5

Verdict:

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

correct output
5081
1819
1050
4610
528
...

user output
(empty)

Test 25

Subtask: 3, 5

Verdict:

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

correct output
3554
6322
6648
2882
1490
...

user output
(empty)

Test 26

Subtask: 3, 5

Verdict:

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

correct output
433976
81646
87810
48080
110879
...

user output
(empty)

Test 27

Subtask: 3, 4, 5

Verdict:

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

correct output
207982
140036
208364
51912
56826
...

user output
(empty)

Test 28

Subtask: 3, 4, 5

Verdict:

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

correct output
497525
497563
498000
496804
497335
...

user output
(empty)

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)