제출 #249841

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
249841		srvlt	The Big Prize (IOI17_prize)	C++14	20 / 100	1 ms	384 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ld long double
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
template <typename T> using ord_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int find_best(int n) {
	int l = 0, r = n;
	while (l < r - 1) {
		int mid = l + r >> 1;
		vector <int> v = ask(mid);
		if (v[0] == 0) l = mid;
		else r = mid;
	}
	return l;
}

컴파일 시 표준 에러 (stderr) 메시지

prize.cpp: In function 'int find_best(int)':
prize.cpp:18:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = l + r >> 1;
             ~~^~~

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