CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:Kertor
Submission time:2020-10-06 23:54:32 +0300
Language:C++ (C++11)
Status:READY
Result:11
Feedback
groupverdictscore
#1ACCEPTED11
#20
#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
#60.69 s2, 3details
#70.69 s2, 3details
#80.70 s2, 3details
#90.71 s2, 3details
#100.71 s2, 3details
#11--3details
#12--3details
#13--3details
#14--3details
#15--3details
#16--3details
#17--3details

Code

#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <algorithm>
#include <bits/stdc++.h> 
#define ll long long int
 
using namespace std;
 
int NumberOfCombos = 0;
vector<vector<int>> ComboStorage;
 
void Combination(int arr[], int Size)
{
	int Range = 0;
	while(Range <= Size)
	{
		Range++;
		// i is starting index
		for(int i = 0; i < Size; i++)
		{
			if(i + Range > Size) {continue;}
			vector<int> CurrentVector;
			for(int r = i; r < Range+i; r++)
			{
				CurrentVector.push_back(arr[r]);
			}
			ComboStorage.push_back(CurrentVector);
			NumberOfCombos++;
		}
	}
}
 
int main()
{
	int i, n;
	int k;
	cin >> n;
	cin >> k;
	int arr[n];
	for(i = 0; i < n; i++)
	{
		cin >> arr[i];
	}
	Combination(arr, n);
	int CorrectAnswer = 0;
	for(int i = 0; i < NumberOfCombos; i++)
	{
		vector<int> vec(ComboStorage[i].begin(), ComboStorage[i].end());
		int max, min;
		max = *max_element(vec.begin(), vec.end()); 
		min = *min_element(vec.begin(), vec.end()); 
		if(max - min <= k)
		{
			CorrectAnswer++;
		}
	}
	cout << CorrectAnswer;
	return 0;
}

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:

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

correct output
2001000

user output
(empty)

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

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

Test 9

Group: 2, 3

Verdict:

input
2000 999000000
746120950 772769620 721488968 ...

correct output
1287776

user output
(empty)

Test 10

Group: 2, 3

Verdict:

input
2000 1000000000
621947980 510355354 756705418 ...

correct output
2001000

user output
(empty)

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)