Submission details
Task:Island
Sender:AKurlavicius
Submission time:2026-04-16 13:09:30 +0300
Language:C++ (C++20)
Status:READY
Result:0
Feedback
subtaskverdictscore
#10
#20
#30
#40
#50
Test results
testverdicttimesubtask
#10.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.06 s2, 4, 5details
#200.07 s2, 4, 5details
#210.06 s2, 4, 5details
#220.06 s2, 4, 5details
#230.07 s3, 5details
#240.07 s3, 5details
#250.07 s3, 5details
#260.06 s3, 5details
#270.06 s3, 4, 5details
#280.06 s3, 4, 5details
#290.06 s4, 5details
#300.07 s4, 5details
#310.06 s4, 5details
#320.06 s4, 5details
#330.07 s4, 5details
#340.06 s4, 5details
#350.07 s5details
#360.07 s5details
#370.07 s5details
#380.07 s5details
#390.07 s5details
#400.07 s5details
#410.06 s5details
#420.07 s5details
#430.07 s5details
#440.08 s5details

Code

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

int pry, prx, paby, pabx;

int bfs()
{
    bool lank[1001][1001];
    for (int i=0; i<=1000; i++)
        for (int j=0; j<=1000; j++)
            lank[i][j]=0;
    vector<pair<int, int>> kit;
    kit.push_back({prx, pry});
    lank[prx][pry]=1;
    int ans=0;
    while (!lank[pabx][paby])
    {
        ans++;
        vector<pair<int, int>> dab=kit;
        kit.clear();
        for (auto i:dab)
        {
            if (!lank[i.first+1][i.second])
            {
                lank[i.first+1][i.second]=1;
                kit.push_back({i.first+1, i.second});
            }
            if (!lank[i.first-1][i.second])
            {
                lank[i.first-1][i.second]=1;
                kit.push_back({i.first-1, i.second});
            }
            if (!lank[i.first][i.second+1])
            {
                lank[i.first][i.second+1]=1;
                kit.push_back({i.first, i.second+1});
            }
            if (!lank[i.first][i.second-1])
            {
                lank[i.first][i.second-1]=1;
                kit.push_back({i.first, i.second-1});
            }
        }
    }
    return ans;
}

int main()
{
    int n, q;
    cin>>n>>q;
    vector<int> k, d;
    k.push_back(-1);
    d.push_back(-1);
    for (int i=1; i<=n; i++)
    {
        k.push_back(-1);
        d.push_back(-1);
        char pirm='.', dab;
        for (int j=1; j<=n; j++)
        {
            cin>>dab;
            if (dab=='#' && pirm=='.')
                k[i]=j;
            else if (dab=='.' && pirm=='#')
                d[i]=j-1;
            pirm=dab;
        }
    }
    while (q--)
    {
        cin>>pry>>prx>>paby>>pabx;
        cout<<bfs()<<'\n';
    }
}

//8 4
//........
//..####..
//.######.
//.######.
//.#......
//.#####..
//..#####.
//........
//2 3 3 7
//4 5 4 5
//4 7 7 7
//6 2 3 2

Test details

Test 1

Subtask: 1, 5

Verdict:

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

correct output
5
0
17
3

user output
5
0
3
3

Feedback: Incorrect character on line 3 col 1: expected "17", got "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
216
151
155

Test 4

Subtask: 1, 5

Verdict:

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

correct output
112
347
142
459
239
...

user output
50
119
76
151
175
...

Error:
double free or corruption (out)

Test 5

Subtask: 1, 3, 5

Verdict:

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

correct output
381
544
94
532
98
...

user output
139
222
42
170
42
...

Test 6

Subtask: 1, 2, 4, 5

Verdict:

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

correct output
133
73
81
82
53
...

user output
133
73
81
82
53
...

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
110
89
126

Test 9

Subtask: 1, 5

Verdict:

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

correct output
425
296
698
577
422
...

user output
187

Test 10

Subtask: 1, 3, 4, 5

Verdict:

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

correct output
1365
7284
11808
6136
9283
...

user output
77
114
214
132
169
...

Test 11

Subtask: 1, 3, 5

Verdict:

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

correct output
6292
17954
16728
8938
1335
...

user output
44
98
168
112
87

Test 12

Subtask: 1, 4, 5

Verdict:

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

correct output
27
141
269
127
61
...

user output
27
93
143
127
61
...

Error:
malloc(): corrupted top size

Test 13

Subtask: 1, 3, 4, 5

Verdict:

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

correct output
19552
19544
19478
19402
19456
...

user output
246
238
220

Test 14

Subtask: 1, 4, 5

Verdict:

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

correct output
17624
17515
17468
17689
17510
...

user output
212
289

Test 15

Subtask: 1, 5

Verdict:

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

correct output
1584
1433
567
2248
1030
...

user output
112
115
105
44
58
...

Error:
munmap_chunk(): invalid pointer

Test 16

Subtask: 1, 5

Verdict:

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

correct output
5872
6374
60
323
5311
...

user output
162

Test 17

Subtask: 1, 5

Verdict:

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

correct output
1852
213
252
3861
1835
...

user output
114
143
116

Test 18

Subtask: 1, 5

Verdict:

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

correct output
1564
2709
866
1318
1758
...

user output
98

Test 19

Subtask: 2, 4, 5

Verdict:

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

correct output
150
531
370
518
508
...

user output
150

Test 20

Subtask: 2, 4, 5

Verdict:

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

correct output
390
278
783
1269
249
...

user output
390
278

Test 21

Subtask: 2, 4, 5

Verdict:

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

correct output
63
142
813
683
731
...

user output
63
142

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
53

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)

Error:
malloc(): corrupted top size

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
29
67
504

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
33
448

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
253

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
310