# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
151840 | 2019-09-05T04:59:46 Z | davitmarg | Hotter Colder (IOI10_hottercolder) | C++17 | 950 ms | 8188 KB |
/*DavitMarg*/ #include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <string> #include <cstring> #include <map> #include <unordered_map> #include <set> #include <queue> #include <iomanip> #include <stack> #include <cassert> #include <iterator> #include <bitset> #include <fstream> #define mod 1000000007ll #define LL long long #define LD long double #define MP make_pair #define PB push_back #define all(v) v.begin(),v.end() using namespace std; #ifndef death #include "grader.h"; #endif #ifdef death int Guess(int a) { cout<<"! "<<a<<endl; int res; cin>>res; return res; } #endif int last; int guess(int x) { if(x==last) return 0; return Guess(x); } int HC(int n) { int l=1; int r=n; int m1,m2; int ans,k=0; while(l<=r) { k++; if(l==r) { ans=l; break; } int len=(r-l); m1=l+len/3; m2=r-len/3; int a2; if(k%2) { a2=Guess(m1); a2=Guess(m2); } else { a2=Guess(m2); a2=Guess(m1); a2*=-1; } if(a2==-1) r=m2-1; else if(a2==1) l=m1+1; else { l=m1+1; r=m2-1; } } return ans; } #ifdef death int main() { cout<<HC(3)<<endl; return 0; } #endif /* */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 34 ms | 1272 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 34 ms | 1272 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 34 ms | 1272 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 950 ms | 8188 KB | Output isn't correct - alpha = 0.000000000000 |