Submission #286354

#	Time	Username	Problem	Language	Result	Execution time	Memory
286354		AKaan37	The Big Prize (IOI17_prize)	C++17	20 / 100	80 ms	512 KiB

prize

#include "prize.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long lo;
typedef pair< int,int > PII;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
 
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
 
int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
vector<int> v;
 
int find_best(int n) {
	int ind=0;
	//~ cout<<"**\n"<<endl;
	while(1){
		vector<int> res=ask(ind);
		
		if(res[0]+res[1]==0)return ind;
		flag=0;
		if(res[0]){
			int bas=0;
			int son=ind;
			while(bas<=son){
				vector<int> res1=ask(ort);
				if(res1[0]==res[0])son=ort-1;
				else bas=ort+1;
			}
			flag=1;
			if(son<0)flag=0;
			else ind=son;
		}
		else if(flag==0){
			int bas=ind;
			int son=n-1;
			while(bas<=son){
				vector<int> res1=ask(ort);
				if(res1[1]!=res[1])son=ort-1;
				else bas=ort+1;
			}
			ind=bas;
		}
	}
	//~ cout<<islem<<endl;
	//~ return son;
}

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