oj.uz

답안 #757786

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
757786 2023-06-13T18:28:02 Z borisAngelov 커다란 상품 (IOI17_prize) C++17
20 / 100
 85 ms 5236 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;

vector<int> results[maxn];

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 (!results[mid].empty())
        {
            curr = results[mid];
        }
        else
        {
            curr = ask(mid);
            results[mid].push_back(curr[0]);
            results[mid].push_back(curr[1]);
        }

        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)
        {
            if (!results[mid].empty())
            {
                curr = results[mid];
            }
            else
            {
                curr = ask(mid);
                results[mid].push_back(curr[0]);
                results[mid].push_back(curr[1]);
            }

            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 = 0; i < min(n, 470); ++i)
    {
        vector<int> curr_result = ask(i);

        results[i].push_back(curr_result[0]);
        results[i].push_back(curr_result[1]);

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

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

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 4992 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct
3 Correct 6 ms 4944 KB Output is correct
4 Correct 7 ms 5012 KB Output is correct
5 Correct 6 ms 4944 KB Output is correct
6 Correct 8 ms 4992 KB Output is correct
7 Correct 8 ms 4996 KB Output is correct
8 Correct 5 ms 5008 KB Output is correct
9 Correct 5 ms 4944 KB Output is correct
10 Correct 6 ms 4944 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4988 KB Output is correct
2 Correct 9 ms 4984 KB Output is correct
3 Correct 5 ms 4944 KB Output is correct
4 Correct 8 ms 4992 KB Output is correct
5 Correct 5 ms 4992 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 8 ms 5012 KB Output is correct
8 Correct 9 ms 4948 KB Output is correct
9 Correct 6 ms 4944 KB Output is correct
10 Correct 7 ms 4944 KB Output is correct
11 Correct 11 ms 5004 KB Output is correct
12 Correct 7 ms 4944 KB Output is correct
13 Correct 9 ms 4972 KB Output is correct
14 Correct 7 ms 4996 KB Output is correct
15 Correct 15 ms 4944 KB Output is correct
16 Correct 57 ms 5136 KB Output is correct
17 Correct 10 ms 4992 KB Output is correct
18 Partially correct 53 ms 5132 KB Partially correct - number of queries: 5070
19 Correct 5 ms 4996 KB Output is correct
20 Correct 19 ms 5000 KB Output is correct
21 Correct 20 ms 4988 KB Output is correct
22 Correct 7 ms 5096 KB Output is correct
23 Correct 9 ms 5068 KB Output is correct
24 Correct 6 ms 4996 KB Output is correct
25 Correct 28 ms 5004 KB Output is correct
26 Correct 30 ms 5060 KB Output is correct
27 Correct 7 ms 4944 KB Output is correct
28 Correct 51 ms 5084 KB Output is correct
29 Correct 32 ms 4980 KB Output is correct
30 Partially correct 45 ms 5064 KB Partially correct - number of queries: 5052
31 Correct 10 ms 5000 KB Output is correct
32 Correct 11 ms 4992 KB Output is correct
33 Correct 4 ms 4944 KB Output is correct
34 Correct 17 ms 5132 KB Output is correct
35 Correct 11 ms 4984 KB Output is correct
36 Correct 14 ms 4988 KB Output is correct
37 Correct 8 ms 4980 KB Output is correct
38 Correct 5 ms 5008 KB Output is correct
39 Correct 24 ms 4988 KB Output is correct
40 Correct 44 ms 5112 KB Output is correct
41 Correct 27 ms 4992 KB Output is correct
42 Correct 28 ms 5004 KB Output is correct
43 Correct 14 ms 5064 KB Output is correct
44 Correct 27 ms 5028 KB Output is correct
45 Correct 19 ms 5028 KB Output is correct
46 Correct 5 ms 5088 KB Output is correct
47 Correct 27 ms 5008 KB Output is correct
48 Correct 36 ms 5032 KB Output is correct
49 Correct 11 ms 5000 KB Output is correct
50 Partially correct 41 ms 5236 KB Partially correct - number of queries: 5089
51 Correct 21 ms 5004 KB Output is correct
52 Correct 9 ms 4984 KB Output is correct
53 Correct 9 ms 4992 KB Output is correct
54 Correct 25 ms 5056 KB Output is correct
55 Correct 8 ms 4996 KB Output is correct
56 Partially correct 35 ms 5140 KB Partially correct - number of queries: 5096
57 Correct 42 ms 4980 KB Output is correct
58 Correct 30 ms 5052 KB Output is correct
59 Correct 37 ms 4980 KB Output is correct
60 Correct 31 ms 4992 KB Output is correct
61 Correct 6 ms 4996 KB Output is correct
62 Correct 9 ms 4992 KB Output is correct
63 Correct 8 ms 5008 KB Output is correct
64 Correct 7 ms 4928 KB Output is correct
65 Correct 7 ms 4944 KB Output is correct
66 Correct 8 ms 4988 KB Output is correct
67 Correct 17 ms 4944 KB Output is correct
68 Correct 9 ms 4996 KB Output is correct
69 Correct 10 ms 5012 KB Output is correct
70 Correct 17 ms 5000 KB Output is correct
71 Partially correct 77 ms 5036 KB Partially correct - number of queries: 5228
72 Correct 12 ms 4944 KB Output is correct
73 Partially correct 76 ms 5064 KB Partially correct - number of queries: 5165
74 Partially correct 56 ms 5044 KB Partially correct - number of queries: 5192
75 Correct 11 ms 5000 KB Output is correct
76 Correct 49 ms 5132 KB Output is correct
77 Partially correct 50 ms 5144 KB Partially correct - number of queries: 5194
78 Correct 17 ms 5008 KB Output is correct
79 Correct 29 ms 5052 KB Output is correct
80 Partially correct 44 ms 5128 KB Partially correct - number of queries: 5189
81 Partially correct 62 ms 5080 KB Partially correct - number of queries: 5133
82 Partially correct 41 ms 5116 KB Partially correct - number of queries: 5090
83 Correct 12 ms 5008 KB Output is correct
84 Correct 53 ms 5088 KB Output is correct
85 Partially correct 58 ms 5228 KB Partially correct - number of queries: 5221
86 Incorrect 85 ms 5200 KB Incorrect
87 Halted 0 ms 0 KB -