CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:nireo
Submission time:2020-10-03 02:26:41 +0300
Language:C++ (C++17)
Status:READY
Result:37
Feedback
groupverdictscore
#1ACCEPTED11
#2ACCEPTED26
#30
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
#110.05 s3details
#12ACCEPTED0.04 s3details
#13ACCEPTED0.04 s3details
#140.09 s3details
#150.07 s3details
#160.08 s3details
#170.08 s3details

Code

#include <bits/stdc++.h>

#include <climits>
using namespace std;
typedef long long ll;

const ll mod = 1e12;

template <class T, int SZ>
struct MinSeg {
    T seg[2 * SZ], ID = mod;
    MinSeg() { memset(seg, 0, sizeof seg); }
    T comb(T a, T b) { return min(a, b); }
    void build() {
        for (int i = (SZ)-1; i >= 0; i--) {
            seg[i] = comb(seg[2 * i], seg[2 * i + 1]);
        }
    }

    void upd(int p, T value) {
        for (seg[p += SZ] = value; p > 1; p >>= 1)
            seg[p >> 1] = comb(seg[(p | 1) ^ 1], seg[p | 1]);
    }

    T query(int l, int r) {
        T res1 = ID, res2 = ID;
        r++;
        for (l += SZ, r += SZ; l < r; l >>= 1, r >>= 1) {
            if (l & 1)
                res1 = comb(res1, seg[l++]);
            if (r & 1)
                res2 = comb(seg[--r], res2);
        }
        return comb(res1, res2);
    }
};

template <class T, int SZ>
struct MaxSeg {
    T seg[2 * SZ], ID = 0;
    MaxSeg() { memset(seg, 0, sizeof seg); }
    T comb(T a, T b) { return max(a, b); }

    void build() {
        for (int i = (SZ)-1; i >= 0; i--) {
            seg[i] = comb(seg[2 * i], seg[2 * i + 1]);
        }
    }

    void upd(int p, T value) {  // set value at position p
        for (seg[p += SZ] = value; p > 1; p >>= 1)
            seg[p >> 1] = comb(seg[(p | 1) ^ 1], seg[p | 1]);
    }

    T query(int l, int r) {
        T res1 = ID, res2 = ID;
        r++;
        for (l += SZ, r += SZ; l < r; l >>= 1, r >>= 1) {
            if (l & 1)
                res1 = comb(res1, seg[l++]);
            if (r & 1)
                res2 = comb(seg[--r], res2);
        }
        return comb(res1, res2);
    }
};

MinSeg<ll, 1 << 18> s_min;
MaxSeg<ll, 1 << 18> s_max;

int main() {
    int n, k, ans = 0;
    cin >> n >> k;
    for (int i = 1; i < n + 1; ++i) {
        int x;
        cin >> x;
        s_max.upd(i, x);
        s_min.upd(i, x);
    }

    int start = 0, end = 0;
    while (end < n) {
        int max_value = s_max.query(start + 1, end + 1);
        int min_value = s_min.query(start + 1, end + 1);

        if (max_value - min_value <= k) {
            end++;

            if (end >= start)
                ans += end - start;
        } else {
            while (start < end) {
                start++;
                max_value = s_max.query(start + 1, end + 1);
                min_value = s_min.query(start + 1, end + 1);

                if (max_value - min_value <= k) {
                    break;
                }
            }
        }
    }

    cout << ans << "\n";
}

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:

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

input
100000 999990000
460235639 963048588 47270983 3...

correct output
4946886742

user output
651919446

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

Test 17

Group: 3

Verdict:

input
100000 50000
100000 99999 99998 99997 99996...

correct output
3750075000

user output
-544892296