제출 #51074

#제출 시각아이디문제언어결과실행 시간메모리
51074MatheusLealVCup of Jamshid (IOI17_cup)C++17
61 / 100
4 ms376 KiB
#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}; }
#Verdict Execution timeMemoryGrader output
Fetching results...