CSES - BOI 2026 Mirror Day 2

Submission details
Task:	Sort
Sender:	jsesok
Submission time:	2026-09-30 14:07:50 +0300
Language:	C++ (C++23)
Status:	READY
Result:	0

Feedback
subtask	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0
#4	TIME LIMIT EXCEEDED	0
#5	WRONG ANSWER	0
#6	WRONG ANSWER	0
#7	WRONG ANSWER	0

Test results
test	verdict	time	subtask
#1	WRONG ANSWER	0.00 s	2, 6, 7	details
#2	WRONG ANSWER	0.00 s	1, 2, 3, 6, 7	details
#3	WRONG ANSWER	0.00 s	2, 6, 7	details
#4	WRONG ANSWER	0.00 s	1, 2, 3, 6, 7	details
#5	WRONG ANSWER	0.00 s	1, 2, 3, 6, 7	details
#6	WRONG ANSWER	0.00 s	1, 2, 3, 6, 7	details
#7	WRONG ANSWER	0.00 s	1, 2, 3, 6, 7	details
#8	WRONG ANSWER	0.00 s	1, 2, 3, 6, 7	details
#9	WRONG ANSWER	0.00 s	1, 2, 3, 6, 7	details
#10	ACCEPTED	0.00 s	1, 2, 3, 6, 7	details
#11	WRONG ANSWER	0.00 s	2, 6, 7	details
#12	WRONG ANSWER	0.00 s	2, 6, 7	details
#13	WRONG ANSWER	0.00 s	2, 6, 7	details
#14	WRONG ANSWER	0.00 s	2, 6, 7	details
#15	WRONG ANSWER	0.00 s	2, 6, 7	details
#16	WRONG ANSWER	0.09 s	3, 7	details
#17	WRONG ANSWER	0.09 s	3, 7	details
#18	WRONG ANSWER	0.10 s	3, 7	details
#19	WRONG ANSWER	0.09 s	3, 7	details
#20	WRONG ANSWER	0.09 s	3, 7	details
#21	WRONG ANSWER	0.09 s	3, 7	details
#22	WRONG ANSWER	0.09 s	3, 7	details
#23	WRONG ANSWER	0.09 s	3, 7	details
#24	TIME LIMIT EXCEEDED	--	4, 7	details
#25	TIME LIMIT EXCEEDED	--	4, 7	details
#26	TIME LIMIT EXCEEDED	--	4, 7	details
#27	TIME LIMIT EXCEEDED	--	4, 7	details
#28	TIME LIMIT EXCEEDED	--	4, 7	details
#29	TIME LIMIT EXCEEDED	--	4, 7	details
#30	WRONG ANSWER	0.02 s	5, 6, 7	details
#31	WRONG ANSWER	0.01 s	5, 6, 7	details
#32	WRONG ANSWER	0.01 s	5, 6, 7	details
#33	WRONG ANSWER	0.07 s	5, 6, 7	details
#34	ACCEPTED	0.03 s	5, 6, 7	details
#35	WRONG ANSWER	0.06 s	5, 6, 7	details
#36	WRONG ANSWER	0.03 s	6, 7	details
#37	WRONG ANSWER	0.03 s	6, 7	details
#38	WRONG ANSWER	0.04 s	6, 7	details
#39	WRONG ANSWER	0.04 s	6, 7	details
#40	WRONG ANSWER	0.05 s	6, 7	details
#41	WRONG ANSWER	0.06 s	6, 7	details
#42	TIME LIMIT EXCEEDED	--	7	details
#43	TIME LIMIT EXCEEDED	--	7	details
#44	TIME LIMIT EXCEEDED	--	7	details
#45	TIME LIMIT EXCEEDED	--	7	details
#46	TIME LIMIT EXCEEDED	--	7	details
#47	TIME LIMIT EXCEEDED	--	7	details
#48	TIME LIMIT EXCEEDED	--	7	details
#49	TIME LIMIT EXCEEDED	--	7	details
#50	TIME LIMIT EXCEEDED	--	7	details
#51	TIME LIMIT EXCEEDED	--	7	details
#52	ACCEPTED	0.00 s	1, 2, 3, 5, 6, 7	details
#53	ACCEPTED	0.00 s	1, 2, 3, 4, 5, 6, 7	details
#54	ACCEPTED	0.00 s	2, 5, 6, 7	details
#55	WRONG ANSWER	0.00 s	1, 2, 3, 4, 6, 7	details
#56	WRONG ANSWER	0.00 s	1, 2, 3, 6, 7	details
#57	WRONG ANSWER	0.00 s	6, 7	details
#58	WRONG ANSWER	0.03 s	3, 4, 7	details
#59	WRONG ANSWER	0.03 s	3, 7	details
#60	WRONG ANSWER	0.00 s	2, 6, 7	details
#61	WRONG ANSWER	0.00 s	2, 6, 7	details
#62	WRONG ANSWER	0.00 s	2, 6, 7	details
#63	WRONG ANSWER	0.00 s	2, 6, 7	details
#64	WRONG ANSWER	0.00 s	2, 6, 7	details

