oj.uz

Submission #778556

# Submission time Handle Problem Language Result Execution time Memory
778556 2023-07-10T12:12:16 Z benjaminkleyn The Big Prize (IOI17_prize) C++17
94.66 / 100
 56 ms 4116 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair

bool asked[200000];
int L[200000], R[200000];
map<pair<int, int>, int> max_idx;
int v, N;

int t[800000] = {0};
void update(int v, int tl, int tr, int idx, int val)
{
    if (tl == tr) 
    {
        t[v] = max(t[v], val);
        return;
    }
    int tm = (tl + tr) / 2;
    if (idx <= tm)
        update(2 * v, tl, tm, idx, val);
    else
        update(2 * v + 1, tm + 1, tr, idx, val);
    t[v] = max(t[2 * v], t[2 * v + 1]);
}
int query(int v, int tl, int tr, int l, int r)
{
    if (r < tl || tr < l) return 0;
    if (l <= tl && tr <= r) return t[v];
    int tm = (tl + tr) / 2;
    return max(
        query(2 * v, tl, tm, l, r),
        query(2 * v + 1, tm + 1, tr, l, r)
    );
}

void Ask(int i)
{
    if (asked[i]) return;
    asked[i] = true;
    vector<int> res = ask(i);
    L[i] = res[0], R[i] = res[1];
    if (max_idx.find(mp(L[i], R[i])) == max_idx.end())
        max_idx[mp(L[i], R[i])] = i;
    else
        max_idx[mp(L[i], R[i])] = max(max_idx[mp(L[i], R[i])], i);
    if (L[i] + R[i] == L[v] + R[v])
        update(1, 0, N - 1, i, L[i]);
}

