#include "cup.h"
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
ll e = 30;
vector<int> find_cup() {
vector<ll> ans(2);
ll a, b;
a = b = 0;
ll i;
ll res = ask_shahrasb(-1 << 29, -1 << 29);
for (i = e; i >= 1; i--) {
ll loc = 1 << (i - 1);
if (i == e) {
if (res & loc) {
ll r = -1;
ll r1 = ask_shahrasb(a, b - 1) & loc;
if (r1) r = 0;
if (r == -1) r = ask_shahrasb(a - loc, b - 1) & loc;
if (r) a += loc / 2, b -= (loc + 1) / 2;
else a -= (loc + 1) / 2, b += loc / 2;
}
else {
ll r = -1;
ll r1 = ask_shahrasb(a - 1, b - 1) & loc;
if (r1) r = 0;
if (r == -1) r = ask_shahrasb(a - loc, b) & loc;
if (r) a += loc / 2, b += loc / 2;
else a -= (loc + 1) / 2, b -= (loc + 1) / 2;
}
}
if (res & loc) {
ll r = ask_shahrasb(a - loc * 2, b);
if (r & (loc * 2)) a += loc / 2, b -= (loc + 1) / 2;
else a -= (loc + 1) / 2, b += loc / 2;
}
else {
ll r = ask_shahrasb(a - loc * 2, b);
if (r & (loc * 2)) a += loc / 2, b += loc / 2;
else a -= (loc + 1) / 2, b -= (loc + 1) / 2;
}
}
ans[0] = a;
ans[1] = b;
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
WA in grader: -1 |
