oj.uz

Submission #64441

# Submission time Handle Problem Language Result Execution time Memory
64441 2018-08-04T13:27:25 Z nvmdava The Big Prize (IOI17_prize) C++17
0 / 100
 14 ms 10000 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;


vector<int> v, ans[200001], s;
bool in[1000];

int find(int l, int r){
	if(ans[l][0] == ans[r][0]){
		return 0;
	}
	int m = (l + r) >> 1, L = m, R = m + 1;
	while(l < L){
		ans[L] =ask(L);
		if(ans[L][0] + ans[L][1] == s.back()){
			break;
		}
		if(ans[L][0] + ans[L][1] == 0){
			return L;
		}
		L--;
	}
	while(r > R){
		ans[R] =ask(R);
		if(ans[R][0] + ans[R][1] == s.back()){
			break;
		}
		if(ans[R][0] + ans[R][1] == 0){
			return R;
		}
		R++;
	}
	return max(find(l, L), find(r, R));
}

int find_best(int n) {
	memset(in, 0, sizeof(in));
	for(int i = 0; i < min(35, n); i++){
		ans[i] = ask(i);
		if(in[ans[i][0] + ans[i][1]] == 0){
			if(ans[i][0] + ans[i][1] == 0){
				return i;
			}
			in[ans[i][0] + ans[i][1]] = 1;
			s.push_back(ans[i][0] + ans[i][1]);
		}
	}
	
	sort(s.begin(),s.end());
	
	int l = 0, r = n - 1;
	while(true){
		if(ans[l][0] + ans[l][1] == s.back()){
			break;
		}
		l++;
	}
	while(true){
		
		ans[r] = ask(r);
		
		if(ans[r][0] + ans[r][1] == s.back()){
			break;
		}
		if(ans[r][0] + ans[r][1] == 0){
			return r;
		}
		r--;
	}
	
	return find(l, r);
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 9848 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Runtime error 14 ms 10000 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -