Submission #51074

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
51074	2018-06-16T02:52:15 Z	MatheusLealV	Cup of Jamshid (IOI17_cup)	C++17	61 / 100	4 ms	376 KB

cup

#include "cup.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> find_cup()
{
	int a = 0, b = 0;

	int X_xor_Y = ask_shahrasb(0, 0);

	for(int i = 29; i >= 0; i--)
	{
		int val = ask_shahrasb( -(1<<i), 0);

		int val2 = ask_shahrasb(0, -(1<<i));

		if( !((val ^ X_xor_Y) == (1<<i) )) a += (1<<i); 

		if( !((val2 ^ X_xor_Y) == (1<<i)) ) b += (1<<i);
	}

	if(a > 500000000) a = a - (1<<30) + 1;

	if(b > 500000000) b = b - (1<<30) + 1;

	return {a, b};
}

Subtask #1

61.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	4 ms	376 KB	Partially correct