Submission #231100

#TimeUsernameProblemLanguageResultExecution timeMemory
231100muhammad_hokimiyonHotter Colder (IOI10_hottercolder)C++14
0 / 100
401 ms16476 KiB
#include<bits/stdc++.h> #include "grader.h" using namespace std; int HC(int nn) { int Q = 0; int ls1 = 0; int l = 1 , r = nn; while( l < r ){ int m = (l + r) / 2; int y2 = Guess( m + 1 ); Q += 1; if( y2 == -1 && ls1 == l - 1 && (l > 1 || r < nn) ){ r = m; ls1 = m + 1; continue; } if( y2 == -1 && (ls1 == r || ls1 == r + 1) ){ l = m + 1; ls1 = m + 1; continue; } Q += 1; int y1 = Guess( m ); ls1 = m; if( y1 == -1 )l = m + 1; else r = m; } assert( Q <= 16 ); return l; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...