oj.uz

Submission #976856

# Submission time Handle Problem Language Result Execution time Memory
976856 2024-05-07T08:02:11 Z LucaIlie The Big Prize (IOI17_prize) C++17
20 / 100
 50 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] };
}

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 = (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--;
        if ( mid < l )
            return;
    }
    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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 2 ms 1968 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1972 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 2136 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 2 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 1880 KB Output is correct
7 Correct 1 ms 2136 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 1 ms 1880 KB Output is correct
10 Correct 2 ms 1880 KB Output is correct
11 Correct 2 ms 1968 KB Output is correct
12 Correct 1 ms 1880 KB Output is correct
13 Correct 3 ms 1972 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 3 ms 1976 KB Output is correct
16 Correct 21 ms 1880 KB Output is correct
17 Correct 1 ms 1972 KB Output is correct
18 Correct 26 ms 1876 KB Output is correct
19 Correct 1 ms 1880 KB Output is correct
20 Correct 6 ms 1112 KB Output is correct
21 Correct 8 ms 1880 KB Output is correct
22 Correct 3 ms 1880 KB Output is correct
23 Correct 1 ms 2136 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 15 ms 1880 KB Output is correct
26 Correct 11 ms 1972 KB Output is correct
27 Correct 2 ms 2132 KB Output is correct
28 Correct 31 ms 1880 KB Output is correct
29 Correct 15 ms 1880 KB Output is correct
30 Correct 20 ms 1880 KB Output is correct
31 Correct 2 ms 1880 KB Output is correct
32 Correct 3 ms 1880 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 7 ms 1880 KB Output is correct
35 Correct 2 ms 1880 KB Output is correct
36 Correct 6 ms 1880 KB Output is correct
37 Correct 2 ms 1880 KB Output is correct
38 Correct 1 ms 2136 KB Output is correct
39 Correct 9 ms 1880 KB Output is correct
40 Correct 20 ms 1880 KB Output is correct
41 Correct 14 ms 1880 KB Output is correct
42 Correct 16 ms 1880 KB Output is correct
43 Correct 13 ms 1876 KB Output is correct
44 Correct 11 ms 1880 KB Output is correct
45 Correct 8 ms 1880 KB Output is correct
46 Correct 2 ms 1880 KB Output is correct
47 Correct 12 ms 1976 KB Output is correct
48 Correct 17 ms 1880 KB Output is correct
49 Correct 2 ms 1960 KB Output is correct
50 Correct 22 ms 1880 KB Output is correct
51 Correct 10 ms 2136 KB Output is correct
52 Correct 1 ms 1880 KB Output is correct
53 Correct 1 ms 1968 KB Output is correct
54 Correct 10 ms 2136 KB Output is correct
55 Correct 1 ms 1880 KB Output is correct
56 Correct 22 ms 1880 KB Output is correct
57 Correct 17 ms 1880 KB Output is correct
58 Correct 14 ms 1880 KB Output is correct
59 Correct 15 ms 1880 KB Output is correct
60 Correct 11 ms 1880 KB Output is correct
61 Correct 1 ms 1880 KB Output is correct
62 Correct 1 ms 1876 KB Output is correct
63 Correct 2 ms 1880 KB Output is correct
64 Correct 2 ms 1880 KB Output is correct
65 Correct 1 ms 1880 KB Output is correct
66 Correct 2 ms 1880 KB Output is correct
67 Correct 3 ms 2136 KB Output is correct
68 Correct 3 ms 1880 KB Output is correct
69 Correct 2 ms 1880 KB Output is correct
70 Correct 3 ms 1884 KB Output is correct
71 Partially correct 26 ms 1880 KB Partially correct - number of queries: 5653
72 Correct 3 ms 1880 KB Output is correct
73 Partially correct 28 ms 1880 KB Partially correct - number of queries: 5573
74 Partially correct 26 ms 1880 KB Partially correct - number of queries: 5610
75 Correct 2 ms 1880 KB Output is correct
76 Correct 24 ms 1880 KB Output is correct
77 Partially correct 30 ms 1888 KB Partially correct - number of queries: 5589
78 Correct 5 ms 1880 KB Output is correct
79 Correct 14 ms 1880 KB Output is correct
80 Partially correct 29 ms 1880 KB Partially correct - number of queries: 5591
81 Partially correct 30 ms 1880 KB Partially correct - number of queries: 5584
82 Partially correct 23 ms 1880 KB Partially correct - number of queries: 5538
83 Correct 2 ms 1880 KB Output is correct
84 Correct 25 ms 1880 KB Output is correct
85 Partially correct 23 ms 1880 KB Partially correct - number of queries: 5591
86 Incorrect 50 ms 1880 KB Incorrect
87 Halted 0 ms 0 KB -