oj.uz

답안 #976622

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
976622 2024-05-06T21:41:27 Z LucaIlie 커다란 상품 (IOI17_prize) C++17
0 / 100
 2 ms 2388 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 2e5;
int ans[MAX_N][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];
    }
    if ( ans[i][0] + ans[i][1] == 0 ) {
        found = true;
        pos = i;
    }
    return { ans[i][0], ans[i][1] };
}

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

    if ( l > r )
        return;

    int bs = max( 1.00, (r - l + 1) / sqrt( sqrt( r - l + 1 ) ) );
    int f = (l == 0 ? 0 : askk( l - 1 ).first );
    if ( found )
        return;
    for ( int lb = l; lb <= r; lb += bs ) {
        int rb = min( r, lb + bs - 1 );
        int g = askk( rb ).first;
        if ( found )
            return;
        if ( g - f > 0 ) {
            solve( lb + 1, rb - 1 );
            if ( found )
                return;
        }
    }
}

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

    solve( 0, n - 1 );

    return pos;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Incorrect 2 ms 1880 KB answer is not correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Incorrect 2 ms 1880 KB answer is not correct
3 Halted 0 ms 0 KB -