# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1074312 | 2024-08-25T09:40:22 Z | beaconmc | Hotter Colder (IOI10_hottercolder) | C++14 | 493 ms | 24332 KB |
#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; ll cnt = 0; int guess(ll a){ if (a==0) return -1; if (a==n+1) return -1; cnt++; return Guess(a); } int solve(int a, int b){ //cout << a << " " << b << endl; if (a==b) return a; ll mid = (a+b)/2; ll midleft = (a+mid)/2; ll midright = (b+mid+1)/2; ll left = guess(midleft); ll right = guess(midright); if (right == 0 ){ return (midleft+midright)/2; } else if (right == -1){ if ((midleft+midright)%2==0)return solve(a, mid-1); else return solve(a,mid); }else{ return solve(mid+1, b); } } int HC(int N){ sus.clear(); n = N; cnt = 0; ll ans = solve(1,N); //cout << ans << " " << cnt << endl; return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 1368 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 1372 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 1368 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 493 ms | 24332 KB | Output is partially correct - alpha = 0.068965517241 |