Submission details
Task:Sort
Sender:MRiekasius
Submission time:2026-04-17 14:59:43 +0300
Language:C++ (C++20)
Status:READY
Result:0
Feedback
subtaskverdictscore
#10
#20
#30
#40
#50
#60
#70
Test results
testverdicttimesubtask
#10.00 s2, 6, 7details
#20.00 s1, 2, 3, 6, 7details
#30.00 s2, 6, 7details
#40.00 s1, 2, 3, 6, 7details
#50.00 s1, 2, 3, 6, 7details
#60.00 s1, 2, 3, 6, 7details
#70.00 s1, 2, 3, 6, 7details
#80.00 s1, 2, 3, 6, 7details
#90.00 s1, 2, 3, 6, 7details
#100.00 s1, 2, 3, 6, 7details
#110.00 s2, 6, 7details
#120.00 s2, 6, 7details
#130.00 s2, 6, 7details
#140.00 s2, 6, 7details
#150.00 s2, 6, 7details
#160.03 s3, 7details
#170.03 s3, 7details
#180.03 s3, 7details
#190.03 s3, 7details
#200.03 s3, 7details
#210.03 s3, 7details
#220.03 s3, 7details
#230.03 s3, 7details
#240.08 s4, 7details
#250.08 s4, 7details
#260.08 s4, 7details
#27ACCEPTED0.03 s4, 7details
#280.09 s4, 7details
#290.08 s4, 7details
#300.01 s5, 6, 7details
#310.00 s5, 6, 7details
#320.01 s5, 6, 7details
#330.00 s5, 6, 7details
#340.00 s5, 6, 7details
#350.01 s5, 6, 7details
#360.01 s6, 7details
#370.00 s6, 7details
#380.01 s6, 7details
#390.01 s6, 7details
#400.01 s6, 7details
#410.01 s6, 7details
#420.03 s7details
#430.03 s7details
#440.03 s7details
#450.03 s7details
#460.03 s7details
#470.03 s7details
#480.03 s7details
#490.03 s7details
#500.03 s7details
#510.03 s7details
#520.00 s1, 2, 3, 5, 6, 7details
#53ACCEPTED0.00 s1, 2, 3, 4, 5, 6, 7details
#540.00 s2, 5, 6, 7details
#550.00 s1, 2, 3, 4, 6, 7details
#560.00 s1, 2, 3, 6, 7details
#570.00 s6, 7details
#580.04 s3, 4, 7details
#590.00 s3, 7details
#600.00 s2, 6, 7details
#610.00 s2, 6, 7details
#620.00 s2, 6, 7details
#630.00 s2, 6, 7details
#640.00 s2, 6, 7details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:68:17: warning: unused variable 'ans' [-Wunused-variable]
   68 |             int ans = 0;
      |                 ^~~
input/code.cpp:27:15: warning: unused variable 'pirmoDvejetoX' [-Wunused-variable]
   27 |     const int pirmoDvejetoX = paskutinioVienetoX + 1;
      |               ^~~~~~~~~~~~~

Code

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

