— Dark mode

BOI 2026 Mirror Day 2

Sort

  • Start: 2026-04-17 10:00:00
  • End: 2026-04-17 15:00:00
Submission details
Task:Sort
Sender:Juan_Alejandro
Submission time:2026-04-17 14:39:58 +0300
Language:C++ (C++20)
Status:READY
Result:6
Feedback
subtaskverdictscore
#1ACCEPTED6
#20
#30
#40
#50
#60
#70
Test results
testverdicttimesubtask
#1ACCEPTED0.00 s2, 6, 7details
#2ACCEPTED0.00 s1, 2, 3, 6, 7details
#3ACCEPTED0.00 s2, 6, 7details
#4ACCEPTED0.00 s1, 2, 3, 6, 7details
#5ACCEPTED0.00 s1, 2, 3, 6, 7details
#6ACCEPTED0.00 s1, 2, 3, 6, 7details
#7ACCEPTED0.00 s1, 2, 3, 6, 7details
#8ACCEPTED0.00 s1, 2, 3, 6, 7details
#9ACCEPTED0.00 s1, 2, 3, 6, 7details
#10ACCEPTED0.00 s1, 2, 3, 6, 7details
#11ACCEPTED0.00 s2, 6, 7details
#12ACCEPTED0.00 s2, 6, 7details
#130.00 s2, 6, 7details
#14ACCEPTED0.00 s2, 6, 7details
#150.00 s2, 6, 7details
#16--3, 7details
#17--3, 7details
#18--3, 7details
#19--3, 7details
#20--3, 7details
#21--3, 7details
#22--3, 7details
#23--3, 7details
#24--4, 7details
#25--4, 7details
#26--4, 7details
#27--4, 7details
#28--4, 7details
#29--4, 7details
#30--5, 6, 7details
#31--5, 6, 7details
#32--5, 6, 7details
#33--5, 6, 7details
#34--5, 6, 7details
#35--5, 6, 7details
#36--6, 7details
#37--6, 7details
#38--6, 7details
#39--6, 7details
#40--6, 7details
#41--6, 7details
#42--7details
#43--7details
#44--7details
#45--7details
#46--7details
#47--7details
#48--7details
#49--7details
#50--7details
#51--7details
#52ACCEPTED0.00 s1, 2, 3, 5, 6, 7details
#53ACCEPTED0.00 s1, 2, 3, 4, 5, 6, 7details
#54ACCEPTED0.00 s2, 5, 6, 7details
#55ACCEPTED0.00 s1, 2, 3, 4, 6, 7details
#56ACCEPTED0.01 s1, 2, 3, 6, 7details
#570.01 s6, 7details
#58--3, 4, 7details
#59--3, 7details
#60ACCEPTED0.00 s2, 6, 7details
#61ACCEPTED0.00 s2, 6, 7details
#62ACCEPTED0.00 s2, 6, 7details
#63ACCEPTED0.00 s2, 6, 7details
#64ACCEPTED0.00 s2, 6, 7details

Compiler report

input/code.cpp: In function 'void bac(long long int, long long int, long long int&, long long int&, std::vector<long long int>, std::vector<long long int>&, long long int&)':
input/code.cpp:74:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |         for (int j = 0; j < x.size(); j++)
      |                         ~~^~~~~~~~~~
input/code.cpp:83:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     for (int j = 0; j < x.size(); j++)
      |                     ~~^~~~~~~~~~

Code

