CSES - BOI 2026 Mirror Day 1

Submission details
Task:	Island
Sender:	MRiekasius
Submission time:	2026-04-16 10:30:14 +0300
Language:	C++ (C++20)
Status:	READY
Result:	10

Feedback
subtask	verdict	score
#1	ACCEPTED	10
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	0
#4	TIME LIMIT EXCEEDED	0
#5	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	subtask
#1	ACCEPTED	0.00 s	1, 5	details
#2	ACCEPTED	0.00 s	1, 2, 3, 4, 5	details
#3	ACCEPTED	0.23 s	1, 5	details
#4	ACCEPTED	0.24 s	1, 5	details
#5	ACCEPTED	0.19 s	1, 3, 5	details
#6	ACCEPTED	0.10 s	1, 2, 4, 5	details
#7	ACCEPTED	0.11 s	1, 2, 4, 5	details
#8	ACCEPTED	0.23 s	1, 5	details
#9	ACCEPTED	0.23 s	1, 5	details
#10	ACCEPTED	0.08 s	1, 3, 4, 5	details
#11	ACCEPTED	0.08 s	1, 3, 5	details
#12	ACCEPTED	0.17 s	1, 4, 5	details
#13	ACCEPTED	0.08 s	1, 3, 4, 5	details
#14	ACCEPTED	0.09 s	1, 4, 5	details
#15	ACCEPTED	0.14 s	1, 5	details
#16	ACCEPTED	0.18 s	1, 5	details
#17	ACCEPTED	0.21 s	1, 5	details
#18	ACCEPTED	0.24 s	1, 5	details
#19	TIME LIMIT EXCEEDED	--	2, 4, 5	details
#20	TIME LIMIT EXCEEDED	--	2, 4, 5	details
#21	TIME LIMIT EXCEEDED	--	2, 4, 5	details
#22	TIME LIMIT EXCEEDED	--	2, 4, 5	details
#23	TIME LIMIT EXCEEDED	--	3, 5	details
#24	TIME LIMIT EXCEEDED	--	3, 5	details
#25	TIME LIMIT EXCEEDED	--	3, 5	details
#26	TIME LIMIT EXCEEDED	--	3, 5	details
#27	TIME LIMIT EXCEEDED	--	3, 4, 5	details
#28	TIME LIMIT EXCEEDED	--	3, 4, 5	details
#29	TIME LIMIT EXCEEDED	--	4, 5	details
#30	TIME LIMIT EXCEEDED	--	4, 5	details
#31	TIME LIMIT EXCEEDED	--	4, 5	details
#32	TIME LIMIT EXCEEDED	--	4, 5	details
#33	TIME LIMIT EXCEEDED	--	4, 5	details
#34	TIME LIMIT EXCEEDED	--	4, 5	details
#35	TIME LIMIT EXCEEDED	--	5	details
#36	TIME LIMIT EXCEEDED	--	5	details
#37	TIME LIMIT EXCEEDED	--	5	details
#38	TIME LIMIT EXCEEDED	--	5	details
#39	TIME LIMIT EXCEEDED	--	5	details
#40	TIME LIMIT EXCEEDED	--	5	details
#41	TIME LIMIT EXCEEDED	--	5	details
#42	TIME LIMIT EXCEEDED	--	5	details
#43	TIME LIMIT EXCEEDED	--	5	details
#44	TIME LIMIT EXCEEDED	--	5	details

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<vector<bool>> land(n, vector<bool>(n, false));

    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            char x;
            cin >> x;
            if(x == '#') land[i][j] = true;
        }
    }

    vector<int> ans(q, -1);
    vector<pair<pair<int, int>, pair<int, int>>> queries(q);

    map<pair<int, int>, unordered_set<int>> queriesContainingThisDot;
    for(int i = 0; i < q; i++) {
        cin >> queries[i].first.first >> queries[i].first.second >> queries[i].second.first >> queries[i].second.second;
        queries[i].first.first--;
        queries[i].first.second--;
        queries[i].second.first--;
        queries[i].second.second--;
        queriesContainingThisDot[queries[i].first].insert(i);
        queriesContainingThisDot[queries[i].second].insert(i);
    }

    vector<vector<int>> DISTS(n, vector<int>(n));
    for(pair<pair<int, int>, unordered_set<int>> dot: queriesContainingThisDot){
        bool padareBFS = false;
        for(int query: dot.second){
            if(ans[query] != -1) continue;
            if(!padareBFS){
                for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) DISTS[i][j] = INT_MAX;
                DISTS[dot.first.first][dot.first.second] = 0;
                queue<pair<int, int>> bfs;
                bfs.push(dot.first);
                while(!bfs.empty()){
                    pair<int, int> x = bfs.front();
                    bfs.pop();

                    if(land[x.first - 1][x.second] && DISTS[x.first][x.second] + 1 < DISTS[x.first - 1][x.second]){
                        DISTS[x.first-1][x.second] = DISTS[x.first][x.second] + 1;
                        bfs.push({x.first-1, x.second});
                    }
                    if(land[x.first + 1][x.second] && DISTS[x.first][x.second] + 1 < DISTS[x.first + 1][x.second]){
                        DISTS[x.first + 1][x.second] = DISTS[x.first][x.second] + 1;
                        bfs.push({x.first + 1, x.second});
                    }
                    if(land[x.first][x.second - 1] && DISTS[x.first][x.second] + 1 < DISTS[x.first][x.second - 1]){
                        DISTS[x.first][x.second - 1] = DISTS[x.first][x.second] + 1;
                        bfs.push({x.first, x.second - 1});
                    }
                    if(land[x.first][x.second + 1] && DISTS[x.first][x.second] + 1 < DISTS[x.first][x.second + 1]){
                        DISTS[x.first][x.second + 1] = DISTS[x.first][x.second] + 1;
                        bfs.push({x.first, x.second + 1});
                    }
                }
            }
            pair<int, int> a, b;
            a = queries[query].first;
            b = queries[query].second;
            if(a == dot.first){
                ans[query] = DISTS[b.first][b.second];
            } else ans[query] = DISTS[a.first][a.second];
        }
    }
    for(auto i: ans) cout << i << "\n";

}