int main()
{
    //cout << (long long)INT_MAX - 1000000000LL << endl;
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, q;
    cin >> n >> q;
    vector<int> vienetaiIkiX(n + 1, 0), dvejetaiIkiX(n + 1, 0);
    for(int i = 1; i <= n; i++){
        int x;
        cin >> x;
        vienetaiIkiX[i] = vienetaiIkiX[i-1] + 2 - x;
        dvejetaiIkiX[i] = dvejetaiIkiX[i-1] + x - 1;
    }
    /*
    for(auto i: vienetaiIkiX) cout << i << " ";
    cout << "\n";
    for(auto i: dvejetaiIkiX) cout << i << " ";
    cout << "\n";
    //*/
    const int totalVienetai = vienetaiIkiX[n];
    const int totalDvejetai = dvejetaiIkiX[n];
    const int paskutinioVienetoX = totalVienetai - 1;
    const int pirmoDvejetoX = paskutinioVienetoX + 1;
    bool isItSorted = (vienetaiIkiX[totalVienetai] == totalVienetai);
    if(isItSorted){
        while(q--) cout << 0 << "\n";
        return 0;
    }
    while(q--){
        int a, b;
        cin >> a >> b;
        if(a + b <= n){
            if(a > totalVienetai || totalVienetai > n-b){
                //tikrai zinom, kad ne tobulai sorted
                bool doesAContainAll1 = (vienetaiIkiX[a] == totalVienetai);

                if(doesAContainAll1) cout << 1 << "\n";
                else{
                    if(totalVienetai > n - b){
                        cout << 1 << "\n";
                    }
                    else cout << -1;
                }
            }
            else{
                int ans = 0;
                // tikrinam ar pirmiausia a sorted
                bool isATikVienetai  = (vienetaiIkiX[a] == a);
                ans += (int)(!isATikVienetai);
                //tikrinam ar tarpas tinkamas
                int tarpeTuretuButiVienetu = max(min(totalVienetai - a, n - a - b), 0);
                if(vienetaiIkiX[n - b] - vienetaiIkiX[a] != tarpeTuretuButiVienetu){
                    cout << -1;
                    continue;
                }
                int bVienetu = max(totalVienetai - n + b, 0);

                if(totalVienetai - vienetaiIkiX[n - b] != bVienetu) ans++;

                cout << ans << "\n";
            }
        }
        else{
            int ans = 0;
            int tarpoIlgis = a + b - n;
            a -= tarpoIlgis;
            b -= tarpoIlgis;
            const int aTuretuTuretiVienetu = min(a, totalVienetai);
            const int midTuretuTuretiVienetu = max(min(tarpoIlgis, totalVienetai - aTuretuTuretiVienetu), 0);
            const int bTuretuTuretiVienetu = max(0, totalVienetai - aTuretuTuretiVienetu - midTuretuTuretiVienetu);
            int aTuriVienetu = vienetaiIkiX[a];
            int midTuriVienetu = vienetaiIkiX[a + tarpoIlgis] - vienetaiIkiX[a];
            int bTuriVienetu = vienetaiIkiX[b] - midTuriVienetu;

            int bReikiaPokycio = abs(bTuretuTuretiVienetu - bTuriVienetu);
            int bPokyciuiEjimu = bReikiaPokycio/tarpoIlgis;
            if(bReikiaPokycio % tarpoIlgis != 0) bPokyciuiEjimu++;
            bool bSorted = (dvejetaiIkiX[max(n - totalDvejetai, n - b)] == 0);
            if(!bSorted && bPokyciuiEjimu == 0) bPokyciuiEjimu++;


            int aReikiaPokycio = abs(aTuretuTuretiVienetu - aTuriVienetu);
            int aPokyciuiEjimu = aReikiaPokycio/tarpoIlgis;
            if(aReikiaPokycio % tarpoIlgis != 0) aPokyciuiEjimu++;
            bool aSorted = (min(a, totalVienetai) == vienetaiIkiX[max(totalVienetai, a)]);
            if(!aSorted && aPokyciuiEjimu == 0) aPokyciuiEjimu++;

            cout << aPokyciuiEjimu + bPokyciuiEjimu << "\n";

        }
    }
}

Test details

Test 1

Subtask: 2, 6, 7

Verdict:

input
6 3
3 1 4 1 5 9
4 1
3 3
2 5

correct output
1
-1
2

user output
-1-112

Feedback: Output is shorter than expected

Test 2

Subtask: 1, 2, 3, 6, 7

Verdict:

input
2 1
548813503 548813503
1 1

correct output
0

user output
(empty)

Test 3

Subtask: 2, 6, 7

Verdict:

input
1 1
417021999
1 1

correct output
0

user output
(empty)

Test 4

Subtask: 1, 2, 3, 6, 7

Verdict:

input
10 10
20751947 20751947 20751947 494...

correct output
-1
-1
1
1
-1
...

user output
(empty)

Test 5

Subtask: 1, 2, 3, 6, 7

Verdict:

input
10 10
12780811 19475241 19475241 683...

correct output
0
0
0
0
0
...

user output
(empty)

Test 6

Subtask: 1, 2, 3, 6, 7

Verdict:

input
10 10
14574963 14574963 14574963 864...

correct output
0
0
0
0
0
...

user output
(empty)

Test 7

Subtask: 1, 2, 3, 6, 7

Verdict:

input
10 10
237541216 237541216 35036522 6...

correct output
-1
-1
-1
2
-1
...

user output
(empty)

Test 8

Subtask: 1, 2, 3, 6, 7

Verdict:

input
10 10
319425549 513116712 539199939 ...

correct output
-1
-1
-1
-1
-1
...

user output
(empty)

Test 9

Subtask: 1, 2, 3, 6, 7

Verdict:

input
10 10
54363219 54363219 110986323 11...

correct output
0
0
0
0
0
...

user output
(empty)

Test 10

Subtask: 1, 2, 3, 6, 7

Verdict:

