Submission details
Task:Island
Sender:Valters07
Submission time:2026-04-17 10:13:36 +0300
Language:C++ (C++17)
Status:READY
Result:100
Feedback
subtaskverdictscore
#1ACCEPTED10
#2ACCEPTED6
#3ACCEPTED16
#4ACCEPTED28
#5ACCEPTED40
Test results
testverdicttimesubtask
#1ACCEPTED0.08 s1, 5details
#2ACCEPTED0.08 s1, 2, 3, 4, 5details
#3ACCEPTED0.09 s1, 5details
#4ACCEPTED0.09 s1, 5details
#5ACCEPTED0.09 s1, 3, 5details
#6ACCEPTED0.08 s1, 2, 4, 5details
#7ACCEPTED0.09 s1, 2, 4, 5details
#8ACCEPTED0.09 s1, 5details
#9ACCEPTED0.09 s1, 5details
#10ACCEPTED0.09 s1, 3, 4, 5details
#11ACCEPTED0.09 s1, 3, 5details
#12ACCEPTED0.09 s1, 4, 5details
#13ACCEPTED0.09 s1, 3, 4, 5details
#14ACCEPTED0.09 s1, 4, 5details
#15ACCEPTED0.09 s1, 5details
#16ACCEPTED0.09 s1, 5details
#17ACCEPTED0.09 s1, 5details
#18ACCEPTED0.09 s1, 5details
#19ACCEPTED0.20 s2, 4, 5details
#20ACCEPTED0.19 s2, 4, 5details
#21ACCEPTED0.20 s2, 4, 5details
#22ACCEPTED0.23 s2, 4, 5details
#23ACCEPTED0.52 s3, 5details
#24ACCEPTED0.52 s3, 5details
#25ACCEPTED0.53 s3, 5details
#26ACCEPTED0.46 s3, 5details
#27ACCEPTED0.41 s3, 4, 5details
#28ACCEPTED0.39 s3, 4, 5details
#29ACCEPTED0.31 s4, 5details
#30ACCEPTED0.31 s4, 5details
#31ACCEPTED0.27 s4, 5details
#32ACCEPTED0.27 s4, 5details
#33ACCEPTED0.26 s4, 5details
#34ACCEPTED0.39 s4, 5details
#35ACCEPTED0.50 s5details
#36ACCEPTED0.51 s5details
#37ACCEPTED0.52 s5details
#38ACCEPTED0.52 s5details
#39ACCEPTED0.47 s5details
#40ACCEPTED0.48 s5details
#41ACCEPTED0.49 s5details
#42ACCEPTED0.49 s5details
#43ACCEPTED0.50 s5details
#44ACCEPTED0.52 s5details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:88:9: warning: unused variable 'st' [-Wunused-variable]
   88 |     int st[2] = {-1, -1};
      |         ^~

Code

#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#define fio ios_base::sync_with_stdio(0);cin.tie(0);
#define ll long long
#define ld long double
#define en exit(0);
#define pb push_back
#define fi first
#define se second
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1005;
const int M = 1e6 + 5;
const int LOG = log2(M) + 2;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
char gr[N][N];
set<int> g[2][M];
int id[2][N][N], idc[2];
int par[2][M][LOG], tin[2][M], tout[2][M], tt[2];
int dist[2][M], n;
void dfs(int u, int p, int t)
{
    tin[t][u] = ++tt[t];
    par[t][u][0] = p;
    for(int i = 1;i < LOG;i++)
        par[t][u][i] = par[t][par[t][u][i - 1]][i - 1];
    for(auto v : g[t][u])
    {
        if(v != p)
        {
            dist[t][v] = dist[t][u] + 1;
            dfs(v, u, t);
        }
    }
    tout[t][u] = tt[t];
}
bool is_anc(int u, int v, int t)
{
    return (tin[t][u] <= tin[t][v] && tout[t][v] <= tout[t][u]);
}
int get_lca(int u, int v, int t)
{
    if(is_anc(u, v, t)) return u;
    if(is_anc(v, u, t)) return v;
    for(int i = LOG - 1;i >= 0;i--)
        if(!is_anc(par[t][u][i], v, t))
            u = par[t][u][i];
    return par[t][u][0];
}
int get_dist(int u, int v, int t)
{
    int lca = get_lca(u, v, t);
    return dist[t][u] + dist[t][v] - 2 * dist[t][lca];
}
void con(int u, int v, int t)
{
    if(u == v)
        return;
    g[t][u].insert(v);
    g[t][v].insert(u);
}
int main()
{
    fio
//    ifstream cin("in.in");
    int q;
    cin >> n >> q;
    for(int i = 1;i <= n;i++)
    {
        for(int j = 1;j <= n;j++)
        {
            cin >> gr[i][j];
            if(gr[i][j] == '#')
            {
                if(gr[i - 1][j] == '#')
                    id[0][i][j] = id[0][i - 1][j];
                else
                    id[0][i][j] = ++idc[0];
                if(gr[i][j - 1] == '#')
                    id[1][i][j] = id[1][i][j - 1];
                else
                    id[1][i][j] = ++idc[1];
            }
        }
    }
    int st[2] = {-1, -1};
    for(int i = 1;i <= n;i++)
    {
        for(int j = 1;j <= n;j++)
        {
            if(gr[i][j] != '#')
                continue;
            for(int d = 0;d < 4;d++)
            {
                int nwx = i + dx[d], nwy = j + dy[d];
                if(!(1 <= nwx && nwx <= n && 1 <= nwy && nwy <= n))
                    continue;
                if(gr[nwx][nwy] != '#')
                    continue;
                bool t = (d < 2);
                con(id[t][i][j], id[t][nwx][nwy], t);
            }
        }
    }
    dfs(1, 1, 0); // cols
    dfs(1, 1, 1); // rows
    while(q--)
    {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        int d1 = get_dist(id[0][x1][y1], id[0][x2][y2], 0);
        int d2 = get_dist(id[1][x1][y1], id[1][x2][y2], 1);
        cout << d1 + d2 << "\n";
    }
    return 0;
}

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: ACCEPTED

