Submission #245062

#	Time	Username	Problem	Language	Result	Execution time	Memory
245062		LittleFlowers__	The Big Prize (IOI17_prize)	C++17	20 / 100	5 ms	384 KiB

prize

#include <bits/stdc++.h>
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define gg exit(0);
 
#ifndef UNX
#include "prize.h"
#endif // UNX
 
int mem;
 
int find_best(int n){
  	if(mem) return -1;
  	mem=1;
    vector<int> a;
    a=ask(0);
    if(a[0]+a[1]==0) return 0;
    if(a[0]+a[1]==1){
        int le=0,mi,ri=n-1;
        while(le<=ri){
            mi=(le+ri)/2;
            a=ask(mi);
            if(a[0]+a[1]==0) return mi;
            if(a[0]) ri=mi-1; else le=mi+1;
        }
    }
    return -1;
}
 
#ifdef UNX
main(){
    #define task "TASK"
    if(fopen(task".inp","r")){
        freopen(task".inp","r",stdin);
        //freopen(task".out","w",stdout);
    }
 
 
}
#endif // UNX

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