oj.uz

Submission #89231

# Submission time Handle Problem Language Result Execution time Memory
89231 2018-12-11T05:30:36 Z zoomswk The Big Prize (IOI17_prize) C++17
0 / 100
 8 ms 452 KB 
#include "prize.h"
#include <vector>
#include <algorithm>
using namespace std;

int find_best(int n) {
    if(n <= 3000){
        for(int i=0; i<n; i++){
            vector<int> resp = ask(i);
            if(resp[0]+resp[1] == 0) return i;
        }
    }
    vector<int> resp;
    int m = 0;
    for(int i=0; i<500; i++){
        resp = ask(i);
        if(resp[0]+resp[1] == 0) return i;
        m = max(m, resp[0]+resp[1]);
    }
    int bnd=0;
    for(int i=0; i<m; i++){
        int l=bnd, r=n-1, res=-1;
        while(l<=r){
            int mid = (l+r)/2;
            resp = ask(mid);
            if(resp[0]+resp[1] == 0) return mid;
            if(resp[0]+resp[1] != 0) res = mid, r = mid-1;
            else if(resp[0] == i) l = mid+1;
            else r = mid-1;
        }
        bnd = res+1;
    }
	return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 376 KB answer is not correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 452 KB answer is not correct
2 Halted 0 ms 0 KB -