CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:sumit_kk10
Submission time:2020-09-30 09:42:19 +0300
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.01 s1, 2, 3details
#20.01 s1, 2, 3details
#30.01 s1, 2, 3details
#40.01 s1, 2, 3details
#50.01 s1, 2, 3details
#60.10 s2, 3details
#70.09 s2, 3details
#80.10 s2, 3details
#90.10 s2, 3details
#100.10 s2, 3details
#110.01 s3details
#120.01 s3details
#130.02 s3details
#140.02 s3details
#150.03 s3details
#160.02 s3details
#170.02 s3details

Code

#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;


int main(){
	fast;
	ll n, k;
	cin >> n >> k;
	ll a[n + 1];
	for(int i = 1; i <= n; ++i) 
		cin >> a[i];
	ll ans = 0;
	ll mn[n + 1][n + 1], mx[n + 1][n + 1];
	for(int i = 1; i <= n; ++i){
		for(int j = 1; j <= n; ++j){
			mn[i][j] = 1e18;
			mx[i][j] = 0;
		}
	}
	for(int i = 1; i <= n; ++i){
		for(int j = 1; j <= i; ++j){
			mn[j][i] = min(mn[j][i], min(a[i], mn[j][i - 1]));
			mx[j][i] = max(mx[j][i], max(a[i], mx[j][i - 1]));
		}
	}
 	for(int kk = 2; kk <= n; ++kk){
		for(int i = kk; i <= n; ++i){
			if(mx[i - kk + 1][i] - mn[i - kk + 1][i] >= k)
				++ans;
		}
	}
	cout << ans << "\n";
	return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict:

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

correct output
5050

user output
4950

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
4846

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
4934

Test 4

Group: 1, 2, 3

Verdict:

input
100 990000000
111122929 961821360 578238211 ...

correct output
4006

user output
1044

Test 5

Group: 1, 2, 3

Verdict:

input
100 1000000000
553190572 453407680 667300705 ...

correct output
5050

user output
0

Test 6

Group: 2, 3

Verdict:

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

correct output
2001000

user output
1999000

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
1997190

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
1998624

Test 9

Group: 2, 3

Verdict:

input
2000 999000000
746120950 772769620 721488968 ...

correct output
1287776

user output
713803

Test 10

Group: 2, 3

Verdict:

input
2000 1000000000
621947980 510355354 756705418 ...

correct output
2001000

user output
0

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)