oj.uz

Submission #427059

# Submission time Handle Problem Language Result Execution time Memory
427059 2021-06-14T12:06:03 Z Rouge_Hugo The Big Prize (IOI17_prize) C++14
20 / 100
 1 ms 328 KB 
#include<bits/stdc++.h>
#include "prize.h"
#define ll long long
#define fi first
#define se second
using namespace std;
int find_best(int n) {
    int l=0,r=n+100;
    while(l<r)
    {
        int m=(l+r)/2;
        m=min(m,n-1);
        vector<int>v=ask(m);
        if(v[0]+v[1]==0)return m;
        if(v[0]==0)
            l=m+1;
        else r=m;
    }return l-1;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 284 KB Output is correct
3 Correct 1 ms 280 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 284 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 280 KB Output is correct
5 Correct 1 ms 280 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 280 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Incorrect 1 ms 200 KB answer is not correct
12 Halted 0 ms 0 KB -