제출 #1247315

#제출 시각아이디문제언어결과실행 시간메모리
1247315LithaniumCup of Jamshid (IOI17_cup)C++20
0 / 100
1 ms320 KiB
#include "cup.h" #include <bits/stdc++.h> using namespace std; #define Q ask_shahrasb int q[29]; vector<int> find_cup() { vector<int> res(2); int base = Q(0, 0); for (int i = 0; i < 29; i ++) { q[i] = Q(1 << i, 0); if (q[i] == (base^(1 << i))) res[0] ^= (1 << i); } if (res[0] > 5e8) { res[0] = 0; for (int i = 0; i < 29; i ++) { if (q[i] != (base^(1 << i))) res[0] ^= (1 << i); } } res[1] = base ^ res[0]; if (Q(res[0], 0) != res[1]) res[0] = -res[0]; if (Q(0, res[1]) != abs(res[0])) res[1] = -res[1]; return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...