input
10 5
55687086 550701455 326656159 5...

correct output
-1
-1
-1
-1
-1

user output
(empty)

Test 11

Subtask: 2, 6, 7

Verdict:

input
10 10
35889584 588130796 815837475 8...

correct output
-1
-1
1
1
1
...

user output
(empty)

Test 12

Subtask: 2, 6, 7

Verdict:

input
10 10
679842175 48724877 720966351 6...

correct output
2
3
2
1
1
...

user output
(empty)

Test 13

Subtask: 2, 6, 7

Verdict:

input
10 10
893310183 811950921 338863962 ...

correct output
2
1
1
2
5
...

user output
(empty)

Test 14

Subtask: 2, 6, 7

Verdict:

input
10 10
221045363 282395847 441913686 ...

correct output
0
0
0
0
0
...

user output
(empty)

Test 15

Subtask: 2, 6, 7

Verdict:

input
10 10
509019662 983949268 960017302 ...

correct output
3
-1
3
3
3
...

user output
(empty)

Test 16

Subtask: 3, 7

Verdict:

input
200000 200000
2277053 2277053 2277053 227705...

correct output
-1
-1
-1
-1
-1
...

user output
(empty)

Test 17

Subtask: 3, 7

Verdict:

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

correct output
-1
-1
-1
-1
-1
...

user output
(empty)

Test 18

Subtask: 3, 7

Verdict:

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

correct output
-1
-1
-1
-1
-1
...

user output
(empty)

Test 19

Subtask: 3, 7

Verdict:

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

correct output
-1
1
2
-1
-1
...

user output
(empty)

Test 20

Subtask: 3, 7

Verdict:

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

correct output
-1
-1
-1
-1
-1
...

user output
(empty)

Test 21

Subtask: 3, 7

Verdict:

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

correct output
-1
-1
-1
-1
-1
...

user output
(empty)

Test 22

Subtask: 3, 7

Verdict:

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

correct output
-1
-1
-1
-1
-1
...

user output
(empty)

Test 23

Subtask: 3, 7

Verdict:

input
200000 200000
12345 13538 15407 18490 18984 ...

correct output
0
0
0
0
0
...

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 ...

correct output
-1
1
-1
-1
-1
...

user output
-12
1
0
1
0
...

Feedback: Output is shorter than expected

Test 25

Subtask: 4, 7

Verdict:

input
200000 200000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
1
-1
1
-1
1
...

user output
2
-12
-12
2
-13
...

Feedback: Output is shorter than expected

Test 26

Subtask: 4, 7

Verdict:

input
200000 200000
2 2 1 1 2 1 2 1 2 2 2 1 1 1 2 ...

correct output
4
3
2
2
6
...

user output
4
2
2
2
5
...

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

Test 27

Subtask: 4, 7

Verdict: ACCEPTED

input
200000 200000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
0
0
0
0
0
...

user output
0
0
0
0
0
...

Test 28

Subtask: 4, 7

Verdict:

input
200000 200000
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...

correct output
8513
1099
35939
9299
19597
...

user output
4460
575
18849
4881
10284
...

Feedback: Output is shorter than expected

Test 29

Subtask: 4, 7

Verdict:

input
200000 200000
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...

correct output
178345
169257
62115
96143
64796
...

user output
91397
86727
31833
49265
33206
...

Feedback: Output is shorter than expected

Test 30

Subtask: 5, 6, 7

Verdict:

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

correct output
1
1
-1
1
-1
...

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...

correct output
-1
2
-1
2
-1
...

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 ...

correct output
-1
2
-1
-1
-1
...

user output
(empty)

Test 33

Subtask: 5, 6, 7

Verdict:

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

correct output
3
3
3
3
11
...

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 ...

correct output
0
0
0
0
0
...

user output
(empty)

Test 35

Subtask: 5, 6, 7

Verdict:

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

correct output
2039
1910
-1
687
673
...

user output
(empty)

Test 36

Subtask: 6, 7

Verdict:

input
5000 5000
202010 457852 826471 926337 10...

correct output
-1
-1
2
-1
-1
...

user output
(empty)

Test 37

Subtask: 6, 7

Verdict:

input
5000 5000
190583 326486 431922 462939 72...

correct output
-1
-1
-1
-1
2
...

user output
(empty)

Test 38

Subtask: 6, 7

Verdict:

input
5000 5000
821998255 400550008 71790232 5...

correct output
5
3
3
2
5
...

user output
(empty)

Test 39

Subtask: 6, 7

Verdict:

