# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
51165 | MatheusLealV | Cup of Jamshid (IOI17_cup) | C++17 | 3 ms | 248 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "cup.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_cup()
{
int valmax = 500000001;
int a = valmax, b = valmax;
int X_xor_Y = ask_shahrasb(valmax, valmax);
for(int i = 29; i >= 0; i--)
{
if(!(X_xor_Y & (1<<i)))
{
int val = ask_shahrasb(valmax -(1<<i), valmax);
if( !((val ^ X_xor_Y) == (1<<i) )) a += (1<<i), b += (1<<i);
}
else
{
int val = ask_shahrasb(valmax - (1<<i), valmax);
if(!((val ^ X_xor_Y) == (1<<i) )) a += (1<<i);
else b += (1<<i);
}
}
if(a > 500000001) a = a - (1<<30) + 1;
if(b > 500000001) b = b - (1<<30) + 1;
return {a, b};
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |