#include "prize.h"
#include <bits/stdc++.h>
typedef int ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
using namespace std;
map<ll, vector<ll>> cache;
vector<ll> query(int n){
if (cache.count(n)) return cache[n];
else return cache[n] = ask(n);
}
int find_best(int n) {
cache.clear();
vector<ll> stuff(n);
FOR(i,0,n) stuff[i] = i;
ll maxi = -1;
FOR(i,0,min(500, n)){
vector<ll> sus = query(i);
maxi = max(maxi, sus[0]+sus[1]);
}
vector<ll> found;
ll ans = -1;
while (ans == -1){
ll lo = 0;
ll hi = stuff.size()-1;
bool skip = false;
while (lo < hi){
ll mid = (lo+hi)/2;
vector<ll> sus = query(stuff[mid]);
if (sus[0] + sus[1] < maxi){
if (sus[0]+sus[1]==0) return stuff[mid];
found.push_back(stuff[mid]);
stuff.erase(stuff.begin()+mid);
skip = true;
break;
}else{
sort(found.begin(), found.end());
ll idk = upper_bound(found.begin(), found.end(), stuff[mid]) - found.begin();
if (idk < sus[0]){
hi = mid;
}else{
lo = mid+1;
}
}
}
if (skip) continue;
vector<ll> sus = query(lo);
if (sus[0]+sus[1]==0) return stuff[lo];
found.push_back(stuff[lo]);
stuff.erase(stuff.begin()+lo);
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
1112 KB |
Output is correct |
| 2 |
Correct |
4 ms |
1112 KB |
Output is correct |
| 3 |
Correct |
3 ms |
1456 KB |
Output is correct |
| 4 |
Correct |
3 ms |
1368 KB |
Output is correct |
| 5 |
Correct |
2 ms |
1192 KB |
Output is correct |
| 6 |
Correct |
3 ms |
1112 KB |
Output is correct |
| 7 |
Correct |
3 ms |
1112 KB |
Output is correct |
| 8 |
Correct |
3 ms |
1192 KB |
Output is correct |
| 9 |
Correct |
4 ms |
1112 KB |
Output is correct |
| 10 |
Correct |
3 ms |
1112 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
1624 KB |
Output is correct |
| 2 |
Correct |
3 ms |
1112 KB |
Output is correct |
| 3 |
Correct |
3 ms |
1368 KB |
Output is correct |
| 4 |
Correct |
2 ms |
1108 KB |
Output is correct |
| 5 |
Correct |
3 ms |
1112 KB |
Output is correct |
| 6 |
Correct |
2 ms |
1112 KB |
Output is correct |
| 7 |
Correct |
3 ms |
1260 KB |
Output is correct |
| 8 |
Correct |
4 ms |
1112 KB |
Output is correct |
| 9 |
Correct |
2 ms |
1112 KB |
Output is correct |
| 10 |
Correct |
3 ms |
1112 KB |
Output is correct |
| 11 |
Correct |
4 ms |
1112 KB |
Output is correct |
| 12 |
Correct |
3 ms |
1108 KB |
Output is correct |
| 13 |
Correct |
7 ms |
1112 KB |
Output is correct |
| 14 |
Correct |
4 ms |
544 KB |
Output is correct |
| 15 |
Correct |
7 ms |
1384 KB |
Output is correct |
| 16 |
Partially correct |
40 ms |
1948 KB |
Partially correct - number of queries: 5022 |
| 17 |
Correct |
3 ms |
1112 KB |
Output is correct |
| 18 |
Partially correct |
49 ms |
1616 KB |
Partially correct - number of queries: 6007 |
| 19 |
Correct |
2 ms |
1112 KB |
Output is correct |
| 20 |
Correct |
11 ms |
856 KB |
Output is correct |
| 21 |
Correct |
14 ms |
1624 KB |
Output is correct |
| 22 |
Correct |
5 ms |
1112 KB |
Output is correct |
| 23 |
Correct |
2 ms |
1112 KB |
Output is correct |
| 24 |
Correct |
2 ms |
1112 KB |
Output is correct |
| 25 |
Correct |
19 ms |
1368 KB |
Output is correct |
| 26 |
Correct |
20 ms |
1624 KB |
Output is correct |
| 27 |
Correct |
3 ms |
1112 KB |
Output is correct |
| 28 |
Partially correct |
41 ms |
1872 KB |
Partially correct - number of queries: 5524 |
| 29 |
Correct |
24 ms |
1456 KB |
Output is correct |
| 30 |
Partially correct |
40 ms |
1872 KB |
Partially correct - number of queries: 5923 |
| 31 |
Correct |
2 ms |
1112 KB |
Output is correct |
| 32 |
Correct |
3 ms |
1112 KB |
Output is correct |
| 33 |
Correct |
1 ms |
344 KB |
Output is correct |
| 34 |
Correct |
15 ms |
1360 KB |
Output is correct |
| 35 |
Correct |
3 ms |
1112 KB |
Output is correct |
| 36 |
Correct |
9 ms |
1368 KB |
Output is correct |
| 37 |
Correct |
2 ms |
1112 KB |
Output is correct |
| 38 |
Correct |
3 ms |
1112 KB |
Output is correct |
| 39 |
Correct |
14 ms |
1368 KB |
Output is correct |
| 40 |
Partially correct |
28 ms |
1732 KB |
Partially correct - number of queries: 5163 |
| 41 |
Correct |
20 ms |
1616 KB |
Output is correct |
| 42 |
Correct |
28 ms |
1592 KB |
Output is correct |
| 43 |
Correct |
18 ms |
1620 KB |
Output is correct |
| 44 |
Correct |
15 ms |
1368 KB |
Output is correct |
| 45 |
Correct |
13 ms |
1368 KB |
Output is correct |
| 46 |
Correct |
2 ms |
1112 KB |
Output is correct |
| 47 |
Correct |
17 ms |
1316 KB |
Output is correct |
| 48 |
Correct |
26 ms |
1680 KB |
Output is correct |
| 49 |
Correct |
5 ms |
1112 KB |
Output is correct |
| 50 |
Partially correct |
36 ms |
1872 KB |
Partially correct - number of queries: 5979 |
| 51 |
Correct |
19 ms |
1724 KB |
Output is correct |
| 52 |
Correct |
3 ms |
1368 KB |
Output is correct |
| 53 |
Correct |
5 ms |
1112 KB |
Output is correct |
| 54 |
Correct |
16 ms |
1624 KB |
Output is correct |
| 55 |
Correct |
3 ms |
1112 KB |
Output is correct |
| 56 |
Partially correct |
43 ms |
1868 KB |
Partially correct - number of queries: 5984 |
| 57 |
Correct |
35 ms |
1684 KB |
Output is correct |
| 58 |
Correct |
36 ms |
1628 KB |
Output is correct |
| 59 |
Correct |
23 ms |
1624 KB |
Output is correct |
| 60 |
Correct |
21 ms |
1456 KB |
Output is correct |
| 61 |
Correct |
3 ms |
1112 KB |
Output is correct |
| 62 |
Correct |
3 ms |
1368 KB |
Output is correct |
| 63 |
Correct |
3 ms |
1112 KB |
Output is correct |
| 64 |
Correct |
2 ms |
1112 KB |
Output is correct |
| 65 |
Correct |
4 ms |
1112 KB |
Output is correct |
| 66 |
Correct |
26 ms |
1640 KB |
Output is correct |
| 67 |
Correct |
6 ms |
1368 KB |
Output is correct |
| 68 |
Correct |
5 ms |
1112 KB |
Output is correct |
| 69 |
Correct |
37 ms |
1476 KB |
Output is correct |
| 70 |
Correct |
4 ms |
1368 KB |
Output is correct |
| 71 |
Incorrect |
79 ms |
2244 KB |
Incorrect |
| 72 |
Halted |
0 ms |
0 KB |
- |
