CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:Juksu
Submission time:2020-10-03 22:22:20 +0300
Language:C++11
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#20.01 s1, 2, 3details
#30.01 s1, 2, 3details
#40.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.07 s2, 3details
#70.07 s2, 3details
#80.07 s2, 3details
#90.07 s2, 3details
#10ACCEPTED0.07 s2, 3details
#110.01 s3details
#120.01 s3details
#130.01 s3details
#140.01 s3details
#150.01 s3details
#160.01 s3details
#170.01 s3details

Code

#include <bits/stdc++.h>

using namespace std;
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  //  int a[n];
  int l1[n*(int)log2(n)][n*(int)log2(n)];
  int l2[n*(int)log2(n)][n*(int)log2(n)];
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    //    a[i] = x;
    l1[i][0] = x;
    l2[i][0] = x;
  }
  int c = n;

  for (int j = 1; (1 << j) <= n; j++) {

    for (int i = 0; (i + (1 << j) - 1) < n; i++) {

      if (l1[i][j - 1] < l1[1 + (1 << (j - 1))][j - 1]) l1[i][j] = l1[i][j - 1];
      else l1[i][j] = l1[i + (1 << (j - 1))][j - 1];  

      if (l2[i][j - 1] > l2[1 + (1 << (j - 1))][j - 1]) l2[i][j] = l2[i][j - 1];
      else l2[i][j] = l2[i + (1 << (j - 1))][j - 1];  
    }				    
    
  }

  for (int i = 0; i < n; i++) {

    for (int j = (i + 1); j < n; j++) {

      int p = (int) log2(j - i + 1);
      int mi;
      int ma;
      mi = (l1[i][p] <= l1[j - (1 << p) + 1][p]) ? l1[i][p] : l1[j - (1 << p) + 1][p];
      ma = (l2[i][p] >= l2[j - (1 << p) + 1][p]) ? l2[i][p] : l2[j - (1 << p) + 1][p]; 

      if (ma - mi <= k){
	//	cout << ma << ' ' << mi << ' ' << i << ' ' << j << '\n';
	c++;
      }
    }
  }
  cout << c;
}

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:

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

correct output
317

user output
1368

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
255

Test 4

Group: 1, 2, 3

Verdict:

input
100 990000000
111122929 961821360 578238211 ...

correct output
4006

user output
5047

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:

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

correct output
6340

user output
100924

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
4650

Test 9

Group: 2, 3

Verdict:

input
2000 999000000
746120950 772769620 721488968 ...

correct output
1287776

user output
1999418

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)