Code

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, q;
    cin >> n >> q;

    vector<int> a(n);
    for (int &x : a) cin >> x;

    vector<int> sorted = a;
    sort(sorted.begin(), sorted.end());

    while (q--) {
        int p, s;
        cin >> p >> s;

        // Для 5-го сабтаска можно позволить O(n) на запрос.

        // Уже отсортирован?
        bool already = true;
        for (int i = 0; i < n; ++i) {
            if (a[i] != i + 1) {
                already = false;
                break;
            }
        }

        if (already) {
            cout << 0 << '\n';
            continue;
        }

        /*
            Сначала отдельно обрабатываем p+s <= n.
            Prefix и suffix не пересекаются.
        */
        if (p + s <= n) {
            bool possible = true;

            // Середину нельзя менять вообще.
            for (int i = p; i < n - s; ++i) {
                if (a[i] != i + 1) {
                    possible = false;
                    break;
                }
            }

            // В prefix должны находиться именно 1..p.
            if (possible) {
                for (int i = 0; i < p; ++i) {
                    if (a[i] > p) {
                        possible = false;
                        break;
                    }
                }
            }

            // В suffix должны находиться p+1..n
            // (с учётом неизменяемой середины проверка выше достаточна,
            // но оставим явную проверку).
            if (possible) {
                for (int i = n - s; i < n; ++i) {
                    if (a[i] <= n - s) {
                        possible = false;
                        break;
                    }
                }
            }

            if (!possible) {
                cout << -1 << '\n';
                continue;
            }

            int ans = 0;

            bool prefSorted = true;
            for (int i = 1; i < p; ++i) {
                if (a[i - 1] > a[i]) {
                    prefSorted = false;
                    break;
                }
            }

            bool suffSorted = true;
            for (int i = n - s + 1; i < n; ++i) {
                if (a[i - 1] > a[i]) {
                    suffSorted = false;
                    break;
                }
            }

            if (!prefSorted) ++ans;
            if (!suffSorted) ++ans;

            cout << ans << '\n';
            continue;
        }

        /*
            p+s > n.

            Разбиение:

               A       B       C
            [0,L)   [L,R)   [R,n)

            L = n-s
            R = p
            |B| = d = p+s-n
        */

        int L = n - s;
        int R = p;
        int d = R - L;

        /*
            Проверяем ответ 1.

            Одна prefix-sort работает iff всё после p
            уже находится на своих местах.

            Одна suffix-sort работает iff всё до n-s
            уже находится на своих местах.
        */

        bool oneP = true;
        for (int i = R; i < n; ++i) {
            if (a[i] != i + 1) {
                oneP = false;
                break;
            }
        }

        bool oneS = true;
        for (int i = 0; i < L; ++i) {
            if (a[i] != i + 1) {
                oneS = false;
                break;
            }
        }

        if (oneP || oneS) {
            cout << 1 << '\n';
            continue;
        }

        /*
            depthP:
            сколько P->S переходов требуется элементам,
            которые находятся слишком далеко слева.

            Элемент со значением x в A должен в итоге оказаться:
                x <= L       -> A
                L < x <= R   -> B
                x > R        -> C

            После каждого полного P,S "окно" доступных значений
            сдвигается на d.

            Для x в A:
                x > R + k*d
            означает, что требуется ещё один слой.
        */

        int needPS = 0;

        for (int i = 0; i < L; ++i) {
            int x = a[i];

            if (x > R) {
                int dist = x - R;

                int z = (dist + d - 1) / d;
                needPS = max(needPS, z);
            }
        }

        /*
            Аналогично справа.

            Если x <= L находится в C, ему нужно двигаться
            через S->P.

            Чем меньше x, тем больше слоёв.
        */

        int needSP = 0;

        for (int i = R; i < n; ++i) {
            int x = a[i];

            if (x <= L) {
                int dist = L - x + 1;

                int z = (dist + d - 1) / d;
                needSP = max(needSP, z);
            }
        }

        /*
            Теперь рассматриваем два варианта:

                P S P S ...
            или
                S P S P ...

            Но нужно также учесть локальную неотсортированность
            крайних частей.
        */

        bool needP = false;
        for (int i = 1; i < R; ++i) {
            if (a[i - 1] > a[i]) {
                needP = true;
                break;
            }
        }

        bool needS = false;
        for (int i = L + 1; i < n; ++i) {
            if (a[i - 1] > a[i]) {
                needS = true;
                break;
            }
        }

        int ans = INT_MAX;

        /*
            Начинаем с P.

            За t операций:
              количество P = (t+1)/2
              количество S = t/2

            Число переходов P->S = floor(t/2).
            Число переходов S->P = floor((t-1)/2).
        */

        for (int extra = 0; extra <= 4; ++extra) {
            int base = 2 * max(needPS, needSP) + extra;

            // P-first
            {
                int t = base;

                int cntP = (t + 1) / 2;
                int cntS = t / 2;

                int ps = t / 2;
                int sp = (t - 1) / 2;

                if (ps >= needPS &&
                    sp >= needSP &&
                    (!needP || cntP > 0) &&
                    (!needS || cntS > 0)) {
                    ans = min(ans, t);
                }
            }

            // S-first
            {
                int t = base;

                int cntS = (t + 1) / 2;
                int cntP = t / 2;

                int sp = t / 2;
                int ps = (t - 1) / 2;

                if (ps >= needPS &&
                    sp >= needSP &&
                    (!needP || cntP > 0) &&
                    (!needS || cntS > 0)) {
                    ans = min(ans, t);
                }
            }
        }

        cout << ans << '\n';
    }
}

