Submission #1329434

#	Time	Username	Problem	Language	Result	Execution time	Memory
1329434		ezzzay	The Big Prize (IOI17_prize)	C++20	0 / 100	1061 ms	420 KiB

prize

#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
int find_best(int n) {
    
    map<int,vector<int>>mp;
    vector<int>v=ask(0);
    mp[0]=v;
    int l=v[0]+v[1];
    int x=0;
    while(l!=0){
        if(mp[x].empty())mp[x]=ask(x);
        vector<int>v=mp[x];
        if(mp[x][0]){ 
            x/=2;
        }
        else{ // baruun taldaa baigaa
            x= (n-1+x)/2;
        }
        if(mp[x].empty())mp[x]=ask(x);
        l=mp[x][0]+mp[x][1];
    }
    return x;
}

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