#include "grader.h"
///Subtask 2
///Binary Search
int HC(int N){
int L=1,R=N;
while(L<R){
int mid=(L+R)/2;
Guess(mid);
int act=Guess(mid+1);
if(act==-1){
R=mid;
}
else{
L=mid+1;
}
}
return L;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
26 ms |
1280 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
24 ms |
1280 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
24 ms |
1280 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
661 ms |
11832 KB |
Output isn't correct - alpha = 0.000000000000 |