제출 #415042

#제출 시각아이디문제언어결과실행 시간메모리
415042Bill_00커다란 상품 (IOI17_prize)C++14
0 / 100
145 ms1056 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int id[200005];
int find_best(int n){
	for(int i=0;i<n;i++){
		id[i]=i;
	}
	shuffle(id,id+n,rng);
	for(int i = 0; i < n; i++){
		std::vector<int> res = ask(id[i]);
		if(res[0] + res[1] == 0)
			return id[i];
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...