#include <bits/stdc++.h>
#define int long long 
#define endl " \n"
#define vec vector 
#define all(x) x.begin(),x.end()
#pragma GCC optimize("O2,unroll-loops")
using namespace std;
struct sparse_table{
    vec<vec<int>> x;
    vec<int> logs;
    sparse_table(int n,vec<int>&y):logs(n+1){
        logs[1]=0;
        for(int i=2;i<=n;i++)
        logs[i]=logs[i/2]+1;
        int K=logs[n];
        x.resize(K+1,vec<int>(n));
        for (int i = 0; i < n; i++)
        {
            x[0][i]=y[i];
        }
        for (int k = 1; k <= K; k++)
        {
            for (int i = 0; i+(1LL<<k)-1 < n; i++)
            {
                x[k][i]=min(x[k-1][i],x[k-1][i+(1LL<<(k-1))]);
            }
            
        }
        
    }
    int query(int l,int r)
    {
        int j=logs[r-l+1];
        return min(x[j][l],x[j][r-(1LL<<j)+1]);
    }
};
struct sparse_table2{
    vec<vec<int>> x;
    vec<int> logs;
    sparse_table2(int n,vec<int>&y):logs(n+1){
        //cout<<"exist"<<endl[1];
        logs[1]=0;
        for(int i=2;i<=n;i++)
        logs[i]=logs[i/2]+1;
        int K=logs[n];
        x.resize(K+1,vec<int>(n));
        for (int i = 0; i < n; i++)
        {
            x[0][i]=y[i];
        }
        for (int k = 1; k <= K; k++)
        {
            //cout<<k<<endl[1];
            for (int i = 0; i+(1LL<<k)-1 < n; i++)
            {
                x[k][i]=max(x[k-1][i],x[k-1][i+(1LL<<(k-1))]);
                //cout<<"on size k:"<<k<<" on idx:"<<i<<endl[1];
            }
            
        }
        
    }
    int query(int l,int r)
    {
        int j=logs[r-l+1];
        return max(x[j][l],x[j][r-(1LL<<j)+1]);
    }
};
void bac(int i,int c,int &a,int &b,vec<int> x,vec<int> &y,int &ans)
{
    if(i==4)
    {
        bool es=1;
        for (int j = 0; j < x.size(); j++)
        {
            if(x[j]!=y[j])es=0;
        }
        if(es)ans=min(ans,c);
        return;
    }
    bac(i+1,c,a,b,x,y,ans);
    vec<int> x2(x.size());
    for (int j = 0; j < x.size(); j++)
    {
        x2[j]=x[j];
    }
    vec<int> aa(a);
    for (int j = 0; j < a; j++)
    {
        aa[j]=x[j];
    }
    sort(all(aa));
    for (int j = 0; j < a; j++)
    {
        x[j]=aa[j];
    }
    /*for (int j = 0; j < b; j++)
    {
        cout<<x.size()-b+j<<" "<<b<<endl[1];
    }*/
    bac(i+1,c+1,a,b,x,y,ans);
    //return;
    vec<int> bb(b);
    for (int j = 0; j < b; j++)
    {
        bb[j]=x2[x.size()-b+j];
    }
    sort(all(bb));
    for (int j = 0; j < b; j++)
    {
        x2[x.size()-b+j]=bb[j];
    }
    bac(i+1,c+1,a,b,x2,y,ans);
}
int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,q;
    cin>>n>>q;
    vec<int> x(n),x2(n),y(n),z(n);
    vec<int>  xx(n);
    map<int,set<int>> o;
    for (int i = 0; i < n; i++)
    {
        cin>>x[i];
        o[x[i]].insert(i+1);
        y[i]=x[i];
        z[i]=x[i];
        x2[i]=x[i];
    }
    sort(all(y));
    int cc=1e6;
    vec<int> c(n);
    for (int i = 0; i < n; i++)
    {
        auto e=o[y[i]].begin();
        xx[i]=*e;
        //cout<<xx[i]<<endl[i==n-1];
        o[y[i]].erase(e);
        if(x[i]!=y[i])cc=0;
        c[i]=cc;
        //cout<<c[i]<<endl[i==n-1];
        cc++;
    }
    sparse_table s(n,xx);
    sparse_table2 s2(n,xx);
    while(q--)
    {
        int a,b;
        cin>>a>>b;
        int ans=1e18l;
        bac(0,0,a,b,x,y,ans);
        if(ans==1e18l)ans=-1;
        cout<<ans<<endl[1];
        
    }
    return 0;
}

Test details

Test 1

Subtask: 2, 6, 7

Verdict: ACCEPTED

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
2
view save

Test 2

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
2 1
548813503 548813503
1 1
view save

