Task: | Alitaulukot |
Sender: | T |
Submission time: | 2020-09-28 23:01:17 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
#2 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#4 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
#5 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
#6 | WRONG ANSWER | 0.01 s | 2, 3 | details |
#7 | WRONG ANSWER | 0.01 s | 2, 3 | details |
#8 | WRONG ANSWER | 0.01 s | 2, 3 | details |
#9 | WRONG ANSWER | 0.01 s | 2, 3 | details |
#10 | WRONG ANSWER | 0.01 s | 2, 3 | details |
#11 | TIME LIMIT EXCEEDED | -- | 3 | details |
#12 | WRONG ANSWER | 0.01 s | 3 | details |
#13 | WRONG ANSWER | 0.02 s | 3 | details |
#14 | TIME LIMIT EXCEEDED | -- | 3 | details |
#15 | TIME LIMIT EXCEEDED | -- | 3 | details |
#16 | TIME LIMIT EXCEEDED | -- | 3 | details |
#17 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
/** * Datatähti 2021 alku * Alitaulukot/Subtables * @author TRS */ //Include #include <bits/stdc++.h> #include <iostream> #include <algorithm> #include <list> #include <queue> #include <cmath> #include <climits> #include <vector> #include <string> #include <regex> //Definitions using namespace std; using ll = long long; typedef pair<int, int> pii; typedef pair<long long, long long> pll; typedef pair<string, string> pss; typedef vector<int> vi; #define pb push_back #define mp make_pair #define mt make_tuple //Constants #define infinity 0x3f3f3f3f #define linfinity 0x3f3f3f3f3f3f3f3f #define MOD 1000000007 const int MX = 100001; int a[MX]; int n, k; ll solve(int a[], int k) { if (n == 1) { return 1; } ll answer = n; int leftPointer = 0; int rightPointer = 1; int minimum = min(a[0], a[1]); int maximum = max(a[0], a[1]); while (leftPointer < n - 1) { if (maximum - minimum <= k) { answer++; if (rightPointer < n - 1) { rightPointer++; minimum = min(minimum, a[rightPointer]); maximum = max(maximum, a[rightPointer]); } else { leftPointer++; minimum = *min_element(a + leftPointer, a + rightPointer + 1); maximum = *max_element(a + leftPointer, a + rightPointer + 1); } } else { rightPointer--; leftPointer++; if (leftPointer >= rightPointer) { rightPointer = leftPointer + 1; } minimum = *min_element(a + leftPointer, a + rightPointer + 1); maximum = *max_element(a + leftPointer, a + rightPointer + 1); } } return answer; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin>>n>>k; for (int i = 0; i < n; i++) { cin>>a[i]; } cout<<solve(a, k); return 0; }
Test details
Test 1
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
100 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
5050 |
user output |
---|
297 |
Test 2
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
100 2 5 5 2 4 3 5 3 4 3 2 3 4 5 4 4 ... |
correct output |
---|
317 |
user output |
---|
233 |
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: WRONG ANSWER
input |
---|
100 990000000 111122929 961821360 578238211 ... |
correct output |
---|
4006 |
user output |
---|
297 |
Test 5
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
100 1000000000 553190572 453407680 667300705 ... |
correct output |
---|
5050 |
user output |
---|
297 |
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
2000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
2001000 |
user output |
---|
5997 |
Test 7
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
2000 2 4 4 1 4 2 3 1 2 1 3 5 2 2 4 4 ... |
correct output |
---|
6340 |
user output |
---|
4601 |
Test 8
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
2000 10 65 88 33 88 41 10 17 38 22 3 8... |
correct output |
---|
2413 |
user output |
---|
2402 |
Test 9
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
2000 999000000 746120950 772769620 721488968 ... |
correct output |
---|
1287776 |
user output |
---|
5997 |
Test 10
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
2000 1000000000 621947980 510355354 756705418 ... |
correct output |
---|
2001000 |
user output |
---|
5997 |
Test 11
Group: 3
Verdict: TIME LIMIT EXCEEDED
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: WRONG ANSWER
input |
---|
100000 2 3 3 1 3 3 1 1 5 1 2 5 4 1 3 1 ... |
correct output |
---|
317066 |
user output |
---|
227676 |
Test 13
Group: 3
Verdict: WRONG ANSWER
input |
---|
100000 10 10 3 6 3 43 60 5 48 15 27 86 4... |
correct output |
---|
123292 |
user output |
---|
122804 |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 999990000 460235639 963048588 47270983 3... |
correct output |
---|
4946886742 |
user output |
---|
(empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 1000000000 885457070 18257718 927615960 3... |
correct output |
---|
5000050000 |
user output |
---|
(empty) |
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) |