oj.uz

Submission #117278

# Submission time Handle Problem Language Result Execution time Memory
117278 2019-06-15T12:40:22 Z WongHokFong_cpp The Big Prize (IOI17_prize) C++14
0 / 100
 54 ms 384 KB 
#include <iostream>
#include <cstdio>
#include <cstdio>
#include <iomanip>
#include <cstring>
#include <algorithm>
#include "prize.h" 
#include <vector>
using namespace std;
vector<int> a;
int find_best(int n)
{
	int l=0,r=n-1;
	int mid=(r+l)/2;
	while(0==0)
	{
		a=ask(mid);
		if(a[0]+a[1]==0) return mid;
		if(a[0]==1) r=mid-1;
		else l=mid+1;
	}
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 384 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 54 ms 384 KB Incorrect
2 Halted 0 ms 0 KB -