# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1074266 | 2024-08-25T09:12:08 Z | beaconmc | Hotter Colder (IOI10_hottercolder) | C++14 | 3490 ms | 90172 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; 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){ sus.clear(); n = N; ll ans = solve(1,N); return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 103 ms | 10320 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 138 ms | 10576 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 107 ms | 10404 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3490 ms | 90172 KB | Output isn't correct - alpha = 0.000000000000 |
2 | Halted | 0 ms | 0 KB | - |