Submission #931423

#	Time	Username	Problem	Language	Result	Execution time	Memory
931423		Lobo	The Big Prize (IOI17_prize)	C++17	0 / 100	3 ms	712 KiB

prize

#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
map<int,pair<int,pair<int,int>>> qr;
 
int cnt = 0;
int cntnonlol;
int n;
pair<int,pair<int,int>> query(int i) {
	if(i == n) return mp(cntnonlol,mp(cntnonlol,0));
	if(qr.count(i)) return qr[i];
	++cnt;
	// assert(cnt <= 8500);
	vector<int> perg = ask(i);
	return qr[i] = mp(perg[0]+perg[1],mp(perg[0],perg[1]));
}
 
const int B = 477;
const int S = 950;
int find_best(int N) {
 	n = N;

 	int lol = 0;
 	for(int i = 1; i < min(B,n); i++) {
 		if(query(i).fr == 0) return i;
 		if(query(i).fr > query(lol).fr) lol = i;
 	}

 	queue<pair<int,int>> q;
 	q.push(mp(B,n-1));

 	while(q.size()) {
 		int l = q.front().fr;
 		int r = q.front().sc;
 		q.pop();
 		if(l > r) continue;

 		if(query(l).fr == 0) return l;
 		if(query(r).fr == 0) return r;

 		if(query(l) == query(r)) continue;

 		int mid = (l+r)/2;
 		q.push(mp(l,mid));
 		q.push(mp(mid+1,r));
 	}

 	assert(false);
 	return -1;


}

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