Test details

Test 1

Subtask: 2, 6, 7

Verdict: WRONG ANSWER

input
`6 3 3 1 4 1 5 9 4 1 3 3 2 5` view save

correct output
`1 -1 2` view save

user output
`1 -1 3` view save

Feedback: Incorrect character on line 3 col 1: expected "2", got "3"

Test 2

Subtask: 1, 2, 3, 6, 7

Verdict: WRONG ANSWER

input
`2 1 548813503 548813503 1 1` view save

correct output
`0` view save

user output
`-1` view save

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

Test 3

Subtask: 2, 6, 7

Verdict: WRONG ANSWER

input
`1 1 417021999 1 1` view save

correct output
`0` view save

user output
`1` view save

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

Test 4

Subtask: 1, 2, 3, 6, 7

Verdict: WRONG ANSWER

input
`10 10 20751947 20751947 20751947 494...` view save

correct output
`-1 -1 1 1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 3 col 1: expected "1", got "-1"

Test 5

Subtask: 1, 2, 3, 6, 7

Verdict: WRONG ANSWER

input
`10 10 12780811 19475241 19475241 683...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

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

Test 6

Subtask: 1, 2, 3, 6, 7

Verdict: WRONG ANSWER

input
`10 10 14574963 14574963 14574963 864...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

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

Test 7

Subtask: 1, 2, 3, 6, 7

Verdict: WRONG ANSWER

input
`10 10 237541216 237541216 35036522 6...` view save

correct output
`-1 -1 -1 2 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 4 col 1: expected "2", got "-1"

Test 8

Subtask: 1, 2, 3, 6, 7

Verdict: WRONG ANSWER

input
`10 10 319425549 513116712 539199939 ...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 6 col 1: expected "1", got "-1"

Test 9

Subtask: 1, 2, 3, 6, 7

Verdict: WRONG ANSWER

input
`10 10 54363219 54363219 110986323 11...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

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

Test 10

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
`10 5 55687086 550701455 326656159 5...` view save

correct output
`-1 -1 -1 -1 -1` view save

user output
`-1 -1 -1 -1 -1` view save

