#include <bits/stdc++.h>
using namespace std;
#define sf scanf
#define pf printf
#define pb push_back
typedef long long ll;
int ask(ll x){
cout<<"? "<<x<<endl;
fflush(stdout);
int a;cin>>a;
return a;
}
void ans(ll x){
cout<<"= "<<x<<endl;
exit(0);
}
int main(){
ll n;cin>>n;
ll lo=1,hi=n,mid,res=-1;
vector<ll> v;
while(lo<=hi){
mid=(lo+hi)>>1;
v.pb(mid);
lo=mid+1;
}
ll cur=1;int m=1;
for(int i=v.size()-1;i>=0;--i){
cur+=m*v[i];
m=-m;
}
ask(cur);
lo=1,hi=n;
while(lo<=hi){
if(lo==hi&&res==-1){
res=lo;
break;
}
mid=(lo+hi)>>1;
cur+=m*mid;
m=-m;
if(ask(cur)==1)res=mid,hi=mid-1;
else lo=mid+1;
}
ans(res);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
OK (4 queries) |
2 |
Correct |
0 ms |
208 KB |
OK (7 queries) |
3 |
Correct |
1 ms |
208 KB |
OK (4 queries) |
4 |
Correct |
1 ms |
208 KB |
OK (5 queries) |
5 |
Correct |
0 ms |
208 KB |
OK (6 queries) |
6 |
Correct |
0 ms |
208 KB |
OK (7 queries) |
7 |
Correct |
0 ms |
208 KB |
OK (7 queries) |
8 |
Runtime error |
1 ms |
208 KB |
Execution killed with signal 13 |
9 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
OK (4 queries) |
2 |
Correct |
0 ms |
208 KB |
OK (7 queries) |
3 |
Correct |
1 ms |
208 KB |
OK (4 queries) |
4 |
Correct |
1 ms |
208 KB |
OK (5 queries) |
5 |
Correct |
0 ms |
208 KB |
OK (6 queries) |
6 |
Correct |
0 ms |
208 KB |
OK (7 queries) |
7 |
Correct |
0 ms |
208 KB |
OK (7 queries) |
8 |
Runtime error |
1 ms |
208 KB |
Execution killed with signal 13 |
9 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
OK (4 queries) |
2 |
Correct |
0 ms |
208 KB |
OK (7 queries) |
3 |
Correct |
1 ms |
208 KB |
OK (4 queries) |
4 |
Correct |
1 ms |
208 KB |
OK (5 queries) |
5 |
Correct |
0 ms |
208 KB |
OK (6 queries) |
6 |
Correct |
0 ms |
208 KB |
OK (7 queries) |
7 |
Correct |
0 ms |
208 KB |
OK (7 queries) |
8 |
Runtime error |
1 ms |
208 KB |
Execution killed with signal 13 |
9 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
OK (4 queries) |
2 |
Correct |
0 ms |
208 KB |
OK (7 queries) |
3 |
Correct |
1 ms |
208 KB |
OK (4 queries) |
4 |
Correct |
1 ms |
208 KB |
OK (5 queries) |
5 |
Correct |
0 ms |
208 KB |
OK (6 queries) |
6 |
Correct |
0 ms |
208 KB |
OK (7 queries) |
7 |
Correct |
0 ms |
208 KB |
OK (7 queries) |
8 |
Runtime error |
1 ms |
208 KB |
Execution killed with signal 13 |
9 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
OK (4 queries) |
2 |
Correct |
0 ms |
208 KB |
OK (7 queries) |
3 |
Correct |
1 ms |
208 KB |
OK (4 queries) |
4 |
Correct |
1 ms |
208 KB |
OK (5 queries) |
5 |
Correct |
0 ms |
208 KB |
OK (6 queries) |
6 |
Correct |
0 ms |
208 KB |
OK (7 queries) |
7 |
Correct |
0 ms |
208 KB |
OK (7 queries) |
8 |
Runtime error |
1 ms |
208 KB |
Execution killed with signal 13 |
9 |
Halted |
0 ms |
0 KB |
- |