# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
407366 | peuch | The Big Prize (IOI17_prize) | C++17 | 9 ms | 6164 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
int find_best(int n) {
srand(time(0));
vector<vector<int> > a(n);
int maxi = 0;
vector<int> ord;
for(int i = 0; i < n; i++) ord.push_back(i);
random_shuffle(ord.begin(), ord.end());
for(int i = 0; i < ord.size(); i++){
if(a[i].empty()) a[i] = ask(ord[i]);
if(a[i][0] == 0 && a[i][1] == 0) return ord[i];
if(a[i][0] + a[i][1] > maxi) maxi = a[i][0] + a[i][1];
if(a[i][0] + a[i][1] == maxi){
int ini = i, fim = n - 1;
bool flag = false;
while(ini != fim){
int mid = (ini + fim) >> 1;
if(ini == fim - 1) mid = fim;
if(a[mid].empty()) a[mid] = ask(ord[mid]);
if(a[mid][0] == 0 && a[mid][1] == 0) return ord[mid];
if(a[mid][0] + a[mid][1] > maxi){
maxi = a[mid][0] + a[mid][1];
flag = true;
break;
}
if(a[mid][0] != a[i][0] || a[mid][1] != a[i][1]) fim = mid - 1;
else ini = mid;
}
if(!flag) i = ini;
}
}
return ord[n - 1];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |