oj.uz

Submission #738483

# Submission time Handle Problem Language Result Execution time Memory
738483 2023-05-08T20:30:37 Z Elvin_Fritl The Big Prize (IOI17_prize) C++17
0 / 100
 105 ms 304 KB 
#include <bits/stdc++.h>
using namespace std;
#include "prize.h"

const int mx=2e6+5;

int tree[mx*4];

int min_segment(int l,int r){
    int mid=(l+r)>>1;
    vector<int>a = ask(mid);
    if(a[0] == 0 && a[1] == 0){
        return mid;
    }
    if(l==r){
        return 0;
    }
    int tmp1=min_segment(l,max(l,mid-1));
    int tmp2=min_segment(min(r,mid+1),r);
    return max(tmp1,tmp2);
}

int find_best(int n) {
	return min_segment(0,n-1);
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 105 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 59 ms 304 KB Incorrect
2 Halted 0 ms 0 KB -