#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second
int find_best(int n) {
int i = 0, at = 0;
vector<pii> resp(n, mk(-1,-1));
while(1) {
// achar primeiro cara mais valioso doq um pirulito de indice maior que i
int l = i, r = n-1;
while(l <= r) {
int mid = (l+r)/2;
vector<int> aux;
if(resp[mid] == mk(-1,-1)) aux = ask(mid), resp[mid] = {aux[0],aux[1]};
else aux = {resp[mid].fr};
if(aux[0] > at) r = mid-1;
else l = mid+1;
}
at++;
i = r;
vector<int> aux;
if(resp[i] == mk(-1,-1)) aux = ask(i), resp[i] = {aux[0], aux[1]};
else aux = {resp[i].fr, resp[i].sc};
if(aux[0] + aux[1] == 0) return i;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1880 KB |
Output is correct |
2 |
Correct |
1 ms |
1880 KB |
Output is correct |
3 |
Correct |
1 ms |
1880 KB |
Output is correct |
4 |
Correct |
1 ms |
1880 KB |
Output is correct |
5 |
Correct |
2 ms |
1880 KB |
Output is correct |
6 |
Correct |
1 ms |
2132 KB |
Output is correct |
7 |
Correct |
1 ms |
1880 KB |
Output is correct |
8 |
Correct |
1 ms |
1880 KB |
Output is correct |
9 |
Correct |
1 ms |
1880 KB |
Output is correct |
10 |
Correct |
1 ms |
1880 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1880 KB |
Output is correct |
2 |
Correct |
1 ms |
2136 KB |
Output is correct |
3 |
Correct |
1 ms |
1880 KB |
Output is correct |
4 |
Correct |
1 ms |
1880 KB |
Output is correct |
5 |
Correct |
1 ms |
1880 KB |
Output is correct |
6 |
Correct |
1 ms |
1880 KB |
Output is correct |
7 |
Correct |
1 ms |
1880 KB |
Output is correct |
8 |
Correct |
1 ms |
1876 KB |
Output is correct |
9 |
Correct |
1 ms |
2076 KB |
Output is correct |
10 |
Correct |
1 ms |
1880 KB |
Output is correct |
11 |
Correct |
2 ms |
1880 KB |
Output is correct |
12 |
Correct |
1 ms |
1880 KB |
Output is correct |
13 |
Correct |
2 ms |
1880 KB |
Output is correct |
14 |
Correct |
2 ms |
600 KB |
Output is correct |
15 |
Execution timed out |
3025 ms |
1960 KB |
Time limit exceeded |
16 |
Halted |
0 ms |
0 KB |
- |