Test 11

Subtask: 2, 6, 7

Verdict: WRONG ANSWER

input
`10 10 35889584 588130796 815837475 8...` view save

correct output
`-1 -1 1 1 1 ...` view save

user output
`-1 -1 -1 196043596 -1 ...` view save

Feedback: Incorrect character on line 3 col 1: expected "1", got "-1"

Test 12

Subtask: 2, 6, 7

Verdict: WRONG ANSWER

input
`10 10 679842175 48724877 720966351 6...` view save

correct output
`2 3 2 1 1 ...` view save

user output
`339921086 1598543724 720966344 1 1 ...` view save

Feedback: Incorrect character on line 1 col 1: expected "2", got "339921086"

Test 13

Subtask: 2, 6, 7

Verdict: WRONG ANSWER

input
`10 10 893310183 811950921 338863962 ...` view save

correct output
`2 1 1 2 5 ...` view save

user output
`255231480 1 1 446655090 1786620358 ...` view save

Feedback: Incorrect character on line 1 col 2: expected "2", got "255231480"

Test 14

Subtask: 2, 6, 7

Verdict: WRONG ANSWER

input
`10 10 221045363 282395847 441913686 ...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`63155816 -1 1 1 -1 ...` view save

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

Test 15

Subtask: 2, 6, 7

Verdict: WRONG ANSWER

input
`10 10 509019662 983949268 960017302 ...` view save

correct output
`3 -1 3 3 3 ...` view save

user output
`655966176 -1 655966176 399946916 999867286 ...` view save

Feedback: Incorrect character on line 1 col 1: expected "3", got "655966176"

Test 16

Subtask: 3, 7

Verdict: WRONG ANSWER

input
`200000 200000 2277053 2277053 2277053 227705...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 46 col 1: expected "2", got "-1"

Test 17

Subtask: 3, 7

Verdict: WRONG ANSWER

input
`200000 200000 6767 16596 16596 27202 37272 4...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 6 col 1: expected "1", got "-1"

Test 18

Subtask: 3, 7

Verdict: WRONG ANSWER

input
`200000 200000 5393 5910 9099 15755 15755 164...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 11 col 1: expected "2", got "-1"

Test 19

Subtask: 3, 7

Verdict: WRONG ANSWER

input
`200000 200000 3779 4629 8999 10468 22605 227...` view save

correct output
`-1 1 2 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 2 col 1: expected "1", got "-1"

Test 20

Subtask: 3, 7

Verdict: WRONG ANSWER

input
`200000 200000 878 2791 10849 11861 13405 239...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 13 col 1: expected "2", got "-1"

Test 21

Subtask: 3, 7

Verdict: WRONG ANSWER

input
`200000 200000 430 1479 1992 2829 7152 14093 ...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 98 col 1: expected "2", got "-1"

Test 22

Subtask: 3, 7

Verdict: WRONG ANSWER

input
`199997 200000 2733 10526 13882 14035 14689 3...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 20 col 1: expected "1", got "-1"

Test 23

Subtask: 3, 7

Verdict: WRONG ANSWER

input
`200000 200000 12345 13538 15407 18490 18984 ...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

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

Test 24

Subtask: 4, 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`-1 1 -1 -1 -1 ...` view save

user output
(empty)

Test 25

Subtask: 4, 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1 -1 1 -1 1 ...` view save

user output
(empty)

Test 26

Subtask: 4, 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 2 2 1 1 2 1 2 1 2 2 2 1 1 1 2 ...` view save

correct output
`4 3 2 2 6 ...` view save

user output
(empty)

Test 27

Subtask: 4, 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`0 0 0 0 0 ...` view save

user output
(empty)

Test 28

Subtask: 4, 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

correct output
`8513 1099 35939 9299 19597 ...` view save

user output
(empty)

Test 29

Subtask: 4, 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

correct output
`178345 169257 62115 96143 64796 ...` view save

user output
(empty)

Test 30

Subtask: 5, 6, 7

Verdict: WRONG ANSWER

input
`5000 5000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`1 1 -1 1 -1 ...` view save

user output
`1 1 -1 1 -1 ...` view save

Feedback: Incorrect character on line 11 col 1: expected "3", got "10"

Test 31

Subtask: 5, 6, 7

Verdict: WRONG ANSWER

