#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
const int MAXN = 2e5 + 5;
const int SIZE = 300;
int cnt[MAXN], num_q;
vi memo[MAXN];
vi query(int x) {
if (memo[x].size() > 0)
return memo[x];
num_q++;
vi ret = ask(x);
return memo[x] = ret;
}
int find_best(int n) {
memset(cnt, 0, sizeof cnt);
fill(memo, memo + n + 1, vi());
num_q = 0;
/*
int mx = -1;
for (int i = 0, j; i < n; i = j + 1) {
if (i == n - 1) return i;
j = i;
vi cur = query(i);
if (cur[0] + cur[1] == 0) return i;
if (cur[0] + cur[1] < mx) continue;
mx = max(mx, cur[0] + cur[1]);
int lo = i + 1, hi = n - 1;
while (lo <= hi) {
int mid = (lo + hi) >> 1;
vi now = query(mid);
if (now[0] + now[1] == 0) return mid;
if (now == cur) {
lo = mid + 1;
j = mid;
} else {
hi = mid - 1;
}
}
}
*/
for (int i = 0; i < n; i++) {
if (i == n - 1) return i;
vi cur = query(i);
int type = cur[0] + cur[1];
if (type == 0) return i;
cnt[type]++;
int b;
for (b = i / SIZE; (b + 1) * SIZE < n; b++) {
if (query((b + 1) * SIZE) != cur)
break;
}
int lo = max(i + 1, b * SIZE), hi = min(n - 1, (b + 1) * SIZE - 1);
while (lo < hi) {
int mid = (lo + hi) >> 1;
vi now = query(mid);
if (now == cur) {
lo = mid + 1;
} else {
hi = mid;
}
}
}
}
Compilation message
prize.cpp: In function 'int find_best(int)':
prize.cpp:71:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
166 ms |
5996 KB |
Incorrect |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
174 ms |
6176 KB |
Incorrect |
| 2 |
Halted |
0 ms |
0 KB |
- |