int find_best(int n) 
{
    memset(asked, false, sizeof(asked));
    max_idx = map<pair<int,int>,int>();

    N = n;
    int i = 0;
    Ask(i);
    for (int j = 0; j < n && j < 500; j++)
    {
        Ask(j);
        if (L[j] + R[j] == 0)
            return j;
        if (L[j] + R[j] > L[i] + R[i])
            i = j;
    }
    v = i;

    while (i < n)
    {
        for (int j = 18; j >= 0; j--)
            if (i + (1 << j) < n)
            {
                if (query(1, 0, n - 1, i, i + (1 << j)) > L[i])
                    continue;
                Ask(i + (1 << j));
                if (L[i + (1 << j)] + R[i + (1 << j)] == 0)
                    return i + (1 << j);
                i = max_idx[mp(L[i], R[i])];
            }
        while (i < n)
        {
            Ask(++i);
            if (L[i] + R[i] == 0) return i;
            if (L[i] + R[i] == L[v] + R[v]) break;
        }
    }
    return n - 1;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 688 KB Output is correct
2 Correct 5 ms 692 KB Output is correct
3 Correct 5 ms 684 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 4 ms 688 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 4 ms 680 KB Output is correct
8 Correct 3 ms 680 KB Output is correct
9 Correct 3 ms 688 KB Output is correct
10 Correct 4 ms 720 KB Output is correct

Subtask #2
74.66 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 716 KB Output is correct
2 Correct 4 ms 676 KB Output is correct
3 Correct 2 ms 692 KB Output is correct
4 Correct 4 ms 568 KB Output is correct
5 Correct 3 ms 668 KB Output is correct
6 Correct 0 ms 444 KB Output is correct
7 Correct 2 ms 680 KB Output is correct
8 Correct 5 ms 720 KB Output is correct
9 Correct 3 ms 720 KB Output is correct
10 Correct 4 ms 720 KB Output is correct
11 Correct 4 ms 1684 KB Output is correct
12 Correct 5 ms 684 KB Output is correct
13 Correct 6 ms 2940 KB Output is correct
14 Correct 5 ms 592 KB Output is correct
15 Correct 6 ms 1124 KB Output is correct
16 Correct 21 ms 3628 KB Output is correct
17 Correct 4 ms 464 KB Output is correct
18 Partially correct 51 ms 4036 KB Partially correct - number of queries: 5534
19 Correct 4 ms 464 KB Output is correct
20 Correct 11 ms 1232 KB Output is correct
21 Correct 23 ms 1960 KB Output is correct
22 Correct 8 ms 968 KB Output is correct
23 Correct 3 ms 668 KB Output is correct
24 Correct 6 ms 688 KB Output is correct
25 Correct 14 ms 2460 KB Output is correct
26 Correct 13 ms 2452 KB Output is correct
27 Correct 3 ms 1024 KB Output is correct
28 Correct 45 ms 3872 KB Output is correct
29 Correct 39 ms 3656 KB Output is correct
30 Partially correct 41 ms 4080 KB Partially correct - number of queries: 5495
31 Correct 4 ms 464 KB Output is correct
32 Correct 5 ms 2300 KB Output is correct
33 Correct 1 ms 508 KB Output is correct
34 Correct 14 ms 1696 KB Output is correct
35 Correct 6 ms 1332 KB Output is correct
36 Correct 14 ms 1460 KB Output is correct
37 Correct 6 ms 1056 KB Output is correct
38 Correct 4 ms 700 KB Output is correct
39 Correct 20 ms 2152 KB Output is correct
40 Correct 33 ms 4040 KB Output is correct
41 Correct 33 ms 2544 KB Output is correct
42 Correct 33 ms 2604 KB Output is correct
43 Correct 30 ms 2504 KB Output is correct
44 Correct 26 ms 1948 KB Output is correct
45 Correct 9 ms 1640 KB Output is correct
46 Correct 4 ms 464 KB Output is correct
47 Correct 20 ms 2092 KB Output is correct
48 Correct 38 ms 3112 KB Output is correct
49 Correct 4 ms 888 KB Output is correct
50 Partially correct 38 ms 4040 KB Partially correct - number of queries: 5526
51 Correct 18 ms 1992 KB Output is correct
52 Correct 5 ms 688 KB Output is correct
53 Correct 4 ms 1588 KB Output is correct
54 Correct 25 ms 2092 KB Output is correct
55 Correct 4 ms 536 KB Output is correct
56 Partially correct 56 ms 4068 KB Partially correct - number of queries: 5524
57 Correct 19 ms 3176 KB Output is correct
58 Correct 40 ms 3224 KB Output is correct
59 Correct 30 ms 2596 KB Output is correct
60 Correct 25 ms 2476 KB Output is correct
61 Correct 6 ms 1544 KB Output is correct
62 Correct 5 ms 720 KB Output is correct
63 Correct 3 ms 1540 KB Output is correct
64 Correct 3 ms 1156 KB Output is correct
65 Correct 3 ms 564 KB Output is correct
66 Correct 4 ms 560 KB Output is correct
67 Correct 2 ms 556 KB Output is correct
68 Correct 2 ms 556 KB Output is correct
69 Correct 4 ms 540 KB Output is correct
70 Correct 6 ms 616 KB Output is correct
71 Partially correct 35 ms 4020 KB Partially correct - number of queries: 5057
72 Correct 10 ms 2608 KB Output is correct
73 Partially correct 29 ms 4032 KB Partially correct - number of queries: 5001
74 Partially correct 48 ms 4068 KB Partially correct - number of queries: 5025
75 Correct 5 ms 1488 KB Output is correct
76 Correct 44 ms 4084 KB Output is correct
77 Partially correct 54 ms 4008 KB Partially correct - number of queries: 5519
78 Correct 11 ms 2668 KB Output is correct
79 Correct 18 ms 4028 KB Output is correct
80 Partially correct 52 ms 4040 KB Partially correct - number of queries: 5493
81 Partially correct 43 ms 4076 KB Partially correct - number of queries: 5471
82 Partially correct 42 ms 4116 KB Partially correct - number of queries: 5452
83 Correct 7 ms 1488 KB Output is correct
84 Correct 45 ms 4016 KB Output is correct
85 Partially correct 36 ms 4056 KB Partially correct - number of queries: 5437
86 Correct 5 ms 688 KB Output is correct
87 Correct 5 ms 688 KB Output is correct
88 Correct 5 ms 720 KB Output is correct
89 Correct 5 ms 688 KB Output is correct
90 Correct 3 ms 720 KB Output is correct
91 Correct 3 ms 720 KB Output is correct
92 Correct 4 ms 684 KB Output is correct
93 Correct 8 ms 2020 KB Output is correct
94 Correct 9 ms 2220 KB Output is correct
95 Correct 9 ms 2128 KB Output is correct
96 Correct 7 ms 2156 KB Output is correct
97 Correct 4 ms 720 KB Output is correct