제출 #593339

#제출 시각아이디문제언어결과실행 시간메모리
593339blue커다란 상품 (IOI17_prize)C++17
0 / 100
81 ms292 KiB
#include "prize.h"
#include <vector>
#include <iostream>
using namespace std;

using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
#define sz(x) int(x.size())


int find_best(int n)
{
	for(int i = 0; i < n; i++)
	{
		vi f = ask(i);
		if(f[0] + f[1] == 0)
			return i;
	}
	while(1);
	return -1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...