oj.uz

Submission #757782

# Submission time Handle Problem Language Result Execution time Memory
757782 2023-06-13T18:24:27 Z borisAngelov The Big Prize (IOI17_prize) C++17
20 / 100
 66 ms 592 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;
}

bool asked[maxn];

int find_best(int n)
{
    srand(time(NULL));

    N = n;

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

        if (asked[idx] == true)
        {
            continue;
        }

        asked[idx] = true;
      	++i;

        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 7 ms 388 KB Output is correct
2 Correct 5 ms 556 KB Output is correct
3 Correct 3 ms 428 KB Output is correct
4 Correct 3 ms 464 KB Output is correct
5 Correct 5 ms 424 KB Output is correct
6 Correct 5 ms 428 KB Output is correct
7 Correct 4 ms 428 KB Output is correct
8 Correct 4 ms 456 KB Output is correct
9 Correct 5 ms 420 KB Output is correct
10 Correct 5 ms 464 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 464 KB Output is correct
2 Correct 5 ms 492 KB Output is correct
3 Correct 3 ms 424 KB Output is correct
4 Correct 5 ms 464 KB Output is correct
5 Correct 3 ms 464 KB Output is correct
6 Correct 5 ms 428 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 3 ms 448 KB Output is correct
9 Correct 4 ms 428 KB Output is correct
10 Correct 5 ms 464 KB Output is correct
11 Correct 6 ms 424 KB Output is correct
12 Correct 3 ms 416 KB Output is correct
13 Correct 10 ms 432 KB Output is correct
14 Correct 7 ms 208 KB Output is correct
15 Correct 12 ms 464 KB Output is correct
16 Correct 49 ms 420 KB Output is correct
17 Correct 5 ms 424 KB Output is correct
18 Partially correct 54 ms 464 KB Partially correct - number of queries: 5073
19 Correct 5 ms 420 KB Output is correct
20 Correct 19 ms 300 KB Output is correct
21 Correct 18 ms 424 KB Output is correct
22 Correct 9 ms 404 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 6 ms 464 KB Output is correct
25 Correct 27 ms 464 KB Output is correct
26 Correct 28 ms 424 KB Output is correct
27 Correct 7 ms 420 KB Output is correct
28 Correct 35 ms 464 KB Output is correct
29 Correct 38 ms 424 KB Output is correct
30 Partially correct 52 ms 472 KB Partially correct - number of queries: 5053
31 Correct 5 ms 428 KB Output is correct
32 Correct 8 ms 464 KB Output is correct
33 Correct 2 ms 208 KB Output is correct
34 Correct 11 ms 388 KB Output is correct
35 Correct 8 ms 460 KB Output is correct
36 Correct 16 ms 456 KB Output is correct
37 Correct 4 ms 452 KB Output is correct
38 Correct 4 ms 464 KB Output is correct
39 Correct 10 ms 460 KB Output is correct
40 Correct 41 ms 428 KB Output is correct
41 Correct 26 ms 464 KB Output is correct
42 Correct 24 ms 424 KB Output is correct
43 Correct 22 ms 464 KB Output is correct
44 Correct 16 ms 464 KB Output is correct
45 Correct 16 ms 464 KB Output is correct
46 Correct 4 ms 420 KB Output is correct
47 Correct 28 ms 464 KB Output is correct
48 Correct 28 ms 428 KB Output is correct
49 Correct 8 ms 428 KB Output is correct
50 Partially correct 31 ms 456 KB Partially correct - number of queries: 5092
51 Correct 26 ms 456 KB Output is correct
52 Correct 5 ms 464 KB Output is correct
53 Correct 9 ms 432 KB Output is correct
54 Correct 26 ms 464 KB Output is correct
55 Correct 4 ms 424 KB Output is correct
56 Partially correct 37 ms 424 KB Partially correct - number of queries: 5099
57 Correct 14 ms 388 KB Output is correct
58 Correct 29 ms 420 KB Output is correct
59 Correct 27 ms 592 KB Output is correct
60 Correct 21 ms 424 KB Output is correct
61 Correct 7 ms 428 KB Output is correct
62 Correct 5 ms 432 KB Output is correct
63 Correct 6 ms 464 KB Output is correct
64 Correct 5 ms 428 KB Output is correct
65 Correct 7 ms 416 KB Output is correct
66 Correct 11 ms 420 KB Output is correct
67 Correct 10 ms 424 KB Output is correct
68 Correct 3 ms 456 KB Output is correct
69 Correct 4 ms 400 KB Output is correct
70 Correct 8 ms 428 KB Output is correct
71 Partially correct 32 ms 488 KB Partially correct - number of queries: 5207
72 Correct 11 ms 464 KB Output is correct
73 Partially correct 40 ms 464 KB Partially correct - number of queries: 5144
74 Partially correct 58 ms 464 KB Partially correct - number of queries: 5171
75 Correct 4 ms 464 KB Output is correct
76 Correct 21 ms 492 KB Output is correct
77 Partially correct 45 ms 464 KB Partially correct - number of queries: 5190
78 Correct 13 ms 464 KB Output is correct
79 Correct 26 ms 428 KB Output is correct
80 Partially correct 66 ms 440 KB Partially correct - number of queries: 5190
81 Partially correct 51 ms 384 KB Partially correct - number of queries: 5172
82 Partially correct 32 ms 464 KB Partially correct - number of queries: 5078
83 Correct 9 ms 492 KB Output is correct
84 Correct 45 ms 464 KB Output is correct
85 Partially correct 51 ms 464 KB Partially correct - number of queries: 5205
86 Incorrect 34 ms 496 KB answer is not correct
87 Halted 0 ms 0 KB -