oj.uz

Submission #757775

# Submission time Handle Problem Language Result Execution time Memory
757775 2023-06-13T18:19:56 Z borisAngelov The Big Prize (IOI17_prize) C++17
90 / 100
 90 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 <= 2000; ++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 10 ms 288 KB Output is correct
2 Correct 21 ms 292 KB Output is correct
3 Correct 15 ms 296 KB Output is correct
4 Correct 21 ms 288 KB Output is correct
5 Correct 16 ms 208 KB Output is correct
6 Correct 20 ms 296 KB Output is correct
7 Correct 18 ms 208 KB Output is correct
8 Correct 22 ms 208 KB Output is correct
9 Correct 19 ms 292 KB Output is correct
10 Correct 15 ms 208 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 288 KB Output is correct
2 Correct 27 ms 296 KB Output is correct
3 Correct 14 ms 292 KB Output is correct
4 Correct 13 ms 292 KB Output is correct
5 Correct 20 ms 288 KB Output is correct
6 Correct 21 ms 208 KB Output is correct
7 Correct 14 ms 296 KB Output is correct
8 Correct 10 ms 288 KB Output is correct
9 Correct 18 ms 208 KB Output is correct
10 Correct 8 ms 208 KB Output is correct
11 Correct 20 ms 288 KB Output is correct
12 Correct 21 ms 208 KB Output is correct
13 Correct 19 ms 208 KB Output is correct
14 Correct 23 ms 208 KB Output is correct
15 Correct 12 ms 292 KB Output is correct
16 Correct 2 ms 208 KB Output is correct
17 Correct 16 ms 208 KB Output is correct
18 Partially correct 40 ms 208 KB Partially correct - number of queries: 6608
19 Correct 8 ms 280 KB Output is correct
20 Correct 20 ms 336 KB Output is correct
21 Correct 31 ms 208 KB Output is correct
22 Correct 10 ms 292 KB Output is correct
23 Correct 21 ms 288 KB Output is correct
24 Correct 13 ms 296 KB Output is correct
25 Correct 51 ms 292 KB Output is correct
26 Correct 44 ms 272 KB Output is correct
27 Correct 14 ms 288 KB Output is correct
28 Partially correct 78 ms 292 KB Partially correct - number of queries: 5917
29 Partially correct 54 ms 208 KB Partially correct - number of queries: 5104
30 Partially correct 90 ms 276 KB Partially correct - number of queries: 6588
31 Correct 21 ms 292 KB Output is correct
32 Correct 17 ms 272 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 40 ms 292 KB Output is correct
35 Correct 21 ms 208 KB Output is correct
36 Correct 12 ms 336 KB Output is correct
37 Correct 9 ms 288 KB Output is correct
38 Correct 20 ms 208 KB Output is correct
39 Correct 37 ms 272 KB Output is correct
40 Partially correct 55 ms 292 KB Partially correct - number of queries: 6015
41 Correct 33 ms 292 KB Output is correct
42 Correct 42 ms 208 KB Output is correct
43 Correct 62 ms 292 KB Output is correct
44 Correct 39 ms 292 KB Output is correct
45 Correct 20 ms 292 KB Output is correct
46 Correct 16 ms 208 KB Output is correct
47 Correct 43 ms 208 KB Output is correct
48 Partially correct 53 ms 288 KB Partially correct - number of queries: 5288
49 Correct 10 ms 280 KB Output is correct
50 Partially correct 71 ms 280 KB Partially correct - number of queries: 6627
51 Correct 15 ms 284 KB Output is correct
52 Correct 21 ms 208 KB Output is correct
53 Correct 10 ms 208 KB Output is correct
54 Correct 24 ms 208 KB Output is correct
55 Correct 8 ms 288 KB Output is correct
56 Partially correct 78 ms 208 KB Partially correct - number of queries: 6634
57 Partially correct 58 ms 292 KB Partially correct - number of queries: 5252
58 Partially correct 32 ms 208 KB Partially correct - number of queries: 5283
59 Correct 52 ms 292 KB Output is correct
60 Correct 48 ms 292 KB Output is correct
61 Correct 9 ms 336 KB Output is correct
62 Correct 8 ms 292 KB Output is correct
63 Correct 22 ms 296 KB Output is correct
64 Correct 12 ms 208 KB Output is correct
65 Correct 20 ms 288 KB Output is correct
66 Correct 24 ms 208 KB Output is correct
67 Correct 11 ms 336 KB Output is correct
68 Correct 19 ms 208 KB Output is correct
69 Correct 17 ms 208 KB Output is correct
70 Correct 18 ms 208 KB Output is correct
71 Partially correct 79 ms 208 KB Partially correct - number of queries: 6705
72 Correct 25 ms 208 KB Output is correct
73 Partially correct 80 ms 208 KB Partially correct - number of queries: 6644
74 Partially correct 63 ms 208 KB Partially correct - number of queries: 6671
75 Correct 14 ms 208 KB Output is correct
76 Partially correct 66 ms 208 KB Partially correct - number of queries: 6088
77 Partially correct 69 ms 208 KB Partially correct - number of queries: 6597
78 Correct 26 ms 208 KB Output is correct
79 Correct 28 ms 208 KB Output is correct
80 Partially correct 71 ms 208 KB Partially correct - number of queries: 6653
81 Partially correct 59 ms 208 KB Partially correct - number of queries: 6681
82 Partially correct 68 ms 208 KB Partially correct - number of queries: 6516
83 Correct 23 ms 292 KB Output is correct
84 Partially correct 39 ms 292 KB Partially correct - number of queries: 5929
85 Partially correct 46 ms 296 KB Partially correct - number of queries: 6712
86 Correct 53 ms 292 KB Output is correct
87 Correct 23 ms 220 KB Output is correct
88 Correct 38 ms 208 KB Output is correct
89 Correct 20 ms 292 KB Output is correct
90 Correct 21 ms 208 KB Output is correct
91 Correct 24 ms 208 KB Output is correct
92 Partially correct 51 ms 208 KB Partially correct - number of queries: 5928
93 Partially correct 70 ms 208 KB Partially correct - number of queries: 6019
94 Partially correct 65 ms 208 KB Partially correct - number of queries: 6245
95 Partially correct 48 ms 208 KB Partially correct - number of queries: 6241
96 Partially correct 58 ms 208 KB Partially correct - number of queries: 6201
97 Partially correct 63 ms 208 KB Partially correct - number of queries: 5827