Submission details
Task:Island
Sender:jsesok
Submission time:2026-10-15 13:13:37 +0300
Language:C++ (C++23)
Status:READY
Result:0
Feedback
subtaskverdictscore
#10
#20
#30
#40
#50
Test results
testverdicttimesubtask
#10.00 s1, 5details
#2ACCEPTED0.00 s1, 2, 3, 4, 5details
#30.03 s1, 5details
#40.03 s1, 5details
#50.03 s1, 3, 5details
#60.03 s1, 2, 4, 5details
#70.03 s1, 2, 4, 5details
#80.03 s1, 5details
#90.03 s1, 5details
#100.03 s1, 3, 4, 5details
#110.03 s1, 3, 5details
#120.04 s1, 4, 5details
#130.03 s1, 3, 4, 5details
#140.03 s1, 4, 5details
#150.03 s1, 5details
#160.04 s1, 5details
#170.03 s1, 5details
#180.03 s1, 5details
#190.70 s2, 4, 5details
#200.65 s2, 4, 5details
#210.69 s2, 4, 5details
#221.09 s2, 4, 5details
#230.73 s3, 5details
#240.69 s3, 5details
#250.69 s3, 5details
#260.74 s3, 5details
#270.58 s3, 4, 5details
#280.58 s3, 4, 5details
#290.53 s4, 5details
#300.53 s4, 5details
#310.96 s4, 5details
#320.93 s4, 5details
#331.01 s4, 5details
#340.59 s4, 5details
#350.75 s5details
#360.73 s5details
#370.74 s5details
#380.74 s5details
#390.81 s5details
#400.79 s5details
#410.93 s5details
#420.93 s5details
#430.91 s5details
#440.86 s5details

Code

#include <iostream>
#include <vector>
#include <tuple>
#include <algorithm>
#include <numeric>
#include <queue>
#include <climits>
#include <map>
#include <unordered_map>
#include <stack>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
    int n, q, x, y, x2, y2, sum, r, st;
    pair<int, int> s, num;
    cin>>n>>q;
    vector<vector<char>> a(n, vector<char> (n));
    for (int i=0; i<n; ++i)
    {
        for (int j=0; j<n; ++j)
        {
            cin>>a[i][j];
            if (a[i][j]=='#')
            {
                s={i, j};
            }
        }
    }
    queue<pair<int, int>> qu;
    vector<vector<int>> d(n, vector<int> (n, -1));
    vector<vector<vector<pair<int, int>>>> p(n, vector<vector<pair<int, int>>> (n, vector<pair<int, int>> (30, {-1, -1})));
    vector<vector<vector<pair<int, int>>>> g(n, vector<vector<pair<int, int>>> (n));
    for (int i=1; i<n-1; ++i)
    {
        for (int j=1; j<n-1; ++j)
        {
            if (a[i][j]=='#')
            {
                if (a[i][j+1]=='#')
                {
                    g[i][j].push_back({i, j+1});
                }
                if (a[i][j-1]=='#')
                {
                    g[i][j].push_back({i, j-1});
                }
                if (a[i+1][j]=='#')
                {
                    g[i][j].push_back({i+1, j});
                }
                if (a[i-1][j]=='#')
                {
                    g[i][j].push_back({i-1, j});
                }
            }
        }
    }
    d[s.first][s.second]=0;
    p[s.first][s.second][0]=s;
    qu.push(s);
    while (!qu.empty())
    {
        for (auto [x, y] : g[qu.front().first][qu.front().second])
        {
            if (d[x][y]==-1)
            {
                d[x][y]=d[qu.front().first][qu.front().second]+1;
                p[x][y][0]={qu.front().first, qu.front().second};
                qu.push({x, y});
            }
        }
        qu.pop();
    }
    for (int i=1; i<30; ++i)
    {
        for (int j=0; j<n; ++j)
        {
            for (int z=0; z<n; ++z)
            {
                if (a[j][z]=='#')
                {
                    p[j][z][i]=p[p[j][z][i-1].first][p[j][z][i-1].second][i-1];
                }
            }
        }
    }
    for (int i=0; i<q; ++i)
    {
        cin>>x>>y>>x2>>y2;
        if (d[x][y]<d[x2][y2])
        {
            swap(x, x2);
            swap(y, y2);
        }
        st=1;
        for (int j=0; j<29; ++j)
            st*=2;
        r=d[x][y]-d[x2][y2];
        sum=r;
        for (int j=29; j>=0; --j)
        {
            if (st<=r)
            {
                r-=st;
                num=p[x][y][j];
                x=num.first;
                y=num.second;
            }
        }
        st=1;
        for (int j=0; j<29; ++j)
            st*=2;
        for (int j=29; j>=0; --j)
        {
            if (p[x][y][j]!=p[x2][y2][j])
            {
                sum+=st;
                num=p[x][y][j];
                x=num.first;
                y=num.second;
                num=p[x2][y2][j];
                x2=num.first;
                y2=num.second;
            }
        }
        cout<<sum<<"\n";
    }
    return 0;
}

Test details

Test 1

Subtask: 1, 5

Verdict:

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

correct output
5
0
17
3

user output
0
0
0
536870917

Feedback: Incorrect character on line 1 col 1: expected "5", got "0"

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)