#include "prize.h"
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
using ll = long long;
template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }
vector<int> perm;
vector<vector<int>> memo;
vector<int> Ask(int n) {
n = perm[n];
if (memo[n].empty()) memo[n] = ask(n);
return memo[n];
}
int solve(int n) {
int cnt = 0, xx = 500;
rep (i, 500) {
auto res = Ask(i);
chmax(cnt, res[0] + res[1]);
if (res[0] + res[1] == 0) return i;
if (cnt >= 30) {
xx = i + 1;
break;
}
}
int x = xx;
while (x < n) {
int y = 0;
while (x < n) {
auto res = Ask(x);
if (res[0] + res[1] == 0) return x;
if (res[0] + res[1] == cnt) {
y = res[0];
break;
}
++x;
}
int ok = xx, ng = n;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
if (mid <= x) ok = mid;
else {
auto res = Ask(mid);
if (res[0] + res[1] == 0) return mid;
if (res[0] + res[1] < cnt) ng = mid;
else if (res[0] > y) ng = mid;
else ok = mid;
}
}
x = ok + 1;
}
}
int find_best(int n) {
memo.assign(n, {});
perm.resize(n); iota(all(perm), 0);
mt19937 mt(random_device{}());
shuffle(all(perm), mt);
int x = solve(n);
return perm[x];
}
Compilation message
prize.cpp: In function 'int solve(int)':
prize.cpp:66:1: warning: control reaches end of non-void function [-Wreturn-type]
66 | }
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3040 ms |
5720 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3038 ms |
5720 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