input
199 196
.................................

correct output
468
605
825
532
496
...

user output
468
605
825
532
496
...

Test 4

Subtask: 1, 5

Verdict: ACCEPTED

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

correct output
112
347
142
459
239
...

user output
112
347
142
459
239
...

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: ACCEPTED

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: ACCEPTED

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

correct output
139
52
101
14
144
...

user output
139
52
101
14
144
...

Test 8

Subtask: 1, 5

Verdict: ACCEPTED

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

correct output
236
555
878
632
829
...

user output
236
555
878
632
829
...

Test 9

Subtask: 1, 5

Verdict: ACCEPTED

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

correct output
425
296
698
577
422
...

user output
425
296
698
577
422
...

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: ACCEPTED

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

correct output
27
141
269
127
61
...

user output
27
141
269
127
61
...

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: ACCEPTED

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

correct output
17624
17515
17468
17689
17510
...

user output
17624
17515
17468
17689
17510
...

Test 15

Subtask: 1, 5

Verdict: ACCEPTED

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

correct output
1584
1433
567
2248
1030
...

user output
1584
1433
567
2248
1030
...

Test 16

Subtask: 1, 5

Verdict: ACCEPTED

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

correct output
5872
6374
60
323
5311
...

user output
5872
6374
60
323
5311
...

Test 17

Subtask: 1, 5

Verdict: ACCEPTED

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

correct output
1852
213
252
3861
1835
...

user output
1852
213
252
3861
1835
...

Test 18

Subtask: 1, 5

Verdict: ACCEPTED

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

correct output
1564
2709
866
1318
1758
...

user output
1564
2709
866
1318
1758
...

Test 19

Subtask: 2, 4, 5

Verdict: ACCEPTED

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

correct output
150
531
370
518
508
...

user output
150
531
370
518
508
...

Test 20

Subtask: 2, 4, 5

Verdict: ACCEPTED

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

correct output
390
278
783
1269
249
...

user output
390
278
783
1269
249
...

Test 21

Subtask: 2, 4, 5

Verdict: ACCEPTED

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

correct output
63
142
813
683
731
...

user output
63
142
813
683
731
...

Test 22

Subtask: 2, 4, 5

Verdict: ACCEPTED

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

correct output
949
876
1209
494
1033
...

user output
949
876
1209
494
1033
...

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: ACCEPTED

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

correct output
38580
2097
9795
38033
1639
...

user output
38580
2097
9795
38033
1639
...

Test 30

Subtask: 4, 5

Verdict: ACCEPTED

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

correct output
33
20900
25028
1782
13599
...

user output
33
20900
25028
1782
13599
...

Test 31

Subtask: 4, 5

Verdict: ACCEPTED

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

correct output
1421
1122
1840
834
443
...

user output
1421
1122
1840
834
443
...

Test 32

Subtask: 4, 5

Verdict: ACCEPTED

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

correct output
1378
1751
2274
250
811
...

user output
1378
1751
2274
250
811
...

Test 33

Subtask: 4, 5

Verdict: ACCEPTED

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

correct output
1126
886
544
223
272
...

user output
1126
886
544
223
272
...

Test 34

Subtask: 4, 5

Verdict: ACCEPTED

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

correct output
327286
447779
447534
448307
446997
...

user output
327286
447779
447534
448307
446997
...

Test 35

Subtask: 5

Verdict: ACCEPTED

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

correct output
2597
1473
1933
2691
1837
...

user output
2597
1473
1933
2691
1837
...

Test 36

Subtask: 5

Verdict: ACCEPTED

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

correct output
553
4357
3147
6951
1573
...

user output
553
4357
3147
6951
1573
...

Test 37

Subtask: 5

Verdict: ACCEPTED

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

correct output
1723
2039
1871
5638
4256
...

user output
1723
2039
1871
5638
4256
...

Test 38

Subtask: 5

Verdict: ACCEPTED

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

correct output
1546
704
2796
3802
1870
...

user output
1546
704
2796
3802
1870
...

Test 39

Subtask: 5

Verdict: ACCEPTED

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

correct output
3115
2042
2083
3227
740
...

user output
3115
2042
2083
3227
740
...

Test 40

Subtask: 5

Verdict: ACCEPTED

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

correct output
5222
3211
5230
1772
2310
...

user output
5222
3211
5230
1772
2310
...

Test 41

Subtask: 5

Verdict: ACCEPTED

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

correct output
159214
68851
200821
141404
145704
...

user output
159214
68851
200821
141404
145704
...

Test 42

Subtask: 5

Verdict: ACCEPTED

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

correct output
1843
25028
124430
84542
131339
...

user output
1843
25028
124430
84542
131339
...

Test 43

Subtask: 5

Verdict: ACCEPTED

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

correct output
111206
75799
12026
142133
20483
...

user output
111206
75799
12026
142133
20483
...

Test 44

Subtask: 5

Verdict: ACCEPTED

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

correct output
20360
9075
12187
54923
54574
...

user output
20360
9075
12187
54923
54574
...