| Task: | Alitaulukot |
| Sender: | Juksu |
| Submission time: | 2020-10-04 11:12:14 +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 | ACCEPTED | 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 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #6 | ACCEPTED | 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 | ACCEPTED | 0.01 s | 2, 3 | details |
| #11 | ACCEPTED | 0.08 s | 3 | details |
| #12 | WRONG ANSWER | 0.15 s | 3 | details |
| #13 | WRONG ANSWER | 0.10 s | 3 | details |
| #14 | WRONG ANSWER | 0.09 s | 3 | details |
| #15 | ACCEPTED | 0.09 s | 3 | details |
| #16 | WRONG ANSWER | 0.13 s | 3 | details |
| #17 | WRONG ANSWER | 0.13 s | 3 | details |
Code
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
int **l1 = new int*[n];
int **l2 = new int*[n];
for (int i = 0; i < n; i++) {
l1[i] = new int[(int)log2(n)];
l2[i] = new int[(int)log2(n)];
}
for (int i = 0; i < n; i++) {
int x;
cin >> x;
l1[i][0] = x;
l2[i][0] = x;
}
long long c = n;
for (int j = 1; (1 << j) <= n; j++) {
for (int i = 0; (i + (1 << j) - 1) < n; i++) {
if (l1[i][j - 1] < l1[i + (1 << (j - 1))][j - 1]) l1[i][j] = l1[i][j - 1];
else l1[i][j] = l1[i + (1 << (j - 1))][j - 1];
if (l2[i][j - 1] > l2[i + (1 << (j - 1))][j - 1]) l2[i][j] = l2[i][j - 1];
else l2[i][j] = l2[i + (1 << (j - 1))][j - 1];
}
}
for (int i = 0; i < n; i++) {
int a = i + 1;
int y = n - 1;
int p, p3;
int mi, ma, mi3, ma3;
int t = 0;
int et = t;
p = (int) log2(a - i + 1);
mi = (l1[i][p] <= l1[(a) - (1 << p) + 1][p]) ? l1[i][p] : l1[(a) - (1 << p) +1][p];
ma = (l2[i][p] >= l2[(a) - (1 << p) + 1][p]) ? l2[i][p] : l2[(a) - (1 << p) + 1][p];
if (ma - mi > k) {
continue;
}
while (true) {
t = (a + y) / 2;
if (et == t) break;
et = t;
p3 = (int) log2(t - i + 1);
mi3 = (l1[i][p3] <= l1[t - (1 << p3) + 1][p3]) ? l1[i][p3] : l1[t - (1 << p3) + 1][p3];
ma3 =(l2[i][p3] >= l2[t - (1 << p3) + 1][p3]) ? l2[i][p3] : l2[t - (1 << p3) + 1][p3];
p = (int) log2(y - i + 1);
mi = (l1[i][p] <= l1[(y) - (1 << p) + 1][p]) ? l1[i][p] : l1[(y) - (1 << p) +1][p];
ma = (l2[i][p] >= l2[(y) - (1 << p) + 1][p]) ? l2[i][p] : l2[(y) - (1 << p) + 1][p];
if (ma - mi <= k) {
t = y;
break;
}
//cout << a << ' ' << y << ' ' << t << '\n';
if (ma3 - mi3 <= t) {
a = t;
continue;
} else {
y = t;
continue;
}
}
// cout << i << ' '<< a << ' ' << y << ' ' << k << '\n';
c += max(0, t - i);
}
cout << c;
}
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: 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 |
|---|
| 3981 |
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 |
|---|
| 169 |
Test 4
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 990000000 111122929 961821360 578238211 ... |
| correct output |
|---|
| 4006 |
| user output |
|---|
| 2782 |
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: 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 |
|---|
| 1556203 |
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 |
|---|
| 365786 |
Test 9
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 2000 999000000 746120950 772769620 721488968 ... |
| correct output |
|---|
| 1287776 |
| user output |
|---|
| 997779 |
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: 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 |
|---|
| 3794106401 |
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 |
|---|
| 984674602 |
Test 14
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 999990000 460235639 963048588 47270983 3... |
| correct output |
|---|
| 4946886742 |
| user output |
|---|
| 2533398670 |
Test 15
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 1000000000 885457070 18257718 927615960 3... |
| correct output |
|---|
| 5000050000 |
| user output |
|---|
| 5000050000 |
Test 16
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 50000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 3750075000 |
| user output |
|---|
| 5000000001 |
Test 17
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 50000 100000 99999 99998 99997 99996... |
| correct output |
|---|
| 3750075000 |
| user output |
|---|
| 5000000001 |
