oj.uz

Submission #41857

# Submission time Handle Problem Language Result Execution time Memory
41857 2018-02-21T15:29:35 Z rahasia The Big Prize (IOI17_prize) C++14
0 / 100
 21 ms 2848 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

#define repU(x, y) for(int i = x; i <= y; ++i)
#define mp make_pair
#define pb push_back
#define allV(x) x.begin(), x.end()
#define fi first
#define se second

typedef long long LL;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef pair< int, int > pii;
typedef vector< pii > vpii;
typedef vector< LL > vL;
typedef vector< vL > vvL;
typedef vector< bool > vb;

// GLOBAL
int SUM = -1;
// --

int foo(int le, int ri) {
    if (le > ri) return -1;

    int mid1 = (le + ri) / 2, mid2 = mid1+1;

    vi tmp = ask(mid1);
    while (tmp[0] + tmp[1] != SUM && le <= mid1) {
        if (tmp[0] == 0 && tmp[1] == 0)
            return mid1;

        tmp = ask(--mid1);
    }

    tmp = ask(mid2);
    while (tmp[0] + tmp[1] != SUM && mid2 <= ri) {
        if (tmp[0] == 0 && tmp[1] == 0)
            return mid2;

        tmp = ask(++mid2);
    }

    int res = foo(le, mid1);
    if (res != -1) return res;

    return foo(mid2, ri);
}

int find_best(int n) {
    if (n <= 5) {
        vi tmp;
        repU(0, n-1) {
            tmp = ask(i);
            if (tmp[0] == 0 && tmp[1] == 0)
                return i;
        }
        return -1;
    }
    else {
        repU(0, min(n-1, 500)) {
            vi tmp = ask(i);
            SUM = max(SUM, tmp[0] + tmp[1]);
        }

        return foo(0, n-1);
    }
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 2848 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 2848 KB Incorrect
2 Halted 0 ms 0 KB -