CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:pvartiovaara
Submission time:2020-10-01 18:22:27 +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
#3ACCEPTED0.01 s1, 2, 3details
#40.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s2, 3details
#70.01 s2, 3details
#80.01 s2, 3details
#90.01 s2, 3details
#10ACCEPTED0.01 s2, 3details
#110.02 s3details
#120.03 s3details
#130.03 s3details
#140.05 s3details
#150.05 s3details
#160.04 s3details
#170.04 s3details

Code

#include <algorithm>
#include <bits/stdc++.h>

int main() {
	int n, k;
	std::cin>> n >> k;
	int prev, res = n; // result is always at least n
	std::cin>> prev;
	std::vector<std::vector<bool> > trues;
	std::vector<bool> temp;
	for (int i = 0; i < n-1; i++) {
		int in;
		std::cin>> in;

		//std::cerr<< std::max(prev, in) << ", " << std::min(prev, in) << std::endl;
		//check if the node is valid
		if ((std::max(prev, in) - std::min(prev, in)) <= k) { temp.push_back(true); }
		else {
			if (temp.size() > 0) {
				trues.push_back(temp);
				temp.clear();
				temp.shrink_to_fit();
			}
		}
		prev = in;
	}
	if (temp.size() > 0) { trues.push_back(temp); }
	//for (auto i : trues) {
	//	for (auto ii : i) {
	//		std::cerr<< ii;
	//	}
	//	std::cerr<< std::endl;
	//}
	//std::cerr<< std::endl;
	for (auto i : trues) {
		//std::cerr<< i.size() << std::endl;
		res = res + ((i.size()*(i.size()+1))/2);
	}
	std::cout<< res << std::endl;
	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:

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

correct output
317

user output
433

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:

input
100 990000000
111122929 961821360 578238211 ...

correct output
4006

user output
5050

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
9117

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
2433

Test 9

Group: 2, 3

Verdict:

input
2000 999000000
746120950 772769620 721488968 ...

correct output
1287776

user output
2001000

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:

input
100000 2
3 3 1 3 3 1 1 5 1 2 5 4 1 3 1 ...

correct output
317066

user output
456010

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
124735

Test 14

Group: 3

Verdict:

input
100000 999990000
460235639 963048588 47270983 3...

correct output
4946886742

user output
705082704

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
705082704

Test 17

Group: 3

Verdict:

input
100000 50000
100000 99999 99998 99997 99996...

correct output
3750075000

user output
705082704