CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:lady-stardust
Submission time:2020-09-28 10:33:51 +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.32 s2, 3details
#7ACCEPTED0.32 s2, 3details
#8ACCEPTED0.32 s2, 3details
#9ACCEPTED0.32 s2, 3details
#10ACCEPTED0.32 s2, 3details
#11--3details
#12--3details
#13--3details
#14--3details
#15--3details
#16--3details
#17--3details

Code

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

int N = pow(2,17);
vector<int> arr_min(2*N, 1e9+7);
vector<int> arr_max(2*N);

int get_min(int a, int b) {
  a += N; b += N;
  int res = 1e9+7;

  while (a <= b) {
    if (a % 2 != 0) res = min(res, arr_min[a++]);
    if (b % 2 != 1) res = min(res, arr_min[b--]);
    a/=2;
    b/=2;
  }
  return res;
}

int get_max(int a, int b) {
  a += N; b += N;
  int res = 0;
  while (a <= b) {
    if (a % 2 != 0) res = max(res, arr_max[a++]);
    if (b % 2 != 1) res = max(res, arr_max[b--]);
    a/=2;
    b/=2;
  }
  return res;
}

int main() {
  int n, k; cin >> n >> k;

  for (int i = 0; i < n; i++) {
    cin >> arr_min[i+N];
    arr_max[i+N] = arr_min[i+N];
  }

  for (int i = N-1; i > 0; i--) arr_max[i] = max(arr_max[i*2], arr_max[i*2+1]);
  for (int i = N-1; i > 0; i--) arr_min[i] = min(arr_min[i*2], arr_min[i*2+1]);

  ll t = 0;

  for (int i = 0; i < n; i++) {
    for (int j = i; j < n; j++) {
      int res = abs(get_min(i, j) - get_max(i, j));
      // cout << (i) << " " << (j) << ": " << res << "\n";
      if (res <= k) t++;
    }
  }

  cout << t;
}

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

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

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

Test 14

Group: 3

Verdict:

input
100000 999990000
460235639 963048588 47270983 3...

correct output
4946886742

user output
(empty)

Test 15

Group: 3

Verdict:

input
100000 1000000000
885457070 18257718 927615960 3...

correct output
5000050000

user output
(empty)

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

Test 17

Group: 3

Verdict:

input
100000 50000
100000 99999 99998 99997 99996...

correct output
3750075000

user output
(empty)