Submission details
Task:Island
Sender:MRiekasius
Submission time:2026-04-16 13:28:40 +0300
Language:C++ (C++20)
Status:READY
Result:0
Feedback
subtaskverdictscore
#10
#20
#30
#40
#50
Test results
testverdicttimesubtask
#11.62 s1, 5details
#2ACCEPTED0.00 s1, 2, 3, 4, 5details
#31.49 s1, 5details
#41.65 s1, 5details
#5ACCEPTED0.01 s1, 3, 5details
#61.13 s1, 2, 4, 5details
#71.11 s1, 2, 4, 5details
#81.62 s1, 5details
#9--1, 5details
#10ACCEPTED0.01 s1, 3, 4, 5details
#11ACCEPTED0.01 s1, 3, 5details
#121.18 s1, 4, 5details
#13ACCEPTED0.01 s1, 3, 4, 5details
#141.66 s1, 4, 5details
#151.59 s1, 5details
#161.77 s1, 5details
#171.64 s1, 5details
#181.56 s1, 5details
#191.26 s2, 4, 5details
#201.17 s2, 4, 5details
#211.29 s2, 4, 5details
#221.41 s2, 4, 5details
#23--3, 5details
#24--3, 5details
#25--3, 5details
#26--3, 5details
#27--3, 4, 5details
#28--3, 4, 5details
#291.27 s4, 5details
#301.25 s4, 5details
#311.26 s4, 5details
#321.25 s4, 5details
#331.43 s4, 5details
#341.44 s4, 5details
#351.85 s5details
#36--5details
#37--5details
#381.84 s5details
#391.42 s5details
#401.65 s5details
#411.55 s5details
#421.43 s5details
#431.66 s5details
#441.46 s5details

Code

#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, q;
    cin >> n >> q;

    vector<bool> land(n *n, false);
    pair<int, int> lastLand;
    int landCount = 0;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            char x;
            cin >> x;
            if(x == '#'){
                land[i * n + j] = true;
                //lastLand = {i, j};
                landCount++;
            }
        }
    }
    landCount /= 2;

    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(land[i * n + j]){
                landCount--;
                if(landCount == 0) {
                    lastLand = {i, j};
                    goto foundRoot;
                }
            }
        }
    }
    foundRoot: int root = lastLand.first * n + lastLand.second;

    vector<bool> vis(n * n, false);
    vector<vector<int>> adj(n * n);
    vector<int> p(n*n, -1), dist(n*n, 0);
    stack<int> dfs;
    dfs.push(root);
    //cout << root << "\n";
    while(!dfs.empty()){
        int cur = dfs.top();
        dfs.pop();
        if(/*cur - n >= 0 &&*/ land[cur - n] && p[cur] != cur - n){
            dfs.push(cur - n);
            p[cur - n] = cur;
            adj[cur].push_back(cur - n);
            dist[cur - n] = dist[cur] + 1;
        }

        if(/*cur + n  < n * n  &&*/ land[cur + n] && p[cur] != cur + n){
            dfs.push(cur + n);
            p[cur + n] = cur;
            adj[cur].push_back(cur + n);
            dist[cur + n] = dist[cur] + 1;
        }
        if(/*cur % n != 0 && */ land[cur - 1] && p[cur] != cur -1){
            dfs.push(cur - 1);
            p[cur - 1] = cur;
            adj[cur].push_back(cur - 1);
            dist[cur - 1] = dist[cur] + 1;
        }
        if(/*cur % n != n - 1 &&*/ land[cur + 1] && p[cur] != cur + 1){
            dfs.push(cur + 1);
            p[cur + 1] = cur;
            adj[cur].push_back(cur + 1);
            dist[cur + 1] = dist[cur] + 1;
        }
    }
    /*for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++){
            cout << dist[i * n + j] << " ";
        }
        cout << "\n";
    }*/
    while(q--){
        int r1, c1, r2, c2;
        cin >> r1 >> c1 >> r2 >> c2;
        r1--;
        c1--;
        r2--;
        c2--;
        int vieta1 = r1 * n + c1, vieta2 = r2 * n + c2;
        if(dist[vieta1] < dist[vieta2]){
            swap(vieta1, vieta2);
        }
        int distTravelled = 0;
        while(true){
            while(dist[vieta1] > dist[vieta2]){
                vieta1 = p[vieta1];
                distTravelled++;
            }
            if(vieta1 == vieta2) break;
            vieta2 = p[vieta2];
            distTravelled++;
        }
        cout << distTravelled << "\n";
        /*vector<bool> pazymeta(n * n, false);
        int v1kilti = vieta1;
        while(true){
            pazymeta[v1kilti] = true;
            if(p[v1kilti] == -1) break;
            v1kilti = p[v1kilti];
        }
        int v2kilti = vieta2;
        while(!pazymeta[v2kilti]) v2kilti = p[v2kilti];
        cout << dist[vieta1] + dist[vieta2] - 2 * dist[v2kilti] << "\n";*/
    }


}

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:

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)