Task: | Alitaulukot |
Sender: | Kertor |
Submission time: | 2020-10-05 13:24:45 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 37 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 11 |
#2 | ACCEPTED | 26 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#5 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#6 | ACCEPTED | 0.01 s | 2, 3 | details |
#7 | ACCEPTED | 0.01 s | 2, 3 | details |
#8 | ACCEPTED | 0.01 s | 2, 3 | details |
#9 | ACCEPTED | 0.01 s | 2, 3 | details |
#10 | ACCEPTED | 0.01 s | 2, 3 | details |
#11 | ACCEPTED | 0.02 s | 3 | details |
#12 | ACCEPTED | 0.02 s | 3 | details |
#13 | ACCEPTED | 0.03 s | 3 | details |
#14 | ACCEPTED | 0.05 s | 3 | details |
#15 | ACCEPTED | 0.05 s | 3 | details |
#16 | TIME LIMIT EXCEEDED | -- | 3 | details |
#17 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream> #include <sstream> #include <string> #include <cmath> #define lint long long int using namespace std; lint length(lint x) { return x * (x + 1) / 2; } lint CalculateSubArray(lint arr[], lint n, lint k) { lint i = 0; lint len = 0; lint result = 0; lint duplicate_len = 0; lint max = arr[0]; lint min = arr[0]; lint max_index = 0; lint min_index = 0; lint breaker_index = 0; lint checkpoint_index = 0; //An adventurer will always progress or get to the same point. while(i < n) { bool MaxChange = max < arr[i]; bool MinChange = min > arr[i]; if(MaxChange) { max = arr[i]; max_index = i; } else if(MinChange) { min = arr[i]; min_index = i; } if(max - min <= k) { len++; i++; duplicate_len += i <= checkpoint_index; } else { result += length(len); len = 0; result -= length(duplicate_len); duplicate_len = 0; if(MaxChange) { breaker_index = min_index; } else { breaker_index = max_index; } checkpoint_index = i; i = breaker_index + 1; max = arr[i]; max_index = i; min = arr[i]; min_index = i; } } result += length(len); result -= length(duplicate_len); return result; } int main() { lint n; cin >> n; lint k; cin >> k; lint arr[n]; for(lint i = 0; i < n; i++) { cin >> arr[i]; } cout << CalculateSubArray(arr, n, k); 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: 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: ACCEPTED
input |
---|
100000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
5000050000 |
user output |
---|
5000050000 |
Test 12
Group: 3
Verdict: ACCEPTED
input |
---|
100000 2 3 3 1 3 3 1 1 5 1 2 5 4 1 3 1 ... |
correct output |
---|
317066 |
user output |
---|
317066 |
Test 13
Group: 3
Verdict: ACCEPTED
input |
---|
100000 10 10 3 6 3 43 60 5 48 15 27 86 4... |
correct output |
---|
123292 |
user output |
---|
123292 |
Test 14
Group: 3
Verdict: ACCEPTED
input |
---|
100000 999990000 460235639 963048588 47270983 3... |
correct output |
---|
4946886742 |
user output |
---|
4946886742 |
Test 15
Group: 3
Verdict: ACCEPTED
input |
---|
100000 1000000000 885457070 18257718 927615960 3... |
correct output |
---|
5000050000 |
user output |
---|
5000050000 |
Test 16
Group: 3
Verdict: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
input |
---|
100000 50000 100000 99999 99998 99997 99996... |
correct output |
---|
3750075000 |
user output |
---|
(empty) |