| Task: | Riippuliito |
| Sender: | Into Almiala |
| Submission time: | 2020-02-09 15:59:36 +0200 |
| 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 | ACCEPTED | 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 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #6 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #7 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #8 | WRONG ANSWER | 0.01 s | 2, 3 | details |
| #9 | ACCEPTED | 0.01 s | 2, 3 | details |
| #10 | ACCEPTED | 0.01 s | 2, 3 | details |
| #11 | WRONG ANSWER | 0.01 s | 2, 3 | details |
| #12 | ACCEPTED | 0.01 s | 2, 3 | details |
| #13 | ACCEPTED | 0.01 s | 2, 3 | details |
| #14 | ACCEPTED | 0.01 s | 2, 3 | details |
| #15 | WRONG ANSWER | 0.11 s | 3 | details |
| #16 | ACCEPTED | 0.12 s | 3 | details |
| #17 | ACCEPTED | 0.14 s | 3 | details |
| #18 | WRONG ANSWER | 0.06 s | 3 | details |
| #19 | ACCEPTED | 0.11 s | 3 | details |
| #20 | WRONG ANSWER | 0.16 s | 3 | details |
| #21 | WRONG ANSWER | 0.17 s | 3 | details |
| #22 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #23 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #24 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #25 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #26 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #27 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #28 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #29 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
Compiler report
input/code.cpp: In function 'std::pair<int, int> max_range(int, int)':
input/code.cpp:47:11: warning: 'i' may be used uninitialized in this function [-Wmaybe-uninitialized]
while (i < N) {
~~^~~Code
#include <iostream>
#include <vector>
using namespace std;
int n, N;
int t[1<<19];
void upd(int x, int k) {
x += N;
t[x] = k;
for (x /= 2; x > 0; x /= 2) {
t[x] = max(t[2*x], t[2*x+1]);
}
}
pair<int,int> max_range(int a, int b) {
a += N;
b += N;
int m = 0;
vector<int> va, vb;
while (a <= b) {
if (a%2 == 1) {
m = max(m, t[a++]);
va.push_back(a-1);
}
if (b%2 == 0) {
m = max(m, t[b--]);
vb.push_back(b+1);
}
a /= 2;
b /= 2;
}
int i;
for (int j = vb.size()-1; j >= 0; j--) {
if (t[vb[j]] == m) {
i = vb[j];
break;
}
}
for (auto u : va) {
if (t[u] == m) {
i = u;
break;
}
}
while (i < N) {
i = 2*i+1;
if (t[i-1] == m) i--;
}
return {m, i-N};
}
int search(int a, int b) {
if (b < a) return 0;
if (a == b) return 1;
pair<int,int> m = max_range(a, b);
int x = m.second;
return max(search(a, x-1), search(x+1, b))+1;
}
int main() {
cin >> n;
N = n;
bool c = 0;
while (__builtin_popcount(N) > 1) {
N^=N&-N;
c = 1;
}
if (c) N <<= 1;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
upd(i, h);
}
cout << search(0, n-1) << endl;
}
Test details
Test 1
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 10 1 1 1 1 1 1 1 1 1 1 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 10 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 10 1 2 3 4 5 6 7 8 9 10 |
| correct output |
|---|
| 10 |
| user output |
|---|
| 10 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 10 10 9 8 7 6 5 4 3 2 1 |
| correct output |
|---|
| 10 |
| user output |
|---|
| 10 |
Test 4
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 9 6 10 10 3 6 7 6 5 |
| correct output |
|---|
| 4 |
| user output |
|---|
| 6 |
Test 5
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 10 51 90 27 98 85 47 14 55 82 52 |
| correct output |
|---|
| 6 |
| user output |
|---|
| 6 |
Test 6
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 10 9 65 90 86 45 52 52 95 40 85 |
| correct output |
|---|
| 5 |
| user output |
|---|
| 5 |
Test 7
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 10 3 46 77 16 59 32 22 41 87 89 |
| correct output |
|---|
| 7 |
| user output |
|---|
| 7 |
Test 8
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 5000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1 |
| user output |
|---|
| 5000 |
Test 9
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 5000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 5000 |
| user output |
|---|
| 5000 |
Test 10
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 5000 5000 4999 4998 4997 4996 4995 ... |
| correct output |
|---|
| 5000 |
| user output |
|---|
| 5000 |
Test 11
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 5000 10 8 10 5 4 9 2 9 10 10 1 2 7 ... |
| correct output |
|---|
| 9 |
| user output |
|---|
| 480 |
Test 12
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 5000 655923386 310000737 281882248 ... |
| correct output |
|---|
| 28 |
| user output |
|---|
| 28 |
Test 13
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 5000 123456789 123456790 123456791 ... |
| correct output |
|---|
| 2706 |
| user output |
|---|
| 2706 |
Test 14
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 5000 123456789 123456790 123456791 ... |
| correct output |
|---|
| 5000 |
| user output |
|---|
| 5000 |
Test 15
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1 |
| user output |
|---|
| 200000 |
Test 16
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 200000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 200000 |
| user output |
|---|
| 200000 |
Test 17
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 200000 200000 199999 199998 199997 19... |
| correct output |
|---|
| 200000 |
| user output |
|---|
| 200000 |
Test 18
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 200000 4 7 8 3 3 10 3 4 2 6 10 8 5 8 ... |
| correct output |
|---|
| 10 |
| user output |
|---|
| 20279 |
Test 19
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 200000 824527039 112439661 517794857 ... |
| correct output |
|---|
| 43 |
| user output |
|---|
| 43 |
Test 20
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 200000 123456789 123456790 123456791 ... |
| correct output |
|---|
| 30764 |
| user output |
|---|
| 55509 |
Test 21
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 200000 123456789 123456790 123456791 ... |
| correct output |
|---|
| 61367 |
| user output |
|---|
| 93970 |
Test 22
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 1 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 23
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 2 1 1 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 2 |
Test 24
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 2 1 2 |
| correct output |
|---|
| 2 |
| user output |
|---|
| 2 |
Test 25
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 2 2 1 |
| correct output |
|---|
| 2 |
| user output |
|---|
| 2 |
Test 26
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 3 1 2 1 |
| correct output |
|---|
| 2 |
| user output |
|---|
| 2 |
Test 27
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 3 1 2 3 |
| correct output |
|---|
| 3 |
| user output |
|---|
| 3 |
Test 28
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 3 3 2 1 |
| correct output |
|---|
| 3 |
| user output |
|---|
| 3 |
Test 29
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 3 2 1 2 |
| correct output |
|---|
| 2 |
| user output |
|---|
| 3 |