input
`5000 5000 1 2 3 4 5 6 7 8 9 72 145 47 19...` view save

correct output
`-1 2 -1 2 -1 ...` view save

user output
`-1 2 -1 2 -1 ...` view save

Feedback: Incorrect character on line 14 col 1: expected "3", got "4"

Test 32

Subtask: 5, 6, 7

Verdict: WRONG ANSWER

input
`4999 5000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`-1 2 -1 -1 -1 ...` view save

user output
`-1 2 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 1036 col 1: expected "3", got "18"

Test 33

Subtask: 5, 6, 7

Verdict: WRONG ANSWER

input
`5000 5000 4033 4368 3086 3208 4313 388 8...` view save

correct output
`3 3 3 3 11 ...` view save

user output
`5 3 3 3 30 ...` view save

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

Test 34

Subtask: 5, 6, 7

Verdict: ACCEPTED

input
`5000 5000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` view save

Test 35

Subtask: 5, 6, 7

Verdict: WRONG ANSWER

input
`5000 5000 5000 4999 4998 4997 4996 4995 ...` view save

correct output
`2039 1910 -1 687 673 ...` view save

user output
`7926 8062 -1 4306 1308 ...` view save

Feedback: Incorrect character on line 1 col 1: expected "2039", got "7926"

Test 36

Subtask: 6, 7

Verdict: WRONG ANSWER

input
`5000 5000 202010 457852 826471 926337 10...` view save

correct output
`-1 -1 2 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 3 col 1: expected "2", got "-1"

Test 37

Subtask: 6, 7

Verdict: WRONG ANSWER

input
`5000 5000 190583 326486 431922 462939 72...` view save

correct output
`-1 -1 -1 -1 2 ...` view save

user output
`-1 -1 -1 -1 229134 ...` view save

Feedback: Incorrect character on line 5 col 2: expected "2", got "229134"

Test 38

Subtask: 6, 7

Verdict: WRONG ANSWER

input
`5000 5000 821998255 400550008 71790232 5...` view save

correct output
`5 3 3 2 5 ...` view save

user output
`2941090 2091984 1474884 469028 9008756 ...` view save

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

Test 39

Subtask: 6, 7

Verdict: WRONG ANSWER

input
`5000 5000 266174928 446601941 191252234 ...` view save

correct output
`3 3 414 4 3 ...` view save

user output
`781760 690756 333290006 2971378 416424 ...` view save

Feedback: Incorrect character on line 1 col 1: expected "3", got "781760"

Test 40

Subtask: 6, 7

Verdict: WRONG ANSWER

input
`5000 5000 11621 243915 243915 949123 137...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`2290800 357822666 28720962 -1 68452 ...` view save

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

Test 41

Subtask: 6, 7

Verdict: WRONG ANSWER

input
`5000 5000 999767052 998555066 997822810 ...` view save

correct output
`919 459 505 833 809 ...` view save

user output
`499881982 499881492 666510854 499882662 1999524918 ...` view save

Feedback: Incorrect character on line 1 col 1: expected "919", got "499881982"

Test 42

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 478025 478025 478025 478025 47...` view save

correct output
`-1 -1 2 2 2 ...` view save

user output
(empty)

Test 43

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 1810 2088 3022 3097 7459 7943 ...` view save

correct output
`2 -1 -1 2 -1 ...` view save

user output
(empty)

Test 44

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`199531 200000 11328 26391 30353 37063 44412 ...` view save

correct output
`-1 2 -1 2 2 ...` view save

user output
(empty)

Test 45

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 106738201 369187074 412614650 ...` view save

correct output
`2 12 3 19 3 ...` view save

user output
(empty)

Test 46

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 670611290 43427363 8475380 309...` view save

correct output
`3 5 3 3 3 ...` view save

user output
(empty)

Test 47

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 907542569 504758282 948727805 ...` view save

correct output
`3 33 3 3 3 ...` view save

user output
(empty)

Test 48

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 487056731 460461648 142698485 ...` view save

correct output
`3 3 3 3 3 ...` view save

user output
(empty)

Test 49

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 12772 23236 23236 23236 41149 ...` view save

correct output
`0 0 0 0 0 ...` view save

user output
(empty)

Test 50

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 999993539 999993361 999993361 ...` view save

