# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1074264 | beaconmc | Hotter Colder (IOI10_hottercolder) | C++14 | 2220 ms | 262144 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 "grader.h"
#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(lli = x; i>y; i--)
using namespace std;
ll n;
map<ll,ll> sus;
int guess(ll a){
if (sus.count(a)) return sus[a];
if (a==0) return -1;
if (a==n+1) return -1;
return sus[a] = Guess(a);
}
int solve(int a, int b){
//cout << a << " " << b << endl;
if (a==b) return a;
ll mid = (a+b)/2;
ll midval = guess(mid);
ll right = guess(mid+1);
if (right == -1){
return solve(a, mid);
}else{
return solve(mid+1, b);
}
}
int HC(int N){
n = N;
ll ans = solve(1,N);
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |