#include "cup.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_cup()
{
int a = 0, b = 0;
int X_xor_Y = ask_shahrasb(0, 0);
for(int i = 29; i >= 0; i--)
{
int val = ask_shahrasb( -(1<<i), 0);
int val2 = ask_shahrasb(0, -(1<<i));
if( !((val ^ X_xor_Y) == (1<<i) )) a += (1<<i);
if( !((val2 ^ X_xor_Y) == (1<<i)) ) b += (1<<i);
}
if(a >= 500000000) a = a - (1<<30) + 1;
if(b >= 500000000) b = b - (1<<30) + 1;
return {a, b};
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
4 ms |
376 KB |
wrong cup location |
