Submission #347817

#	Time	Username	Problem	Language	Result	Execution time	Memory
347817		beksultan04	The Big Prize (IOI17_prize)	C++14	90 / 100	105 ms	1268 KiB

prize

#include "prize.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin()Ñ,s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
const int N = 3e5+12,INF=1e9+7;
int find_best(int n) {
    int mx=0,i;
    map <int,vector <int>> mp;
    for (i=0;i<n;++i){
        vector <int> a;
        if (!mp.count(i))
            mp[i] = ask(i);
        
        a = mp[i];

        if (!(a[0]+a[1]))ret i;
        mx = max(a[0]+a[1],mx);
        if (mx != a[0]+a[1])continue;


        int l = i,r = n-1;
        while (r >= l){

            int m = l+r>>1;
            vector <int> b;
            if (!mp.count(m)){
                mp[m] = ask(m);
            }
            b = mp[m];

            if (!(b[0]+b[1]))ret m;
            if (!b[1]){
                n = m;
            }
            if (!b[0] || a == b){
                l = m+1;
                i = m;
            }
            else {
                r = m-1;
            }
        }
    }

}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:44:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   44 |             int m = l+r>>1;
      |                     ~^~
prize.cpp:28:28: warning: control reaches end of non-void function [-Wreturn-type]
   28 |     map <int,vector <int>> mp;
      |                            ^~

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