Submission #347528

#TimeUsernameProblemLanguageResultExecution timeMemory
347528beksultan04The Big Prize (IOI17_prize)C++14
0 / 100
97 ms1636 KiB
#include "prize.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin()Ñ,s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
const int N = 3e5+12,INF=1e9+7;
int find_best(int n) {
	priority_queue <pii> q;
	vector <int> v;
	int i;
	for (i=0;i<n;++i){
        v.pb(i);
	}
	random_shuffle(all(v));
	for (i=0;i<10000;++i){
        vector <int> a = ask(v[i]);
        if (a[0] == 0 && a[1] == 0){
            ret v[i];
        }
	}

	return v[i];
}







#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...