input
5000 5000
266174928 446601941 191252234 ...

correct output
3
3
414
4
3
...

user output
(empty)

Test 40

Subtask: 6, 7

Verdict:

input
5000 5000
11621 243915 243915 949123 137...

correct output
0
0
0
0
0
...

user output
(empty)

Test 41

Subtask: 6, 7

Verdict:

input
5000 5000
999767052 998555066 997822810 ...

correct output
919
459
505
833
809
...

user output
(empty)

Test 42

Subtask: 7

Verdict:

input
200000 200000
478025 478025 478025 478025 47...

correct output
-1
-1
2
2
2
...

user output
(empty)

Test 43

Subtask: 7

Verdict:

input
200000 200000
1810 2088 3022 3097 7459 7943 ...

correct output
2
-1
-1
2
-1
...

user output
(empty)

Test 44

Subtask: 7

Verdict:

input
199531 200000
11328 26391 30353 37063 44412 ...

correct output
-1
2
-1
2
2
...

user output
(empty)

Test 45

Subtask: 7

Verdict:

input
200000 200000
106738201 369187074 412614650 ...

correct output
2
12
3
19
3
...

user output
(empty)

Test 46

Subtask: 7

Verdict:

input
200000 200000
670611290 43427363 8475380 309...

correct output
3
5
3
3
3
...

user output
(empty)

Test 47

Subtask: 7

Verdict:

input
200000 200000
907542569 504758282 948727805 ...

correct output
3
33
3
3
3
...

user output
(empty)

Test 48

Subtask: 7

Verdict:

input
200000 200000
487056731 460461648 142698485 ...

correct output
3
3
3
3
3
...

user output
(empty)

Test 49

Subtask: 7

Verdict:

input
200000 200000
12772 23236 23236 23236 41149 ...

correct output
0
0
0
0
0
...

user output
(empty)

Test 50

Subtask: 7

Verdict:

input
200000 200000
999993539 999993361 999993361 ...

correct output
125375
16687
-1
84781
46147
...

user output
(empty)

Test 51

Subtask: 7

Verdict:

input
200000 200000
999993539 999993361 999993361 ...

correct output
94788
177608
95881
56377
179957
...

user output
(empty)

Test 52

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

Verdict:

input
5 1
2 1 3 5 4
2 2

correct output
2

user output
-1

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

Test 53

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

Verdict: ACCEPTED

input
2 1
1 2
1 1

correct output
0

user output
0

Test 54

Subtask: 2, 5, 6, 7

Verdict:

input
4 1
2 1 4 3
3 2

correct output
2

user output
5

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

Test 55

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

Verdict:

input
10 10
1 1 1 1 2 2 1 1 2 2
7 1
2 6
4 5
...

correct output
-1
1
-1
-1
-1
...

user output
-11
1
-11
1
2
...

Feedback: Output is shorter than expected

Test 56

Subtask: 1, 2, 3, 6, 7

Verdict:

input
10 10
181777772 181777772 181777772 ...

correct output
-1
-1
-1
-1
-1
...

user output
(empty)

Test 57

Subtask: 6, 7

Verdict:

input
100 10
92800811 524548163 939127795 9...

correct output
-1
-1
3
-1
3
...

user output
(empty)

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 ...

correct output
-1
-1
-1
-1
-1
...

user output
-11
-1-1-1-1-1-11
-1-1-11
1
-11
...

Feedback: Output is shorter than expected

Test 59

Subtask: 3, 7

Verdict:

input
100 100000
172695325 172695325 172695325 ...

correct output
-1
-1
-1
-1
-1
...

user output
(empty)

Test 60

Subtask: 2, 6, 7

Verdict:

input
4 10
869194539 239439572 968540665 ...

correct output
-1
2
-1
-1
-1
...

user output
(empty)

Test 61

Subtask: 2, 6, 7

Verdict:

input
10 10
55366041 112170735 112170735 5...

correct output
-1
-1
2
1
1
...

user output
(empty)

Test 62

Subtask: 2, 6, 7

Verdict:

input
10 10
156018639 156018639 445832758 ...

correct output
-1
1
-1
-1
2
...

user output
(empty)

Test 63

Subtask: 2, 6, 7

Verdict:

input
10 10
702507512 702507512 892090406 ...

correct output
-1
2
-1
2
2
...

user output
(empty)

Test 64

Subtask: 2, 6, 7

Verdict:

input
10 10
720324490 720324490 720324490 ...

correct output
-1
2
2
1
-1
...

user output
(empty)