oj.uz

Submission #757778

# Submission time Handle Problem Language Result Execution time Memory
757778 2023-06-13T18:22:13 Z borisAngelov The Big Prize (IOI17_prize) C++17
97.72 / 100
 58 ms 336 KB 
#include "prize.h"

#include <iostream>
#include <vector>
#include <random>
#include <ctime>

using namespace std;

const int maxn = 200005;

int N;

int max_result = 0;

int divide(int l, int r, int removed_from_left, int removed_from_right)
{
    if (l > r)
    {
        return 0;
    }

    int mid = (l + r) / 2;
    vector<int> curr;

    while (mid <= r)
    {
        curr = ask(mid);

        if (curr[0] + curr[1] == 0)
        {
            return mid;
        }

        if (curr[0] + curr[1] == max_result)
        {
            break;
        }

        ++mid;
    }

    if (mid <= r)
    {
        curr[0] -= (removed_from_left - (mid - (l + r) / 2));
        curr[1] -= removed_from_right;

        if (curr[0] > 0)
        {
            int idx = divide(l, (l + r) / 2 - 1, removed_from_left, removed_from_right + curr[1] + (mid - (l + r) / 2));

            if (idx != 0)
            {
                return idx;
            }
        }

        if (curr[1] > 0)
        {
            int idx = divide(mid + 1, r, removed_from_left + curr[0] + (mid - (l + r) / 2), removed_from_right);

            if (idx != 0)
            {
                return idx;
            }
        }

        return 0;
    }
    else
    {
        mid = (l + r) / 2 - 1;

        while (mid >= l)
        {
            curr = ask(mid);

            if (curr[0] + curr[1] == 0)
            {
                return mid;
            }

            if (curr[0] + curr[1] == max_result)
            {
                return mid;
            }

            --mid;
        }

        if (mid == l - 1)
        {
            return 0;
        }

        curr[0] -= removed_from_left;

        if (curr[0] > 0)
        {
            return divide(l, mid - 1, removed_from_left, removed_from_right + (r - mid));
        }

        return 0;
    }

    return 0;
}

