oj.uz

Submission #38964

# Submission time Handle Problem Language Result Execution time Memory
38964 2018-01-08T14:00:15 Z faustaadp The Big Prize (IOI17_prize) C++14
0 / 100
 73 ms 2016 KB 
#include "prize.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll l,r,c,ma;
vector<int> v;
int find_best(int n) {
	for(int i = 0; i < n; i++) {
		std::vector<int> res = ask(i);
		if(res[0] + res[1] == 0)
			return i;
		if(res[0]+res[1]!=ma)
			continue;
		ma=max((ll)ma,(ll)(res[0]+res[1]));
		l=i+1;
		r=n-1;
		while(l<=r)
		{
			c=(l+r)/2;
			v=ask(c);
			if(v[0]==res[0]&&v[1]==res[1])
			{
				i=c;
				l=c+1;
			}
			else
				r=c-1;
		}
	}
	return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 73 ms 2016 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 43 ms 2016 KB Incorrect
2 Halted 0 ms 0 KB -