CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:masuman
Submission time:2020-10-08 07:54:51 +0300
Language:C++11
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED11
#2ACCEPTED26
#3ACCEPTED63
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.01 s1, 2, 3details
#3ACCEPTED0.01 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s2, 3details
#7ACCEPTED0.01 s2, 3details
#8ACCEPTED0.01 s2, 3details
#9ACCEPTED0.01 s2, 3details
#10ACCEPTED0.01 s2, 3details
#11ACCEPTED0.45 s3details
#12ACCEPTED0.44 s3details
#13ACCEPTED0.44 s3details
#14ACCEPTED0.50 s3details
#15ACCEPTED0.47 s3details
#16ACCEPTED0.48 s3details
#17ACCEPTED0.48 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:40:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(long j = 0; j < a.size(); j++){
                             ~~^~~~~~~~~~
input/code.cpp:51:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(unsigned long i = 0; i<=numOfit; i++){
                              ~^~~~~~~~~
input/code.cpp:54:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(long j = 0; j < a.size(); j++){
                             ~~^~~~~~~~~~

Code

#include <bits/stdc++.h>

using namespace std;

long minOutofSubarray(vector<vector<long>> &a, long b, long c){
    long k = floor(log2(c-b+1));

    long d = a[k][b-1];
    long e = a[k][c-pow(2,k)];
    long mini = min(d, e);
    return mini;
}
long maxOutofSubarray(vector<vector<long>> &a, long b, long c){
    long k = floor(log2(c-b+1));

    long d = a[k][b-1];
    long e = a[k][c-pow(2,k)];
    long maxi = max(d, e);
    return maxi;
}
int main(){
    long n;
    long k;
    cin >> n;
    cin >> k;
    vector<long> a;
    long in;
    for(long i = 0; i < n; i++){
        cin >> in;
        a.push_back(in);
    }
    
    long numOfit = ceil(log2(a.size()))-1;
    long s;
    vector<vector<long>> preArrayMin;
    vector<vector<long>> preArrayMax;
    for(long i = 0; i<=numOfit; i++){
        if(i==0){
            preArrayMin.push_back({});
            for(long j = 0; j < a.size(); j++){
                preArrayMin[0].push_back(a[j]);
            }
            continue;
        }
        preArrayMin.push_back({});
        for(long 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(unsigned long i = 0; i<=numOfit; i++){
        if(i==0){
            preArrayMax.push_back({});
            for(long j = 0; j < a.size(); j++){
                preArrayMax[0].push_back(a[j]);
            }
            continue;
        }
        preArrayMax.push_back({});
        for(long 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)]));
        }
        
    }
    
    long i = 1;
    long j = 1;
    long count = 0;
    long max;
    long min;
    i = 1;
    j = 1;
    while(true){
        /*for(long c = 0; c < j-i; c++){
            cout << a[i+c-1] << " ";
        }*/
        //cout << "\n";
        //cout << "hoo" << "\n";
        min = minOutofSubarray(preArrayMin, i, j);
        max = maxOutofSubarray(preArrayMax, i, j);
        //cout << "hoo" << "\n";
        if(max-min>k){
            //cout << "hoo" << "\n";
            j--;
            count += j-i+1;
            i++;
            if(j<i){
                j = i;
            }
            continue;
        }
        if(j == n){
            //cout << "hooo";
            count += ((j-i+1)*(j-i+2)/2);
            break;
        }
        j++;
    }
    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: ACCEPTED

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

correct output
119

user output
119

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

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

correct output
2413

user output
2413

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

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

correct output
5000050000

user output
5000050000

Test 12

Group: 3

Verdict: ACCEPTED

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

correct output
317066

user output
317066

Test 13

Group: 3

Verdict: ACCEPTED

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

correct output
123292

user output
123292

Test 14

Group: 3

Verdict: ACCEPTED

input
100000 999990000
460235639 963048588 47270983 3...

correct output
4946886742

user output
4946886742

Test 15

Group: 3

Verdict: ACCEPTED

input
100000 1000000000
885457070 18257718 927615960 3...

correct output
5000050000

user output
5000050000

Test 16

Group: 3

Verdict: ACCEPTED

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

correct output
3750075000

user output
3750075000

Test 17

Group: 3

Verdict: ACCEPTED

input
100000 50000
100000 99999 99998 99997 99996...

correct output
3750075000

user output
3750075000