int find_best(int n)
{
    N = n;

    for (int i = 1; i <= 470; ++i)
    {
        int idx = rand() % N;

        vector<int> curr_res = ask(idx);

        if (curr_res[0] + curr_res[1] == 0)
        {
            return idx;
        }

        max_result = max(max_result, curr_res[0] + curr_res[1]);
    }

    return divide(0, N - 1, 0, 0);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 292 KB Output is correct
2 Correct 6 ms 208 KB Output is correct
3 Correct 3 ms 292 KB Output is correct
4 Correct 3 ms 272 KB Output is correct
5 Correct 3 ms 292 KB Output is correct
6 Correct 2 ms 296 KB Output is correct
7 Correct 5 ms 288 KB Output is correct
8 Correct 4 ms 208 KB Output is correct
9 Correct 2 ms 284 KB Output is correct
10 Correct 4 ms 208 KB Output is correct

Subtask #2
77.72 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 208 KB Output is correct
2 Correct 5 ms 208 KB Output is correct
3 Correct 3 ms 336 KB Output is correct
4 Correct 7 ms 292 KB Output is correct
5 Correct 6 ms 208 KB Output is correct
6 Correct 3 ms 300 KB Output is correct
7 Correct 2 ms 280 KB Output is correct
8 Correct 4 ms 208 KB Output is correct
9 Correct 5 ms 292 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 6 ms 208 KB Output is correct
12 Correct 4 ms 284 KB Output is correct
13 Correct 7 ms 288 KB Output is correct
14 Correct 7 ms 208 KB Output is correct
15 Correct 12 ms 284 KB Output is correct
16 Correct 2 ms 208 KB Output is correct
17 Correct 4 ms 292 KB Output is correct
18 Partially correct 46 ms 208 KB Partially correct - number of queries: 5078
19 Correct 6 ms 208 KB Output is correct
20 Correct 13 ms 208 KB Output is correct
21 Correct 24 ms 208 KB Output is correct
22 Correct 7 ms 288 KB Output is correct
23 Correct 5 ms 272 KB Output is correct
24 Correct 5 ms 208 KB Output is correct
25 Correct 13 ms 288 KB Output is correct
26 Correct 12 ms 296 KB Output is correct
27 Correct 6 ms 208 KB Output is correct
28 Correct 19 ms 288 KB Output is correct
29 Correct 36 ms 288 KB Output is correct
30 Partially correct 52 ms 260 KB Partially correct - number of queries: 5058
31 Correct 2 ms 296 KB Output is correct
32 Correct 9 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 16 ms 268 KB Output is correct
35 Correct 6 ms 292 KB Output is correct
36 Correct 16 ms 208 KB Output is correct
37 Correct 8 ms 208 KB Output is correct
38 Correct 6 ms 292 KB Output is correct
39 Correct 21 ms 272 KB Output is correct
40 Correct 47 ms 208 KB Output is correct
41 Correct 26 ms 288 KB Output is correct
42 Correct 31 ms 272 KB Output is correct
43 Correct 22 ms 208 KB Output is correct
44 Correct 23 ms 288 KB Output is correct
45 Correct 20 ms 288 KB Output is correct
46 Correct 4 ms 276 KB Output is correct
47 Correct 34 ms 208 KB Output is correct
48 Correct 33 ms 208 KB Output is correct
49 Correct 9 ms 208 KB Output is correct
50 Partially correct 38 ms 208 KB Partially correct - number of queries: 5097
51 Correct 22 ms 208 KB Output is correct
52 Correct 5 ms 208 KB Output is correct
53 Correct 6 ms 208 KB Output is correct
54 Correct 19 ms 208 KB Output is correct
55 Correct 3 ms 336 KB Output is correct
56 Partially correct 21 ms 336 KB Partially correct - number of queries: 5104
57 Correct 26 ms 292 KB Output is correct
58 Correct 21 ms 288 KB Output is correct
59 Correct 30 ms 208 KB Output is correct
60 Correct 22 ms 208 KB Output is correct
61 Correct 6 ms 208 KB Output is correct
62 Correct 5 ms 296 KB Output is correct
63 Correct 5 ms 292 KB Output is correct
64 Correct 6 ms 272 KB Output is correct
65 Correct 7 ms 288 KB Output is correct
66 Correct 9 ms 208 KB Output is correct
67 Correct 12 ms 296 KB Output is correct
68 Correct 5 ms 208 KB Output is correct
69 Correct 6 ms 208 KB Output is correct
70 Correct 9 ms 292 KB Output is correct
71 Partially correct 39 ms 208 KB Partially correct - number of queries: 5208
72 Correct 7 ms 208 KB Output is correct
73 Partially correct 58 ms 208 KB Partially correct - number of queries: 5147
74 Partially correct 41 ms 208 KB Partially correct - number of queries: 5174
75 Correct 7 ms 208 KB Output is correct
76 Correct 41 ms 208 KB Output is correct
77 Partially correct 57 ms 208 KB Partially correct - number of queries: 5163
78 Correct 7 ms 208 KB Output is correct
79 Correct 30 ms 208 KB Output is correct
80 Partially correct 43 ms 208 KB Partially correct - number of queries: 5160
81 Partially correct 52 ms 208 KB Partially correct - number of queries: 5148
82 Partially correct 22 ms 336 KB Partially correct - number of queries: 5144
83 Correct 5 ms 208 KB Output is correct
84 Correct 37 ms 208 KB Output is correct
85 Partially correct 54 ms 208 KB Partially correct - number of queries: 5228
86 Correct 14 ms 336 KB Output is correct
87 Correct 9 ms 208 KB Output is correct
88 Correct 22 ms 296 KB Output is correct
89 Correct 10 ms 208 KB Output is correct
90 Correct 8 ms 292 KB Output is correct
91 Correct 14 ms 208 KB Output is correct
92 Correct 19 ms 208 KB Output is correct
93 Correct 45 ms 208 KB Output is correct
94 Correct 47 ms 208 KB Output is correct
95 Correct 45 ms 208 KB Output is correct
96 Correct 43 ms 256 KB Output is correct
97 Correct 49 ms 208 KB Output is correct