CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:masuman
Submission time:2020-10-04 19:15:52 +0300
Language:C++11
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.01 s1, 2, 3details
#30.01 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s2, 3details
#7ACCEPTED0.01 s2, 3details
#80.01 s2, 3details
#9ACCEPTED0.01 s2, 3details
#10ACCEPTED0.01 s2, 3details
#110.44 s3details
#120.44 s3details
#130.43 s3details
#14ACCEPTED0.50 s3details
#150.46 s3details
#160.47 s3details
#170.47 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:39:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j = 0; j < a.size(); j++){
                            ~~^~~~~~~~~~
input/code.cpp:53:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j = 0; j < a.size(); j++){
                            ~~^~~~~~~~~~

Code

#include <bits/stdc++.h>

using namespace std;

int minOutofSubarray(vector<vector<int>> &preProcessedList, int startPointer, int endPointer){
    int k = floor(log2(endPointer-startPointer+1));

    int startArray = preProcessedList[k][startPointer-1];
    int endArray = preProcessedList[k][endPointer-pow(2,k)];
    int mini = min(startArray, endArray);
    return mini;
}
int maxOutofSubarray(vector<vector<int>> &preProcessedList1, int startPointer, int endPointer){
    int k = floor(log2(endPointer-startPointer+1));

    int startArray1 = preProcessedList1[k][startPointer-1];
    int endArray1 = preProcessedList1[k][endPointer-pow(2,k)];
    int maxi = max(startArray1, endArray1);
    return maxi;
}
int main(){
    int n;
    int k;
    cin >> n;
    cin >> k;
    vector<int> a;
    int in;
    for(int i = 0; i < n; i++){
        cin >> in;
        a.push_back(in);
    }
    int numOfit = ceil(log2(a.size()))-1;
    int s;
    vector<vector<int>> preArrayMin;
    vector<vector<int>> preArrayMax;
    for(int i = 0; i<=numOfit; i++){
        if(i==0){
            preArrayMin.push_back({});
            for(int j = 0; j < a.size(); j++){
                preArrayMin[0].push_back(a[j]);
            }
            continue;
        }
        preArrayMin.push_back({});
        for(int l = 0; l < a.size()-pow(2,i)+1; l++){
            s = min(preArrayMin[i-1][l],preArrayMin[i-1][l+pow(2,i-1)]);
            preArrayMin[i].push_back(s);
        }
    }
    for(int i = 0; i<=numOfit; i++){
        if(i==0){
            preArrayMax.push_back({});
            for(int j = 0; j < a.size(); j++){
                preArrayMax[0].push_back(a[j]);
            }
            continue;
        }
        preArrayMax.push_back({});
        for(int l = 0; l < a.size()-pow(2,i)+1; l++){
            preArrayMax[i].push_back(max(preArrayMax[i-1][l],preArrayMax[i-1][l+pow(2,i-1)]));
        }
        
    }
    
    int x = 1;
    int y = 1;
    long count = 0;

    while(x<=n && y<=n){
        if(y==n){
            int c = (y-x+1);
            count += (c*(c+1)/2);
            break;
        }
        if(maxOutofSubarray(preArrayMax, x, y) - minOutofSubarray(preArrayMin, x, y) > k){
            count += y-x;
            x++;
            y--;
            if(x>y){
                y = x;
            }
            continue;
        }
        y++;
        
    }
    cout << count;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
5050

user output
5050

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 2
5 5 2 4 3 5 3 4 3 2 3 4 5 4 4 ...

correct output
317

user output
317

Test 3

Group: 1, 2, 3

Verdict:

input
100 10
71 60 61 96 25 10 10 9 84 85 1...

correct output
119

user output
120

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 990000000
111122929 961821360 578238211 ...

correct output
4006

user output
4006

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 1000000000
553190572 453407680 667300705 ...

correct output
5050

user output
5050

Test 6

Group: 2, 3

Verdict: ACCEPTED

input
2000 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
2001000

user output
2001000

Test 7

Group: 2, 3

Verdict: ACCEPTED

input
2000 2
4 4 1 4 2 3 1 2 1 3 5 2 2 4 4 ...

correct output
6340

user output
6340

Test 8

Group: 2, 3

Verdict:

input
2000 10
65 88 33 88 41 10 17 38 22 3 8...

correct output
2413

user output
2414

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
2000 999000000
746120950 772769620 721488968 ...

correct output
1287776

user output
1287776

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
2000 1000000000
621947980 510355354 756705418 ...

correct output
2001000

user output
2001000

Test 11

Group: 3

Verdict:

input
100000 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
5000050000

user output
705082704

Test 12

Group: 3

Verdict:

input
100000 2
3 3 1 3 3 1 1 5 1 2 5 4 1 3 1 ...

correct output
317066

user output
317070

Test 13

Group: 3

Verdict:

input
100000 10
10 3 6 3 43 60 5 48 15 27 86 4...

correct output
123292

user output
123293

Test 14

Group: 3

Verdict: ACCEPTED

input
100000 999990000
460235639 963048588 47270983 3...

correct output
4946886742

user output
4946886742

Test 15

Group: 3

Verdict:

input
100000 1000000000
885457070 18257718 927615960 3...

correct output
5000050000

user output
705082704

Test 16

Group: 3

Verdict:

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

correct output
3750075000

user output
1602591353

Test 17

Group: 3

Verdict:

input
100000 50000
100000 99999 99998 99997 99996...

correct output
3750075000

user output
1602591353