oj.uz

Submission #757779

# Submission time Handle Problem Language Result Execution time Memory
757779 2023-06-13T18:22:51 Z borisAngelov The Big Prize (IOI17_prize) C++17
20 / 100
 64 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 <= 460; ++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 5 ms 296 KB Output is correct
2 Correct 4 ms 292 KB Output is correct
3 Correct 6 ms 272 KB Output is correct
4 Correct 6 ms 208 KB Output is correct
5 Correct 2 ms 268 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 6 ms 288 KB Output is correct
8 Correct 4 ms 208 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 6 ms 208 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 296 KB Output is correct
2 Correct 5 ms 292 KB Output is correct
3 Correct 5 ms 208 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 2 ms 272 KB Output is correct
6 Correct 5 ms 208 KB Output is correct
7 Correct 4 ms 288 KB Output is correct
8 Correct 5 ms 292 KB Output is correct
9 Correct 5 ms 292 KB Output is correct
10 Correct 8 ms 208 KB Output is correct
11 Correct 6 ms 208 KB Output is correct
12 Correct 7 ms 268 KB Output is correct
13 Correct 12 ms 292 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 9 ms 208 KB Output is correct
16 Correct 2 ms 208 KB Output is correct
17 Correct 3 ms 288 KB Output is correct
18 Partially correct 64 ms 208 KB Partially correct - number of queries: 5068
19 Correct 5 ms 288 KB Output is correct
20 Correct 13 ms 288 KB Output is correct
21 Correct 26 ms 208 KB Output is correct
22 Correct 8 ms 252 KB Output is correct
23 Correct 6 ms 292 KB Output is correct
24 Correct 6 ms 208 KB Output is correct
25 Correct 17 ms 208 KB Output is correct
26 Correct 29 ms 296 KB Output is correct
27 Correct 6 ms 288 KB Output is correct
28 Correct 29 ms 208 KB Output is correct
29 Correct 43 ms 208 KB Output is correct
30 Partially correct 36 ms 276 KB Partially correct - number of queries: 5048
31 Correct 8 ms 208 KB Output is correct
32 Correct 11 ms 284 KB Output is correct
33 Correct 2 ms 208 KB Output is correct
34 Correct 23 ms 292 KB Output is correct
35 Correct 7 ms 208 KB Output is correct
36 Correct 17 ms 272 KB Output is correct
37 Correct 6 ms 292 KB Output is correct
38 Correct 5 ms 208 KB Output is correct
39 Correct 21 ms 208 KB Output is correct
40 Correct 48 ms 332 KB Output is correct
41 Correct 24 ms 272 KB Output is correct
42 Correct 36 ms 272 KB Output is correct
43 Correct 30 ms 208 KB Output is correct
44 Correct 12 ms 292 KB Output is correct
45 Correct 19 ms 208 KB Output is correct
46 Correct 6 ms 208 KB Output is correct
47 Correct 23 ms 208 KB Output is correct
48 Correct 31 ms 272 KB Output is correct
49 Correct 7 ms 288 KB Output is correct
50 Partially correct 39 ms 292 KB Partially correct - number of queries: 5087
51 Correct 13 ms 292 KB Output is correct
52 Correct 6 ms 268 KB Output is correct
53 Correct 7 ms 208 KB Output is correct
54 Correct 29 ms 288 KB Output is correct
55 Correct 6 ms 276 KB Output is correct
56 Partially correct 55 ms 292 KB Partially correct - number of queries: 5094
57 Correct 52 ms 208 KB Output is correct
58 Correct 18 ms 208 KB Output is correct
59 Correct 31 ms 208 KB Output is correct
60 Correct 26 ms 312 KB Output is correct
61 Correct 8 ms 288 KB Output is correct
62 Correct 6 ms 292 KB Output is correct
63 Correct 5 ms 288 KB Output is correct
64 Correct 8 ms 208 KB Output is correct
65 Correct 4 ms 268 KB Output is correct
66 Correct 10 ms 208 KB Output is correct
67 Correct 10 ms 208 KB Output is correct
68 Correct 6 ms 208 KB Output is correct
69 Correct 5 ms 208 KB Output is correct
70 Correct 10 ms 208 KB Output is correct
71 Partially correct 52 ms 208 KB Partially correct - number of queries: 5198
72 Correct 17 ms 208 KB Output is correct
73 Partially correct 59 ms 300 KB Partially correct - number of queries: 5137
74 Partially correct 46 ms 208 KB Partially correct - number of queries: 5164
75 Correct 7 ms 208 KB Output is correct
76 Correct 45 ms 208 KB Output is correct
77 Partially correct 56 ms 288 KB Partially correct - number of queries: 5126
78 Correct 10 ms 208 KB Output is correct
79 Correct 20 ms 208 KB Output is correct
80 Partially correct 62 ms 208 KB Partially correct - number of queries: 5166
81 Partially correct 39 ms 208 KB Partially correct - number of queries: 5127
82 Partially correct 34 ms 288 KB Partially correct - number of queries: 5145
83 Correct 5 ms 208 KB Output is correct
84 Correct 46 ms 208 KB Output is correct
85 Partially correct 54 ms 208 KB Partially correct - number of queries: 5179
86 Incorrect 35 ms 208 KB answer is not correct
87 Halted 0 ms 0 KB -