oj.uz

답안 #976863

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
976863 2024-05-07T08:11:14 Z LucaIlie 커다란 상품 (IOI17_prize) C++17
20 / 100
 21 ms 2136 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

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

int t;
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] };
}

int findMid( int &l, int &r ) {
    if ( l > r )
        return r;

    int mid = (l + r) / 2;
    while ( mid <= r && askk( mid ).first + askk( mid ).second != t && !found )
        mid++;

    if ( mid >= r ) {
        mid--;
        while ( mid >= l && askk( mid ).first + askk( mid ).second != t && !found )
            mid--;
        r = mid;
        return findMid( l, r );
    }
    return mid;
}

void solve( int l, int r, int tleft, int tright ) {
    if ( tleft == tright )
        return;

    if ( found )
        return;

    if ( l > r )
        return;

    //printf( "%d %d\n", l, r );

    //int mid = min( r, l + (r - l + 1) / 3 + rand() % (r - l + 1) / 3 );
    int mid = findMid( l, r );
    int tmid = askk( mid ).first;

    solve( l, mid, tleft, tmid );
    solve( mid + 1, r, tmid, tright );
}

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

    t = 0;
    for ( int i = 0; i < 20; i++ ) {
        int p = rand() % n;
        t = max( t, askk( p ).first + askk( p ).second );
    }

    solve( 0, n - 1, 0, t );

    // for ( int i = 0; i < n; i++ )
    //   askk( i );

    return pos;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 2 ms 1880 KB Output is correct
3 Correct 2 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 Correct 1 ms 1880 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 1 ms 1880 KB Output is correct
10 Correct 1 ms 1880 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 1 ms 1880 KB Output is correct
5 Correct 2 ms 1880 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 1 ms 2132 KB Output is correct
10 Correct 1 ms 1880 KB Output is correct
11 Correct 3 ms 1880 KB Output is correct
12 Correct 1 ms 1880 KB Output is correct
13 Correct 3 ms 2136 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 4 ms 1880 KB Output is correct
16 Correct 21 ms 1880 KB Output is correct
17 Correct 1 ms 1880 KB Output is correct
18 Correct 21 ms 1876 KB Output is correct
19 Correct 1 ms 1880 KB Output is correct
20 Correct 5 ms 1108 KB Output is correct
21 Correct 8 ms 2132 KB Output is correct
22 Correct 3 ms 1880 KB Output is correct
23 Correct 1 ms 1876 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 12 ms 1880 KB Output is correct
26 Correct 9 ms 1880 KB Output is correct
27 Correct 1 ms 1880 KB Output is correct
28 Correct 19 ms 1880 KB Output is correct
29 Correct 17 ms 1880 KB Output is correct
30 Correct 20 ms 1880 KB Output is correct
31 Correct 2 ms 1876 KB Output is correct
32 Correct 3 ms 2136 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 9 ms 1968 KB Output is correct
35 Correct 2 ms 1880 KB Output is correct
36 Correct 5 ms 1880 KB Output is correct
37 Correct 1 ms 1880 KB Output is correct
38 Correct 2 ms 1880 KB Output is correct
39 Correct 8 ms 1880 KB Output is correct
40 Correct 17 ms 1880 KB Output is correct
41 Correct 15 ms 1880 KB Output is correct
42 Correct 20 ms 1876 KB Output is correct
43 Correct 16 ms 1880 KB Output is correct
44 Correct 9 ms 1880 KB Output is correct
45 Correct 6 ms 1880 KB Output is correct
46 Correct 1 ms 2132 KB Output is correct
47 Correct 10 ms 1972 KB Output is correct
48 Correct 20 ms 1880 KB Output is correct
49 Correct 3 ms 1880 KB Output is correct
50 Correct 21 ms 1876 KB Output is correct
51 Correct 7 ms 1880 KB Output is correct
52 Correct 1 ms 1880 KB Output is correct
53 Correct 2 ms 1880 KB Output is correct
54 Correct 11 ms 2132 KB Output is correct
55 Correct 1 ms 1880 KB Output is correct
56 Correct 17 ms 1880 KB Output is correct
57 Correct 14 ms 1880 KB Output is correct
58 Correct 19 ms 1880 KB Output is correct
59 Correct 14 ms 1880 KB Output is correct
60 Correct 15 ms 1880 KB Output is correct
61 Correct 2 ms 1880 KB Output is correct
62 Correct 1 ms 1880 KB Output is correct
63 Correct 2 ms 1880 KB Output is correct
64 Correct 1 ms 1880 KB Output is correct
65 Incorrect 1 ms 1880 KB Integer -1 violates the range [0, 199999]
66 Halted 0 ms 0 KB -