#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> st;
int nt = 1;
int get_range(int l, int r, int k, int x, int y)
{
if (x > r || y < l) return 0;
if (x >= l && y <= r) return st[k];
int c = (x + y) / 2;
return get_range(l, r, k*2, x, c) + get_range(l, r, k*2|1, c+1, y);
}
void add(int index)
{
st[nt + index] = 1;
for (int i = (nt + index) / 2; i >= 1; i /= 2)
st[i] = st[i*2] + st[i*2|1];
}
vector<int> parent;
int find(int index)
{
if (!parent[index]) return index;
return parent[index] = find(parent[index]);
}
int find_best(int n)
{
parent = vector<int>(n);
while (nt < n) nt <<= 1;
st = vector<int>(2 * nt);
stack<int> stck;
int mx_cnt = 1;
while (1)
{
int l = 0, r = n - 1;
while (1)
{
int c = (l + r) / 2;
int index = find(c);
auto val = ask(index);
int cnt = val[0] + val[1];
if (cnt == 0)
return index;
if (cnt > mx_cnt)
{
mx_cnt = cnt;
while (!stck.empty())
{
add(stck.top());
stck.pop();
}
}
if (cnt < mx_cnt)
{
parent[index] = index + 1;
add(index);
break;
}
if (val[0] == get_range(0, index, 1, 0, nt-1))
l = c + 1;
else
r = c - 1;
stck.push(index);
}
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
3160 KB |
Output is correct |
| 2 |
Correct |
2 ms |
3160 KB |
Output is correct |
| 3 |
Correct |
1 ms |
3160 KB |
Output is correct |
| 4 |
Correct |
2 ms |
3160 KB |
Output is correct |
| 5 |
Correct |
1 ms |
3160 KB |
Output is correct |
| 6 |
Correct |
2 ms |
3160 KB |
Output is correct |
| 7 |
Correct |
1 ms |
3160 KB |
Output is correct |
| 8 |
Correct |
1 ms |
3160 KB |
Output is correct |
| 9 |
Correct |
1 ms |
3160 KB |
Output is correct |
| 10 |
Correct |
1 ms |
3160 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
3160 KB |
Output is correct |
| 2 |
Correct |
1 ms |
3160 KB |
Output is correct |
| 3 |
Correct |
1 ms |
3160 KB |
Output is correct |
| 4 |
Correct |
2 ms |
3160 KB |
Output is correct |
| 5 |
Correct |
1 ms |
3156 KB |
Output is correct |
| 6 |
Correct |
2 ms |
3160 KB |
Output is correct |
| 7 |
Correct |
2 ms |
3160 KB |
Output is correct |
| 8 |
Correct |
2 ms |
3160 KB |
Output is correct |
| 9 |
Correct |
1 ms |
3244 KB |
Output is correct |
| 10 |
Correct |
1 ms |
3160 KB |
Output is correct |
| 11 |
Correct |
3 ms |
3160 KB |
Output is correct |
| 12 |
Correct |
2 ms |
3160 KB |
Output is correct |
| 13 |
Correct |
4 ms |
3160 KB |
Output is correct |
| 14 |
Correct |
3 ms |
600 KB |
Output is correct |
| 15 |
Correct |
8 ms |
3288 KB |
Output is correct |
| 16 |
Partially correct |
32 ms |
3288 KB |
Partially correct - number of queries: 6553 |
| 17 |
Correct |
1 ms |
3160 KB |
Output is correct |
| 18 |
Partially correct |
45 ms |
3540 KB |
Partially correct - number of queries: 7888 |
| 19 |
Correct |
1 ms |
3160 KB |
Output is correct |
| 20 |
Correct |
9 ms |
1876 KB |
Output is correct |
| 21 |
Correct |
21 ms |
3416 KB |
Output is correct |
| 22 |
Correct |
5 ms |
3248 KB |
Output is correct |
| 23 |
Correct |
1 ms |
3228 KB |
Output is correct |
| 24 |
Correct |
1 ms |
3244 KB |
Output is correct |
| 25 |
Correct |
22 ms |
3532 KB |
Output is correct |
| 26 |
Correct |
25 ms |
3300 KB |
Output is correct |
| 27 |
Correct |
2 ms |
3160 KB |
Output is correct |
| 28 |
Partially correct |
47 ms |
3292 KB |
Partially correct - number of queries: 7378 |
| 29 |
Partially correct |
24 ms |
3296 KB |
Partially correct - number of queries: 5615 |
| 30 |
Partially correct |
50 ms |
3288 KB |
Partially correct - number of queries: 7827 |
| 31 |
Correct |
1 ms |
3160 KB |
Output is correct |
| 32 |
Correct |
4 ms |
3244 KB |
Output is correct |
| 33 |
Correct |
0 ms |
344 KB |
Output is correct |
| 34 |
Correct |
17 ms |
3288 KB |
Output is correct |
| 35 |
Correct |
2 ms |
3160 KB |
Output is correct |
| 36 |
Correct |
10 ms |
3296 KB |
Output is correct |
| 37 |
Correct |
3 ms |
3160 KB |
Output is correct |
| 38 |
Correct |
2 ms |
3164 KB |
Output is correct |
| 39 |
Correct |
24 ms |
3528 KB |
Output is correct |
| 40 |
Partially correct |
38 ms |
3288 KB |
Partially correct - number of queries: 6696 |
| 41 |
Correct |
25 ms |
3160 KB |
Output is correct |
| 42 |
Correct |
23 ms |
3296 KB |
Output is correct |
| 43 |
Correct |
25 ms |
3408 KB |
Output is correct |
| 44 |
Correct |
20 ms |
3276 KB |
Output is correct |
| 45 |
Correct |
22 ms |
3160 KB |
Output is correct |
| 46 |
Correct |
2 ms |
3240 KB |
Output is correct |
| 47 |
Correct |
20 ms |
3276 KB |
Output is correct |
| 48 |
Partially correct |
33 ms |
3280 KB |
Partially correct - number of queries: 5615 |
| 49 |
Correct |
6 ms |
3160 KB |
Output is correct |
| 50 |
Partially correct |
44 ms |
3540 KB |
Partially correct - number of queries: 7884 |
| 51 |
Correct |
21 ms |
3272 KB |
Output is correct |
| 52 |
Correct |
2 ms |
3288 KB |
Output is correct |
| 53 |
Correct |
3 ms |
3160 KB |
Output is correct |
| 54 |
Correct |
23 ms |
3292 KB |
Output is correct |
| 55 |
Correct |
1 ms |
3160 KB |
Output is correct |
| 56 |
Partially correct |
37 ms |
3300 KB |
Partially correct - number of queries: 7919 |
| 57 |
Partially correct |
26 ms |
3544 KB |
Partially correct - number of queries: 5525 |
| 58 |
Partially correct |
25 ms |
3292 KB |
Partially correct - number of queries: 5641 |
| 59 |
Correct |
24 ms |
3244 KB |
Output is correct |
| 60 |
Correct |
18 ms |
3280 KB |
Output is correct |
| 61 |
Correct |
2 ms |
3292 KB |
Output is correct |
| 62 |
Correct |
2 ms |
3160 KB |
Output is correct |
| 63 |
Correct |
2 ms |
3160 KB |
Output is correct |
| 64 |
Correct |
2 ms |
3288 KB |
Output is correct |
| 65 |
Correct |
5 ms |
3160 KB |
Output is correct |
| 66 |
Correct |
15 ms |
3292 KB |
Output is correct |
| 67 |
Incorrect |
18 ms |
3292 KB |
Integer 200000 violates the range [0, 199999] |
| 68 |
Halted |
0 ms |
0 KB |
- |
