제출 #1030944

#제출 시각아이디문제언어결과실행 시간메모리
1030944tvladm2009Cup of Jamshid (IOI17_cup)C++17
100 / 100
1 ms348 KiB
#include "cup.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; vector<int> find_cup() { int d = 5e8 + 2; int XOR = ask_shahrasb(-d, -d); int x = 0, y = 0; for (int b = 0; b <= 29; ++b) { if (ask_shahrasb((1 << b) - d, -d) == (XOR ^ (1 << b))) { x ^= (1 << b); } } y = x ^ XOR; x -= d; y -= d; vector<int> sol = {x, y}; return sol; }
#Verdict Execution timeMemoryGrader output
Fetching results...