correct output
0
view save

user output
0
view save

Test 3

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
1 1
417021999
1 1
view save

correct output
0
view save

user output
0
view save

Test 4

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

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

Test 5

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

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

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

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

Test 6

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

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

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

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

Test 7

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

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

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

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

Test 8

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

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

Test 9

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

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

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

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

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

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

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

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

Test 12

Subtask: 2, 6, 7

Verdict: ACCEPTED

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

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

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

Test 13

Subtask: 2, 6, 7

Verdict:

input
10 10
893310183 811950921 338863962 ...
view save

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

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

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

Test 14

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
10 10
221045363 282395847 441913686 ...
view save

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

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

Test 15

Subtask: 2, 6, 7

Verdict:

input
10 10
509019662 983949268 960017302 ...
view save

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

user output
3
-1
3
3
3
...
view save

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

Test 16

Subtask: 3, 7

Verdict:

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

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

user output
(empty)

Test 17

Subtask: 3, 7

Verdict:

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

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

user output
(empty)

Test 18

Subtask: 3, 7

Verdict:

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

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

user output
(empty)

Test 19

Subtask: 3, 7

Verdict:

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

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

user output
(empty)

Test 20

Subtask: 3, 7

Verdict:

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

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

user output
(empty)

Test 21

Subtask: 3, 7

Verdict:

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

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

user output
(empty)

Test 22

Subtask: 3, 7

Verdict:

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

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

user output
(empty)

Test 23

Subtask: 3, 7

Verdict:

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

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

user output
(empty)

Test 24

Subtask: 4, 7

Verdict:

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:

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:

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:

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:

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:

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:

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
(empty)

Test 31

Subtask: 5, 6, 7

Verdict:

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
(empty)

Test 32

Subtask: 5, 6, 7

Verdict:

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
(empty)

Test 33

Subtask: 5, 6, 7

Verdict:

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

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

user output
(empty)

Test 34

Subtask: 5, 6, 7

Verdict:

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
(empty)

Test 35

Subtask: 5, 6, 7

Verdict:

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

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

user output
(empty)

Test 36

Subtask: 6, 7

Verdict:

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

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

user output
(empty)

Test 37

Subtask: 6, 7

Verdict:

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

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

user output
(empty)

Test 38

Subtask: 6, 7

Verdict:

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

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

user output
(empty)

Test 39

Subtask: 6, 7

Verdict:

input
5000 5000
266174928 446601941 191252234 ...
view save

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

user output
(empty)

Test 40

Subtask: 6, 7

Verdict:

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

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

user output
(empty)

Test 41

Subtask: 6, 7

Verdict:

input
5000 5000
999767052 998555066 997822810 ...
view save

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

user output
(empty)

Test 42

Subtask: 7

Verdict:

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:

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:

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:

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:

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:

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:

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:

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:

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:

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

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

Test 56

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

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

Test 57

Subtask: 6, 7

Verdict:

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

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

user output
-1
-1
3
-1
3
...
view save

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

Test 58

Subtask: 3, 4, 7

Verdict:

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
(empty)

Test 59

Subtask: 3, 7

Verdict:

input
100 100000
172695325 172695325 172695325 ...
view save

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

user output
(empty)

Test 60

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
4 10
869194539 239439572 968540665 ...
view save

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

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

Test 61

Subtask: 2, 6, 7

Verdict: ACCEPTED

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

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

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

Test 62

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
10 10
156018639 156018639 445832758 ...
view save

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

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

Test 63

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
10 10
702507512 702507512 892090406 ...
view save

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

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

Test 64

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
10 10
720324490 720324490 720324490 ...
view save

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

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

Tasks

A Distances-B Hamilton-C Sort-

Submissions (Juan_Alejandro)

2026-04-17 14:41:44 112026-04-17 14:40:44 62026-04-17 14:39:58 62026-04-17 14:22:59 132026-04-17 14:14:55 02026-04-17 13:46:44 62026-04-17 10:40:10 62026-04-17 10:29:20 62026-04-17 10:29:05 0