#include "grader.h"
int HC(int N){
int le,ri;
int st,fi;
st=1;
fi=N;
le=1;
ri=N;
//int pre=-1000;
int pre=(le+ri*2)/3;
Guess(pre);
while(true){
if(le==ri)
return le;
int mid=(le+ri)/2;
int x=2*mid-pre;
if(x==pre)
x++;
if(x>=st&&x<=fi){
int k=Guess(x);
if(k==0)
return (x+pre)/2;
else if(k>0){
if(x<pre){
ri=(x+pre)/2-((x+pre)%2==0);
pre=x;
}
else{
le=(x+pre)/2+1;
pre=x;
}
}
else{
if(x<pre){
le=(x+pre)/2+1;
pre=x;
}
else{
ri=(x+pre)/2-((x+pre)%2==0);
pre=x;
}
}
}
else{
int k;
if(x<st){
x=1;
k=Guess(x);
}
else{
x=N;
k=Guess(x);
}
if(k==0)
return (x+pre)/2;
else if(k>0){
if(x<pre){
ri=(x+pre)/2-((x+pre)%2==0);
pre=x;
}
else{
le=(x+pre)/2+1;
pre=x;
}
}
else{
if(x<pre){
le=(x+pre)/2+1;
pre=x;
}
else{
ri=(x+pre)/2-((x+pre)%2==0);
pre=x;
}
}
//x=(le*2+ri)/3;
//x=le;
//Guess(x);
//pre=x;
}
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
26 ms |
1272 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
27 ms |
1272 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
26 ms |
1272 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
771 ms |
8308 KB |
Output is partially correct - alpha = 0.185185185185 |