# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
292255 | 2020-09-06T16:26:07 Z | amiratou | Hotter Colder (IOI10_hottercolder) | C++14 | 4219 ms | 10872 KB |
#include "grader.h" #include <bits/stdc++.h> #define rando mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()) using namespace std; map<pair<int,int>,int> mymap; int HC(int N){ if(N==1)return 1; mymap.clear(); int l=1,r=N,a,b,last=-1; while((r-l)>2){ a=l+(r-l)/3,b=r-(r-l)/3; int med=(a+b)>>1; //cerr<<l<<" "<<r<<"\n"; //cerr<<a<<" "<<b<<"\n"; int A,B; if(mymap.count({a,b})) B=mymap[{a,b}]; else{ A=Guess(a),B=Guess(b),last=b; mymap[{a,b}]=B; } if(!B) return (a+b)/2; if(B==1)l=med+1; else r=med; } //cerr<<l<<" "<<r<<"\n"; int g,h; if(mymap.count({l,r})){ //cerr<<"1111\n"; h=mymap[{l,r}]; } else{ g=Guess(l),h=Guess(r); mymap[{l,r}]=h; } if(!h)return l+1; else if(h==1)return r; else return l; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 113 ms | 1400 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 113 ms | 1280 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 112 ms | 1280 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 4219 ms | 10872 KB | Output is partially correct - alpha = 0.066666666667 |