oj.uz

Submission #976179

# Submission time Handle Problem Language Result Execution time Memory
976179 2024-05-06T09:12:45 Z LucaIlie The Big Prize (IOI17_prize) C++17
0 / 100
 48 ms 2136 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 2e5;
int ans[MAX_N + 1][2];

bool found = false;
int pos;

pair<int, int> askk( int i ) {
    if ( ans[i][0] == -1 ) {
        auto x = ask( i );
        ans[i][0] = x[0];
        ans[i][1] = x[1];
    }
    return { ans[i][0], ans[i][1] };
}

void solve( int l, int r ) {
    if ( found )
        return;

    if ( l > r )
        return;

    int mid = (l + r) / 2;
    auto [a, b] = askk( mid );

    if ( a == 0 && b == 0 ) {
        found = true;
        pos = mid;
        return;
    }

    if ( a < b ) {
        solve( mid + 1, r );
        solve( l, mid - 1 );
    } else {
        solve( l, mid - 1 );
        solve( mid + 1, r );
    }
}

int find_best( int n ) {
    for( int i = 0; i <= n; i++ )
        ans[i][0] = ans[i][1] = -1;

    solve( 1, n );

    return pos;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2136 KB Output is correct
2 Correct 2 ms 1880 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 2 ms 1880 KB Output is correct
5 Correct 2 ms 1880 KB Output is correct
6 Incorrect 48 ms 1880 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 2 ms 1972 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 1 ms 1880 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Incorrect 46 ms 1880 KB Incorrect
7 Halted 0 ms 0 KB -