| Task: | Alitaulukot |
| Sender: | Nanohenry |
| Submission time: | 2020-09-28 01:39:40 +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 | WRONG ANSWER | 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.03 s | 3 | details |
| #13 | WRONG ANSWER | 0.03 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
#include <iostream>
#include <deque>
using namespace std;
#define min(a, b) ((a < b)? a : b)
#define max(a, b) ((a > b)? a : b)
#define SM sm.front()
#define LG lg.front()
#define BCM (b < n - 1 && max(LG, x[b + 1]) - min(SM, x[b + 1]) <= k)
typedef long long ll;
ll n, k, a, b, x[100000], i, j, s, c;
deque<ll> sm, lg;
inline void rm(ll v) {
if (v == SM) {
sm.pop_front();
}
if (v == LG) {
lg.pop_front();
}
}
inline void add(ll v) {
while (sm.size() > 0 && v < sm.back()) {
sm.pop_back();
}
sm.push_back(v);
while (lg.size() > 0 && v > lg.back()) {
lg.pop_back();
}
lg.push_back(v);
}
int main() {
cin >> n >> k;
for (; i < n; i++) {
cin >> x[i];
}
add(x[0]);
while (1) {
//cout << "===" << endl;
//cout << "a " << a << " b " << b << endl;
//cout << "max " << LG << " min " << SM << endl;
//cout << "b move? " << BCM << endl;
if (BCM) {
b++;
//cout << "new a " << a << " b " << b << endl;
add(x[b]);
//cout << "new max " << LG << " min " << SM << endl;
} else if (a < b) {
for (j = a; j < b; j++) {
c += b - j + 1;
}
c--;
rm(x[a]);
a++;
//cout << "new a " << a << " b " << b << endl;
//cout << "new max " << LG << " min " << SM << endl;
} else if (a < n - 1) {
b++;
add(x[b]);
c++;
rm(x[a]);
a++;
//cout << "new a " << a << " b " << b << endl;
//cout << "new max " << LG << " min " << SM << endl;
} else {
c++;
rm(x[a]);
break;
}
}
c++;
cout << c << endl;
}
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 |
|---|
| 171503 |
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 |
|---|
| 741 |
Test 3
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 10 71 60 61 96 25 10 10 9 84 85 1... |
| correct output |
|---|
| 119 |
| user output |
|---|
| 107 |
Test 4
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 990000000 111122929 961821360 578238211 ... |
| correct output |
|---|
| 4006 |
| user output |
|---|
| 105731 |
Test 5
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 1000000000 553190572 453407680 667300705 ... |
| correct output |
|---|
| 5050 |
| user output |
|---|
| 171503 |
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 |
|---|
| 1335330003 |
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 |
|---|
| 14468 |
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 |
|---|
| 2173 |
Test 9
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 2000 999000000 746120950 772769620 721488968 ... |
| correct output |
|---|
| 1287776 |
| user output |
|---|
| 586227115 |
Test 10
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 2000 1000000000 621947980 510355354 756705418 ... |
| correct output |
|---|
| 2001000 |
| user output |
|---|
| 1335330003 |
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 |
|---|
| 757550 |
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 |
|---|
| 111161 |
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) |