Submission #111459

#TimeUsernameProblemLanguageResultExecution timeMemory
111459diamond_duke코알라 (APIO17_koala)C++11
4 / 100
8 ms512 KiB
#include "koala.h"
#include <vector>
std::vector<bool> query(const std::vector<int> &vec)
{
	static int B[105], R[105];
	int n = vec.size();
	for (int i = 0; i < n; i++)
		B[i] = vec[i];
	playRound(B, R);
	std::vector<bool> res(n);
	for (int i = 0; i < n; i++)
		res[i] = R[i] > B[i];
	return res;
}
int minValue(int n, int m)
{
	std::vector<int> vec(n);
	vec[0] = 1;
	auto res = query(vec);
	for (int i = 0; i < n; i++)
	{
		if (!res[i])
			return i;
	}
	throw;
}
int maxValue(int n, int m)
{
	return 0;
}
int greaterValue(int n, int m)
{
	return 0;
}
void allValues(int n, int m, int *res)
{
	if (m == 2 * n)
	{
	}
	else
	{
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...