oj.uz

Submission #117283

# Submission time Handle Problem Language Result Execution time Memory
117283 2019-06-15T12:43:17 Z WongHokFong_cpp The Big Prize (IOI17_prize) C++14
20 / 100
 2 ms 400 KB 
#include <iostream>
#include "prize.h"
#include <vector>
using namespace std;
vector <int> res;
int find_best(int n)
{
	int l=0,r=n-1;
	do
	{
		int mid=(l+r)/2;
		res=ask(mid);
		if (res[0]>0) r=mid-1;
		else if (res[1]>0) l=mid+1;
		else return mid; 
	}
	while (l<r);
	return l;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 308 KB Output is correct
2 Correct 2 ms 284 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 400 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct

Subtask #2
0 / 80.0

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