제출 #428763

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
428763		vanic	커다란 상품 (IOI17_prize)	C++14	20 / 100	4 ms	328 KiB

prize

#include "prize.h"
#include <iostream>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <vector>

using namespace std;

int sum;

int nadji(int L, int D, int vall, int vald){
	int br=0;
	int pos;
	vector < int > v;
	do{
		pos=rand()%(D-L)+L;
		v=ask(pos);
		if(!v[0] && !v[1]){
			return pos;
		}
		br++;
		
	}while(br<100 && v[0]+v[1]!=sum);
	br=-1;
	if(v[0]-vall){
		br=nadji(L, pos, vall, v[1]);
		if(br!=-1){
			return br;
		}
	}
	if(v[1]-vald){
		br=nadji(pos+1, D, v[0], vald);
	}
	return br;
}

int find_best(int n){
	srand(time(NULL));
	vector < int > v;
	int pos;
	for(int i=0; i<10; i++){
		pos=rand()%n;
		v=ask(pos);
		if(!v[0] && !v[1]){
			return pos;
		}
		sum=max(sum, v[0]+v[1]);
	}
	return nadji(0, n, 0, 0);
}

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