Submission #38346

#TimeUsernameProblemLanguageResultExecution timeMemory
38346MatheusLealVThe Big Prize (IOI17_prize)C++14
20 / 100
0 ms2796 KiB
#include <bits/stdc++.h>
#define N 200050
#include "prize.h"
using namespace std;

int n, v[N];

int find_best(int n)
{
	int ini = 0, fim = n - 1, mid;

	while(fim >= ini)
	{
		mid = (ini + fim)/2;

		vector<int> aux = ask(mid);

		if(aux[0] + aux[1] == 0) return mid;

		if(aux[0]) fim = mid - 1;

		else ini = mid + 1;
	}
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...