| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 335659 | couplefire | Wiring (IOI17_wiring) | C++17 | 0 ms | 0 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) {
if(n == 1) return 0;
int mx = 0;
for(int i = 0; i<100; i++){
srand(time(1));
vector<int> vv = ask(rand()%n);
mx = max(mx, vv.front()+vv.back());
}
int cur = 0;
for(int i = 0; i<mx; i++){
int lo = cur, hi = n-1;
while(lo < hi){
int mid = lo+(hi-lo)/2;
vector<int> vv = ask(mid);
int a = vv.front(), b = vv.back();
if(a+b < mx) hi = mid;
else if(a == i) lo = mid+1;
else hi = mid-1;
}
vector<int> vvv = ask(lo);
if(vvv.front()+vvv.back() == 0) return lo;
cur = lo+1;
}
return 0;
}