제출 #975088

#제출 시각아이디문제언어결과실행 시간메모리
975088marinalucaCup of Jamshid (IOI17_cup)C++14
100 / 100
1 ms348 KiB
#include <bits/stdc++.h> #include "cup.h" using namespace std; //#define int long long #define ll long long #define xx first #define yy second #define all (x) begin(x), end(x) #define FOR (i, a, b) for (auto i = (a); i < (b); ++ i) const int NMAX = 30; vector <int> find_cup(){ int mini = -1e9; int rez =0; int val = ask_shahrasb(mini, mini); for (int i = 0; i < NMAX + 1; ++ i){ int ans = ask_shahrasb(mini + (1 << i), mini); if (ans == (val ^ (1 << i))) rez |= (1 << i); } int aa = val ^ rez; int x = mini + rez, y = mini + aa; return {x, y}; }
#Verdict Execution timeMemoryGrader output
Fetching results...