Submission #295507

#	Time	Username	Problem	Language	Result	Execution time	Memory
295507		Aldas25	The Big Prize (IOI17_prize)	C++14	20 / 100	1 ms	384 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb push_back
#define f first
#define s second
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<piii> viii;


int find_best(int n) {
	int le = 0, ri = n-1;
	while (le < ri) {
        int mid = (le + ri)/2;
        vi a = ask(mid);
        if (a[0] + a[1] == 0) return mid;
        if (a[0] > 0) ri = mid-1;
        else le = mid+1;
        //cout << " a: " << a[0] << ", " << a[1] << endl;
        //cout << " le = " << le << " ri = " << ri << endl;
	}
	return le;
}

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