correct output
`125375 16687 -1 84781 46147 ...` view save

user output
(empty)

Test 51

Subtask: 7

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 999993539 999993361 999993361 ...` view save

correct output
`94788 177608 95881 56377 179957 ...` view save

user output
(empty)

Test 52

Subtask: 1, 2, 3, 5, 6, 7

Verdict: ACCEPTED

input
`5 1 2 1 3 5 4 2 2` view save

correct output
`2` view save

user output
`2` view save

Test 53

Subtask: 1, 2, 3, 4, 5, 6, 7

Verdict: ACCEPTED

input
`2 1 1 2 1 1` view save

correct output
`0` view save

user output
`0` view save

Test 54

Subtask: 2, 5, 6, 7

Verdict: ACCEPTED

input
`4 1 2 1 4 3 3 2` view save

correct output
`2` view save

user output
`2` view save

Test 55

Subtask: 1, 2, 3, 4, 6, 7

Verdict: WRONG ANSWER

input
`10 10 1 1 1 1 2 2 1 1 2 2 7 1 2 6 4 5 ...` view save

correct output
`-1 1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 2 col 1: expected "1", got "-1"

Test 56

Subtask: 1, 2, 3, 6, 7

Verdict: WRONG ANSWER

input
`10 10 181777772 181777772 181777772 ...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 10 col 1: expected "1", got "-1"

Test 57

Subtask: 6, 7

Verdict: WRONG ANSWER

input
`100 10 92800811 524548163 939127795 9...` view save

correct output
`-1 -1 3 -1 3 ...` view save

user output
`-1 -1 35438784 -1 31220014 ...` view save

Feedback: Incorrect character on line 3 col 2: expected "3", got "35438784"

Test 58

Subtask: 3, 4, 7

Verdict: WRONG ANSWER

input
`100 100000 2 2 2 1 2 2 2 2 1 2 1 1 1 2 2 ...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 1401 col 1: expected "1", got "-1"

Test 59

Subtask: 3, 7

Verdict: WRONG ANSWER

input
`100 100000 172695325 172695325 172695325 ...` view save

correct output
`-1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 417 col 1: expected "1", got "-1"

Test 60

Subtask: 2, 6, 7

Verdict: WRONG ANSWER

input
`4 10 869194539 239439572 968540665 ...` view save

correct output
`-1 2 -1 -1 -1 ...` view save

user output
`-1 1738389072 -1 -1 -1 ...` view save

Feedback: Incorrect character on line 2 col 1: expected "2", got "1738389072"

Test 61

Subtask: 2, 6, 7

Verdict: WRONG ANSWER

input
`10 10 55366041 112170735 112170735 5...` view save

correct output
`-1 -1 2 1 1 ...` view save

user output
`-1 -1 1288016406 55366038 1 ...` view save

Feedback: Incorrect character on line 3 col 1: expected "2", got "1288016406"

Test 62

Subtask: 2, 6, 7

Verdict: WRONG ANSWER

input
`10 10 156018639 156018639 445832758 ...` view save

correct output
`-1 1 -1 -1 2 ...` view save

user output
`-1 1 -1 -1 297221834 ...` view save

Feedback: Incorrect character on line 5 col 2: expected "2", got "297221834"

Test 63

Subtask: 2, 6, 7

Verdict: WRONG ANSWER

input
`10 10 702507512 702507512 892090406 ...` view save

correct output
`-1 2 -1 2 2 ...` view save

user output
`-1 446045200 -1 594726932 234169168 ...` view save

Feedback: Incorrect character on line 2 col 1: expected "2", got "446045200"

Test 64

Subtask: 2, 6, 7

Verdict: WRONG ANSWER

input
`10 10 720324490 720324490 720324490 ...` view save

correct output
`-1 2 2 1 -1 ...` view save

user output
`-1 720324484 360162244 1 -1 ...` view save

Feedback: Incorrect character on line 2 col 1: expected "2", got "720324484"

BOI 2026 Mirror Day 2

Sort

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

Test 45

Test 46

Test 47

Test 48

Test 49

Test 50

Test 51

Test 52

Test 53

Test 54

Test 55

Test 56

Test 57

Test 58

Test 59

Test 60

Test 61

Test 62

Test 63

Test 64

Tasks

Submissions (jsesok)