Test details

Test 1

Subtask: 1, 5

Verdict: ACCEPTED

input
`8 4 ........ ..####.. .##.###. .##.###. ...` view save

correct output
`5 0 17 3` view save

user output
`5 0 17 3` view save

Test 2

Subtask: 1, 2, 3, 4, 5

Verdict: ACCEPTED

input
`3 1 ... .#. ... 2 2 2 2` view save

correct output
`0` view save

user output
`0` view save

Test 3

Subtask: 1, 5

Verdict: ACCEPTED

input
`199 196 .................................` view save

correct output
`468 605 825 532 496 ...` view save

user output
`468 605 825 532 496 ...` view save

Test 4

Subtask: 1, 5

Verdict: ACCEPTED

input
`200 200 .................................` view save

correct output
`112 347 142 459 239 ...` view save

user output
`112 347 142 459 239 ...` view save

Test 5

Subtask: 1, 3, 5

Verdict: ACCEPTED

input
`200 200 .................................` view save

correct output
`381 544 94 532 98 ...` view save

user output
`381 544 94 532 98 ...` view save

Test 6

Subtask: 1, 2, 4, 5

Verdict: ACCEPTED

input
`200 200 .................................` view save

correct output
`133 73 81 82 53 ...` view save

user output
`133 73 81 82 53 ...` view save

Test 7

Subtask: 1, 2, 4, 5

Verdict: ACCEPTED

input
`200 200 .................................` view save

correct output
`139 52 101 14 144 ...` view save

user output
`139 52 101 14 144 ...` view save

Test 8

Subtask: 1, 5

Verdict: ACCEPTED

input
`200 200 .................................` view save

correct output
`236 555 878 632 829 ...` view save

user output
`236 555 878 632 829 ...` view save

Test 9

Subtask: 1, 5

Verdict: ACCEPTED

input
`200 200 .................................` view save

correct output
`425 296 698 577 422 ...` view save

user output
`425 296 698 577 422 ...` view save

Test 10

Subtask: 1, 3, 4, 5

Verdict: ACCEPTED

input
`200 200 .................................` view save

correct output
`1365 7284 11808 6136 9283 ...` view save

user output
`1365 7284 11808 6136 9283 ...` view save

Test 11

Subtask: 1, 3, 5

Verdict: ACCEPTED

input
`200 200 .................................` view save

correct output
`6292 17954 16728 8938 1335 ...` view save

user output
`6292 17954 16728 8938 1335 ...` view save

Test 12

Subtask: 1, 4, 5

Verdict: ACCEPTED

input
`200 200 .................................` view save

correct output
`27 141 269 127 61 ...` view save

user output
`27 141 269 127 61 ...` view save

Test 13

Subtask: 1, 3, 4, 5

Verdict: ACCEPTED

input
`200 200 .................................` view save

correct output
`19552 19544 19478 19402 19456 ...` view save

user output
`19552 19544 19478 19402 19456 ...` view save

Test 14

Subtask: 1, 4, 5

Verdict: ACCEPTED

input
`200 200 .................................` view save

correct output
`17624 17515 17468 17689 17510 ...` view save

user output
`17624 17515 17468 17689 17510 ...` view save

Test 15

Subtask: 1, 5

Verdict: ACCEPTED

input
`200 200 .................................` view save

correct output
`1584 1433 567 2248 1030 ...` view save

user output
`1584 1433 567 2248 1030 ...` view save

Test 16

Subtask: 1, 5

Verdict: ACCEPTED

input
`200 200 .................................` view save

correct output
`5872 6374 60 323 5311 ...` view save

user output
`5872 6374 60 323 5311 ...` view save

Test 17

Subtask: 1, 5

Verdict: ACCEPTED

input
`200 200 .................................` view save

correct output
`1852 213 252 3861 1835 ...` view save

user output
`1852 213 252 3861 1835 ...` view save

Test 18

Subtask: 1, 5

Verdict: ACCEPTED

input
`200 200 .................................` view save

correct output
`1564 2709 866 1318 1758 ...` view save

user output
`1564 2709 866 1318 1758 ...` view save

Test 19

Subtask: 2, 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`997 100000 .................................` view save

correct output
`150 531 370 518 508 ...` view save

user output
(empty)

Test 20

Subtask: 2, 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`390 278 783 1269 249 ...` view save

user output
(empty)

Test 21

Subtask: 2, 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`63 142 813 683 731 ...` view save

user output
(empty)

Test 22

Subtask: 2, 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`949 876 1209 494 1033 ...` view save

user output
(empty)

Test 23

Subtask: 3, 5

Verdict: TIME LIMIT EXCEEDED

input
`997 100000 .................................` view save

correct output
`714 2683 3699 2085 7850 ...` view save

user output
(empty)

Test 24

Subtask: 3, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`5081 1819 1050 4610 528 ...` view save

user output
(empty)

Test 25

Subtask: 3, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`3554 6322 6648 2882 1490 ...` view save

user output
(empty)

Test 26

Subtask: 3, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`433976 81646 87810 48080 110879 ...` view save

user output
(empty)

Test 27

Subtask: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`207982 140036 208364 51912 56826 ...` view save

user output
(empty)

Test 28

Subtask: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`497525 497563 498000 496804 497335 ...` view save

user output
(empty)

Test 29

Subtask: 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`38580 2097 9795 38033 1639 ...` view save

user output
(empty)

Test 30

Subtask: 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`33 20900 25028 1782 13599 ...` view save

user output
(empty)

Test 31

Subtask: 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`1421 1122 1840 834 443 ...` view save

user output
(empty)

Test 32

Subtask: 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`1378 1751 2274 250 811 ...` view save

user output
(empty)

Test 33

Subtask: 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`1126 886 544 223 272 ...` view save

user output
(empty)

Test 34

Subtask: 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`327286 447779 447534 448307 446997 ...` view save

user output
(empty)

Test 35

Subtask: 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`2597 1473 1933 2691 1837 ...` view save

user output
(empty)

Test 36

Subtask: 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`553 4357 3147 6951 1573 ...` view save

user output
(empty)

Test 37

Subtask: 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`1723 2039 1871 5638 4256 ...` view save

user output
(empty)

Test 38

Subtask: 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`1546 704 2796 3802 1870 ...` view save

user output
(empty)

Test 39

Subtask: 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`3115 2042 2083 3227 740 ...` view save

user output
(empty)

Test 40

Subtask: 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`5222 3211 5230 1772 2310 ...` view save

user output
(empty)

Test 41

Subtask: 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`159214 68851 200821 141404 145704 ...` view save

user output
(empty)

Test 42

Subtask: 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`1843 25028 124430 84542 131339 ...` view save

user output
(empty)

Test 43

Subtask: 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`111206 75799 12026 142133 20483 ...` view save

user output
(empty)

Test 44

Subtask: 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 100000 .................................` view save

correct output
`20360 9075 12187 54923 54574 ...` view save

user output
(empty)

BOI 2026 Mirror Day 1

Island

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Test 43

Test 44

Tasks

Submissions (MRiekasius)