Submission #51165

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
51165	2018-06-17T02:45:06 Z	MatheusLealV	Cup of Jamshid (IOI17_cup)	C++17	100 / 100	3 ms	248 KB

cup

#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};
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	248 KB	Output is correct