Submission #407369

#	Time	Username	Problem	Language	Result	Execution time	Memory
407369		peuch	The Big Prize (IOI17_prize)	C++17	90 / 100	108 ms	5400 KiB

prize

#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
 
int find_best(int n) {
	vector<vector<int> > a(n);
	int maxi = 0;
	for(int i = 0; i < n; i++){
		if(a[i].empty()) a[i] = ask(i);
		
		if(a[i][0] == 0 && a[i][1] == 0) return i;
		if(a[i][0] + a[i][1] > maxi) maxi = a[i][0] + a[i][1];
		
		if(a[i][0] + a[i][1] == maxi){
			int ini = i, fim = n - 1;
			while(ini != fim){
				int mid = (ini + fim) >> 1;
				if(ini == fim - 1) mid = fim;
				if(a[mid].empty()) a[mid] = ask(mid);
				
				if(a[mid][0] == 0 && a[mid][1] == 0) return mid;
				if(a[mid][0] + a[mid][1] > maxi){
					maxi = a[mid][0] + a[mid][1];
					break;
				}
				
				if(a[mid][0] != a[i][0] || a[mid][1] != a[i][1]) fim = mid - 1;
				else ini = mid;
			}
			i = ini;
		}
	}
	
	return n - 1;
}

• Subtask 1: 20 / 20
• Subtask 2: 70 / 80