CSES - BOI 2026 Mirror Day 1

Submission details
Task:	Blocks
Sender:	jsesok
Submission time:	2026-08-24 16:00:29 +0300
Language:	C++ (C++23)
Status:	READY
Result:	4

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

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

Code

#include <iostream>
#include <numeric>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <queue>
using namespace std;
vector<int> ans;
void f(int n, vector<int> & rez, vector<int> & kol, int k, int s, vector<int> & sum)
{
    if (ans[0]!=-1)
        return;
    if (((int) rez.size())==n)
    {
        vector<int> sum2(k, 0), kopy=rez;
        for (int i=0; i<n; ++i)
        {
            if (rez[i]!=-1)
                sum2[rez[i]]+=i+1;
        }
        for (int i=0; i<k; ++i)
        {
            if (sum2[i]>=(n+1)*kol[i]/2 || (n+1)*kol[i]/2-sum2[i]>n)
            {
                rez=kopy;
                return;
            }
            rez[(n+1)*kol[i]/2-sum2[i]-1]=i;
        }
        for (int i : rez)
        {
            if (i==-1)
            {
                rez=kopy;
                return;
            }
        }
        ans=rez;
    }
    else
    {
        int can=0;
        for (int i=0; i<k; ++i)
        {
            if (kol[i]==sum[i]+1)
            {
                can+=1;
            }
            else
            {
                sum[i]+=1;
                rez.push_back(i);
                f(n, rez, kol, k, s, sum);
                rez.pop_back();
                sum[i]-=1;
            }
        }
        if (can>s)
        {
            rez.push_back(-1);
            f(n, rez, kol, k, s+1, sum);
            rez.pop_back();
        }
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(0);
    int t, n, k, c, zn;
    cin>>t;
    for (int _=0; _<t; ++_)
    {
        ans={-1};
        vector<int> rez={};
        cin>>n>>k;
        vector<int> kol(k, 0), sum(k, 0);
        for (int i=0; i<n; ++i)
        {
            cin>>c;
            kol[c-1]+=1;
        }
        if (n%2==0)
        {
            zn=1;
            for (int i=0; i<k; ++i)
            {
                if (kol[i]%2==1)
                {
                    zn=0;
                    break;
                }
            }
            if (zn==0)
            {
                cout<<"NO\n";
                continue;
            }
        }
        f(n, rez, kol, k, 0, sum);
        if (ans[0]==-1)
        {
            cout<<"NO\n";
        }
        else
        {
            cout<<"YES\n"<<ans[0]+1;
            for (int i=1; i<n; ++i)
                cout<<" "<<ans[i]+1;
            cout<<"\n";
        }
    }
    return 0;
}

Test details

Test 1

Subtask: 2, 5, 6

Verdict: ACCEPTED

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

correct output
`YES 1 2 2 1 1 1 2 NO YES 1 1` view save

user output
`YES 1 1 2 2 2 1 1 NO YES 1 1` view save

Test 2

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

Verdict: ACCEPTED

input
`1 1 1 1` view save

correct output
`YES 1` view save

user output
`YES 1` view save

Test 3

Subtask: 1, 2, 4, 5, 6

Verdict: ACCEPTED

input
`1 2 2 1 2` view save

correct output
`NO` view save

user output
`NO` view save

Test 4

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

Verdict: ACCEPTED

input
`1 2 1 1 1` view save

correct output
`YES 1 1` view save

user output
`YES 1 1` view save

Test 5

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

Verdict: ACCEPTED

input
`1 3 1 1 1 1` view save

correct output
`YES 1 1 1` view save

user output
`YES 1 1 1` view save

Test 6

Subtask: 1, 2, 3, 5, 6

Verdict: ACCEPTED

input
`1 3 2 2 1 2` view save

correct output
`YES 2 1 2` view save

user output
`YES 2 1 2` view save

Test 7

Subtask: 1, 2, 4, 5, 6

Verdict: ACCEPTED

input
`1 3 3 1 2 3` view save

correct output
`NO` view save

user output
`NO` view save

Test 8

Subtask: 2, 3, 4, 5, 6

Verdict: ACCEPTED

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

correct output
`YES 1 2 2 1` view save

user output
`YES 1 2 2 1` view save

Test 9

Subtask: 2, 3, 5, 6

Verdict: ACCEPTED

input
`1 5 2 2 1 2 1 2` view save

correct output
`YES 1 2 2 2 1` view save

user output
`YES 1 2 2 2 1` view save

Test 10

Subtask: 2, 3, 4, 5, 6

Verdict: ACCEPTED

input
`1 5 1 1 1 1 1 1` view save

correct output
`YES 1 1 1 1 1` view save

user output
`YES 1 1 1 1 1` view save

Test 11

Subtask: 2, 4, 5, 6

Verdict: ACCEPTED

input
`1 10 2 1 2 2 1 2 1 2 1 2 1` view save

correct output
`NO` view save

user output
`NO` view save

Test 12

Subtask: 2, 5, 6

Verdict: ACCEPTED

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

correct output
`NO` view save

user output
`NO` view save

Test 13

Subtask: 2, 3, 4, 5, 6

Verdict: ACCEPTED

input
`1 14 7 2 3 4 4 6 3 5 7 7 6 1 2 1 5` view save

correct output
`YES 1 7 5 6 4 3 2 2 3 4 6 5 7 1` view save

user output
`YES 1 2 3 4 5 6 7 7 6 5 4 3 2 1` view save

Test 14

Subtask: 2, 5, 6

Verdict: ACCEPTED

input
`1 14 7 7 1 2 3 6 1 7 4 2 5 3 5 5 6` view save

correct output
`NO` view save

user output
`NO` view save

Test 15

Subtask: 2, 5, 6

Verdict: ACCEPTED

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

correct output
`NO` view save

user output
`NO` view save

Test 16

Subtask: 2, 4, 5, 6

Verdict: ACCEPTED

input
`1 15 3 2 2 1 1 2 2 3 1 1 3 1 3 3 2 3` view save

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

user output
`YES 1 1 2 2 2 3 3 3 3 3 1 1 2 1 2` view save

Test 17

Subtask: 2, 3, 4, 5, 6

Verdict: ACCEPTED

input
`1 15 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1` view save

correct output
`YES 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1` view save

user output
`YES 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1` view save

Test 18

Subtask: 2, 5, 6

Verdict: ACCEPTED

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

correct output
`NO` view save

user output
`NO` view save

Test 19

Subtask: 2, 5, 6

Verdict: ACCEPTED

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

correct output
`YES 5 1 1 4 2 3 3 6 2 2 3 4 1 1 5` view save

user output
`YES 1 1 2 3 4 5 3 6 2 5 4 2 3 1 1` view save

Test 20

Subtask: 3, 4, 6

Verdict: TIME LIMIT EXCEEDED

input
`1 200000 100000 41274 72445 8195 89156 8309 52...` view save

correct output
`YES 56657 98790 6783 99959 46986 3...` view save

user output
(empty)

Test 21

Subtask: 3, 4, 6

Verdict: TIME LIMIT EXCEEDED

input
`1 200000 50000 11371 7307 32180 19963 36192 1...` view save

correct output
`YES 23060 23060 30821 30821 6516 6...` view save

user output
(empty)

Test 22

Subtask: 3, 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

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

correct output
`YES 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

user output
(empty)

Test 23

Subtask: 3, 4, 5, 6

Verdict: RUNTIME ERROR

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

correct output
`YES 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
(empty)

Test 24

Subtask: 4, 6

Verdict: ACCEPTED

input
`1 200000 200000 81478 107278 105420 174048 289...` view save

correct output
`NO` view save

user output
`NO` view save

Test 25

Subtask: 4, 6

Verdict: ACCEPTED

input
`1 199998 66666 11893 41083 9602 37023 17558 5...` view save

correct output
`NO` view save

user output
`NO` view save

Test 26

Subtask: 3, 4, 5, 6

Verdict: RUNTIME ERROR

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

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

user output
(empty)

Test 27

Subtask: 4, 6

Verdict: TIME LIMIT EXCEEDED

input
`1 199995 66665 23438 10740 28920 10902 37608 ...` view save

correct output
`YES 28038 26368 5479 35821 63638 2...` view save

user output
(empty)

Test 28

Subtask: 4, 5, 6

Verdict: RUNTIME ERROR

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

correct output
`YES 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

user output
(empty)

Test 29

Subtask: 4, 6

Verdict: TIME LIMIT EXCEEDED

input
`1 199995 199995 98848 21787 95908 35825 145110...` view save

correct output
`NO` view save

user output
(empty)

Test 30

Subtask: 3, 4, 5, 6

Verdict: RUNTIME ERROR

input
`1 199995 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`YES 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
(empty)

Test 31

Subtask: 6

Verdict: ACCEPTED

input
`1 199996 66666 58102 41937 44066 50719 64212 ...` view save

correct output
`NO` view save

user output
`NO` view save

Test 32

Subtask: 6

Verdict: TIME LIMIT EXCEEDED

input
`1 199997 66667 64994 35732 65333 29671 5745 4...` view save

correct output
`NO` view save

user output
(empty)

Test 33

Subtask: 6

Verdict: TIME LIMIT EXCEEDED

input
`1 179999 599 62 356 235 202 311 370 325 84 ...` view save

correct output
`YES 331 331 331 331 331 331 331 33...` view save

user output
(empty)

Test 34

Subtask: 5, 6

Verdict: TIME LIMIT EXCEEDED

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

correct output
`YES 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

user output
(empty)

Test 35

Subtask: 6

Verdict: TIME LIMIT EXCEEDED

input
`1 199999 51 20 38 45 24 3 40 21 1 18 10 36...` view save

correct output
`YES 46 46 46 46 46 46 46 46 46 46 ...` view save

user output
(empty)

Test 36

Subtask: 6

Verdict: TIME LIMIT EXCEEDED

input
`1 199999 10001 4645 6143 5426 3796 8646 9815 ...` view save

correct output
`YES 4536 4536 4536 4536 2089 2089 ...` view save

user output
(empty)

Test 37

Subtask: 6

Verdict: TIME LIMIT EXCEEDED

input
`1 199999 86578 37361 14324 34552 49344 77757 ...` view save

correct output
`NO` view save

user output
(empty)

Test 38

Subtask: 5, 6

Verdict: TIME LIMIT EXCEEDED

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

correct output
`NO` view save

user output
(empty)

Test 39

Subtask: 6

Verdict: TIME LIMIT EXCEEDED

input
`1 199999 52 9 2 4 42 45 52 40 38 51 21 27 ...` view save

correct output
`NO` view save

user output
(empty)

Test 40

Subtask: 6

Verdict: TIME LIMIT EXCEEDED

input
`1 199999 10002 4020 9144 2560 8443 418 7212 7...` view save

correct output
`NO` view save

user output
(empty)

Test 41

Subtask: 6

Verdict: TIME LIMIT EXCEEDED

input
`1 199999 86251 39385 78288 43911 67919 84237 ...` view save

correct output
`NO` view save

user output
(empty)

Test 42

Subtask: 3, 6

Verdict: TIME LIMIT EXCEEDED

input
`1 180299 600 22 518 108 303 281 289 12 558 ...` view save

correct output
`YES 72 72 72 72 72 72 72 72 72 72 ...` view save

user output
(empty)

Test 43

Subtask: 6

Verdict: TIME LIMIT EXCEEDED

input
`1 199999 66667 20668 50081 49781 19019 15896 ...` view save

correct output
`YES 51630 65011 37598 48090 36015 ...` view save

user output
(empty)

Test 44

Subtask: 6

Verdict: TIME LIMIT EXCEEDED

input
`1 19999 6667 1986 3956 1623 1323 4207 6379 ...` view save

correct output
`YES 1983 1223 3134 733 1608 2137 3...` view save

user output
(empty)

Test 45

Subtask: 6

Verdict: TIME LIMIT EXCEEDED

input
`1 1999 667 549 405 635 315 596 557 241 42...` view save

correct output
`YES 385 164 342 20 313 308 401 656...` view save

user output
(empty)

Test 46

Subtask: 6

Verdict: TIME LIMIT EXCEEDED

input
`1 199 67 10 54 26 5 16 33 47 3 51 64 47...` view save

correct output
`YES 19 45 37 35 17 24 30 48 22 8 3...` view save

user output
(empty)

Test 47

Subtask: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`1 19 7 6 2 5 4 3 3 2 7 1 4 4 6 3 5 2 ...` view save

correct output
`YES 2 3 4 5 7 6 6 5 3 1 7 4 2 7 4 ...` view save

user output
(empty)

Test 48

Subtask: 2, 5, 6

Verdict: ACCEPTED

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

correct output
`YES 1 3 5 4 4 3 2 5 1 5 1 4 3` view save

user output
`YES 1 3 4 5 4 5 2 1 3 3 5 1 4` view save

Test 49

Subtask: 2, 3, 5, 6

Verdict: ACCEPTED

input
`1 5 2 1 1 1 2 1` view save

correct output
`YES 1 1 2 1 1` view save

user output
`YES 1 1 2 1 1` view save

Test 50

Subtask: 2, 5, 6

Verdict: ACCEPTED

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

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

user output
`NO NO YES 1 3 2 3 1 YES ...` view save

Test 51

Subtask: 2, 5, 6

Verdict: ACCEPTED

input
`100 15 3 1 3 2 1 3 1 2 2 1 2 1 3 1 3 2 15 3 1 3 3 2 1 1 3 1 2 1 1 2 2 2 1 ...` view save

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

user output
`YES 1 1 1 2 2 3 3 2 3 3 2 2 1 1 1 YES 1 1 1 2 2 2 3 3 3 1 1 2 2 1 1 YES ...` view save

Test 52

Subtask: 2, 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`100 15 5 4 4 1 5 3 2 3 2 1 3 1 5 3 5 1 15 4 3 3 3 4 2 1 1 4 4 2 2 1 1 1 1 ...` view save

correct output
`YES 2 3 3 1 1 4 5 5 5 4 1 1 3 3 2 YES 1 1 1 2 4 3 3 2 4 4 3 2 1 1 1 YES ...` view save

user output
(empty)

Test 53

Subtask: 2, 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`100 15 9 7 8 8 8 4 5 9 3 5 4 2 1 4 4 6 15 8 6 8 4 5 5 2 5 7 8 3 8 8 5 6 1 ...` view save

correct output
`NO NO NO NO NO ...` view save

user output
(empty)

Test 54

Subtask: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`100 2000 3 1 3 2 3 2 2 1 3 1 1 3 2 3 3 3 ...` view save

correct output
`NO NO NO NO NO ...` view save

user output
(empty)

Test 55

Subtask: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`100 2000 5 4 2 4 3 2 5 5 5 5 3 4 1 3 5 3 ...` view save

correct output
`NO NO NO NO NO ...` view save

user output
(empty)

Test 56

Subtask: 5, 6

Verdict: ACCEPTED

input
`100 2000 15 8 7 6 4 7 5 14 15 3 4 8 5 14 8...` view save

correct output
`NO NO NO NO NO ...` view save

user output
`NO NO NO NO NO ...` view save

Test 57

Subtask: 4, 6

Verdict: TIME LIMIT EXCEEDED

input
`1 199989 66663 4877 59987 13852 61173 65485 2...` view save

correct output
`YES 60320 50363 20007 35623 25982 ...` view save

user output
(empty)

Test 58

Subtask: 2, 5, 6

Verdict: ACCEPTED

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

correct output
`YES 5 1 4 3 3 1 2 4 5 4 5 3 1` view save

user output
`YES 1 3 4 5 4 5 2 1 3 3 5 1 4` view save

Test 59

Subtask: 2, 5, 6

Verdict: ACCEPTED

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

correct output
`YES 4 2 5 1 1 2 3 5 4 5 4 1 2` view save

user output
`YES 1 2 4 5 4 5 3 1 2 2 5 1 4` view save

Test 60

Subtask: 2, 5, 6

Verdict: ACCEPTED

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

correct output
`YES 5 4 2 1 1 4 3 2 5 2 5 1 4` view save

user output
`YES 1 2 4 5 4 5 3 1 2 2 5 1 4` view save

Test 61

Subtask: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`1 19 7 5 5 2 4 3 6 5 2 7 3 4 3 2 7 4 ...` view save

correct output
`YES 2 6 3 4 7 5 5 4 6 1 7 3 2 7 3 ...` view save

user output
(empty)

Test 62

Subtask: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`1 19 7 3 7 7 6 3 6 2 1 4 6 3 5 4 4 1 ...` view save

correct output
`YES 7 1 2 6 4 3 3 6 1 5 4 2 7 4 2 ...` view save

user output
(empty)

Test 63

Subtask: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`1 19 7 3 5 3 2 6 1 1 6 2 3 6 1 7 7 7 ...` view save

correct output
`YES 2 7 1 6 4 3 3 6 7 5 4 1 2 4 1 ...` view save

user output
(empty)

BOI 2026 Mirror Day 1

Blocks

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

Tasks

Submissions (jsesok)