oj.uz

Submission #38346

# Submission time Handle Problem Language Result Execution time Memory
38346 2018-01-04T03:15:51 Z MatheusLealV The Big Prize (IOI17_prize) C++14
20 / 100
 0 ms 2796 KB 
#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

prize.cpp: In function 'int find_best(int)':
prize.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2796 KB Output is correct
2 Correct 0 ms 2796 KB Output is correct
3 Correct 0 ms 2796 KB Output is correct
4 Correct 0 ms 2796 KB Output is correct
5 Correct 0 ms 2796 KB Output is correct
6 Correct 0 ms 2796 KB Output is correct
7 Correct 0 ms 2796 KB Output is correct
8 Correct 0 ms 2796 KB Output is correct
9 Correct 0 ms 2796 KB Output is correct
10 Correct 0 ms 2796 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2796 KB Output is correct
2 Correct 0 ms 2796 KB Output is correct
3 Correct 0 ms 2796 KB Output is correct
4 Correct 0 ms 2796 KB Output is correct
5 Correct 0 ms 2796 KB Output is correct
6 Correct 0 ms 2796 KB Output is correct
7 Correct 0 ms 2796 KB Output is correct
8 Correct 0 ms 2796 KB Output is correct
9 Correct 0 ms 2796 KB Output is correct
10 Correct 0 ms 2796 KB Output is correct
11 Incorrect 0 ms 2796 KB answer is not correct
12 Halted 0 ms 0 KB -