제출 #426639

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
426639		Blistering_Barnacles	커다란 상품 (IOI17_prize)	C++11	20 / 100	11 ms	13440 KiB

prize

#include "prize.h"
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef long long ll;
ll q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
int find_best(int n) {
	ll l = -1 , r = n ;
	while(r - l > 1){
        vi res = ask(mid) ;
        if(res[0] == res[1])R mid ;
        if(res[0])r = mid ;
        else l = mid ;
	}
	R mid ;
	return 0;
}

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