# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
642325 |
2022-09-19T08:41:37 Z |
berr |
Colors (BOI20_colors) |
C++17 |
|
0 ms |
208 KB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int l, r, ans, c;
void query(int x)
{
cout<<"? "<<x<<endl;
cin>>ans;
}
int32_t main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
int n; cin>>n;
l=max(1LL, n/3), r=l;
query(l);
int t=1;
for(int i=31; i>=0; i--)
{
int pf=0;
if(t%2==1)
{
if((1LL<<i)+r<=n)
{
r+=(1LL<<i);
query(r);
if(ans==1)
{
pf=1;
t=0;
l+=min(r-l, 1LL<<i);
}
}
if(l-(1LL<<i)>0LL&&pf==0)
{
l-=(1LL<<i);
query(l);
if(ans==1)
{
r-=min(r-l, (1LL<<i));
}
}
}
else
{
if(l-(1LL<<i)>0LL)
{
l-=(1LL<<i);
query(l);
if(ans==1)
{
pf=1;
t=1;
r-=min(r-l, (1LL<<i));
}
}
if((1LL<<i)+r<=n&&pf==0)
{
r+=(1LL<<i);
query(r);
if(ans==1)
{
l+=min(r-l, 1LL<<i);
}
}
}
}
cout<<"= "<<abs(l-r)+1<<endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
OK (5 queries) |
2 |
Incorrect |
0 ms |
208 KB |
Wrong guess |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
OK (5 queries) |
2 |
Incorrect |
0 ms |
208 KB |
Wrong guess |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
OK (5 queries) |
2 |
Incorrect |
0 ms |
208 KB |
Wrong guess |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
OK (5 queries) |
2 |
Incorrect |
0 ms |
208 KB |
Wrong guess |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
OK (5 queries) |
2 |
Incorrect |
0 ms |
208 KB |
Wrong guess |
3 |
Halted |
0 ms |
0 KB |
- |