#include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
int getx()
{
int st = 0, pas = 1ll << 60;
while (pas != 0)
{
if (st + pas <= n)
{
int x = st + pas;
bool oops = false;
int l = 1, r = n, pass = -1;
while (l < r)
{
int y;
pass++;
int rn = (r - l) / 2;
if (pass % 2 == 0)
y = x + l + rn;
else
y = x - l - rn;
if (y > n)
oops = true;
l = abs(x - y) + 1;
x = y;
}
if (!oops)
st += pas;
}
pas /= 2;
}
return st;
}
signed main()
{
cin >> n;
int x = getx();
cout << "? " << x << endl;
int rsp;
cin >> rsp;
int l = 1, r = n;
int pas = -1;
while (l < r)
{
int y;
pas++;
///eu legit caut binar cu l si r, in ce hal am ajuns
int rn = (r - l) / 2;
if (pas % 2 == 0)
y = x + l + rn;
else
y = x - l - rn;
cout << "? " << y << endl;
cin >> rsp;
if (rsp == 0)
l = abs(x - y) + 1;
else
r = abs(x - y);
x = y;
}
cout << l;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
344 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
344 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
344 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
344 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
344 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |