| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1366010 | akqxolotl | The Big Prize (IOI17_prize) | C++20 | 0 ms | 412 KiB |
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef pair<int,int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define debug(x) cerr<<#x<<" is "<<x<<endl;
#define sz(x) (int)(x).size()
#define pb push_back
#define ipii pair<int,pii>
int find_best(int n) {
int l=-1,h=n;
while(l<h-1){
int m=(l+h)/2;
vi res=ask(m);
if(res[0]==res[1])return m;
else if(res[0]>res[1])h=m;
else l=m;
}
return 0;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
