oj.uz

Submission #584443

# Submission time Handle Problem Language Result Execution time Memory
584443 2022-06-27T11:47:43 Z PiejanVDC The Big Prize (IOI17_prize) C++17
20 / 100
 80 ms 296 KB 
#include <bits/stdc++.h>
#include "prize.h"
 
using namespace std;
 
int mn = INT_MAX;
int le = 0, ri;
 
int s(int l, int r) {
 
    if(l < le || r > ri) {
        if(max(l, le) > min(r, ri))
            return -1;
        return s(max(l, le), min(r, ri));
    }
 
    int mid = (l+r)/2;
    vector<int>gt = ask(mid);
 
    if(gt[0]+gt[1] <= mn) {
        mn = gt[0]+gt[1];
        if(gt[0] == 0)
            le = max(le, mid+1);
        if(!gt[1])
            ri = min(ri, mid-1);
    }
    if(!gt[0] && !gt[1])
        return mid;
    if(l == r)
        return -1;
    int a = -1, b = -1;
    if(gt[0] && l < mid)
        a = s(l, mid-1);
    if(gt[1] && r > mid)
        b = s(mid+1, r);
    return max(a,b);
}
 
int find_best(int n) {
    ri = n-1;
    return s(0,n-1);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 268 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Incorrect 80 ms 292 KB Incorrect
12 Halted 0 ms 0 KB -