Submission #72559

#TimeUsernameProblemLanguageResultExecution timeMemory
72559funcsrCup of Jamshid (IOI17_cup)C++17
0 / 100
4 ms376 KiB
#include "cup.h" #include <iostream> using namespace std; #define rep(i, n) for (int i=0; i<(n); i++) long long query(int x, int y) { return ask_shahrasb(x-1e9, y-5e8); } std::vector<int> find_cup() { long long g = query(0, 0); long long x = 0; rep(k, 30) if (((query((1LL<<k), 0)>>(k+1))&1) == ((g>>(k+1))&1)) x |= 1<<k; if ((x-1e9) > 5e8 || (x-1e9) < -5e8) x^= 1LL<<30; long long y = x^g; x -= 1e9; y -= 5e8; //cout<<"("<<x<<","<<y<<")\n"; return {(int)x, (int)y}; }
#Verdict Execution timeMemoryGrader output
Fetching results...