oj.uz

Submission #96371

# Submission time Handle Problem Language Result Execution time Memory
96371 2019-02-08T21:03:08 Z figter001 The Big Prize (IOI17_prize) C++14
0 / 100
 2 ms 376 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int maxn = 2e5+50;

int dp[maxn],ans,n;

void qu(int a){
	if(dp[a])return;
	dp[a] = 1;
	vector<int> res = ask(a);
	if(res[0] + res[1] == 0){
		ans = a;
	}
}

void solve(int l,int r){
	if(l > r)return;
	int md = (l+r)/2;
	ask(md);
	if(ans != -1)return;
	solve(l,md-1);
	solve(md+1,r);
}

int find_best(int N) {
	srand(time(0));
	n = N;
	solve(0,n-1);
	return ans;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 248 KB answer is not correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB answer is not correct
2 Halted 0 ms 0 KB -