oj.uz

Submission #778575

# Submission time Handle Problem Language Result Execution time Memory
778575 2023-07-10T12:38:23 Z benjaminkleyn The Big Prize (IOI17_prize) C++17
20 / 100
 81 ms 4140 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 (2 * (L[j] + R[j]) > n)
        {
            i = j;
            break;
        }
    }
    v = i;

    while (i < n)
    {
        i = max_idx[mp(L[i], R[i])];
        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 692 KB Output is correct
2 Correct 2 ms 684 KB Output is correct
3 Correct 2 ms 688 KB Output is correct
4 Correct 5 ms 552 KB Output is correct
5 Correct 2 ms 688 KB Output is correct
6 Correct 0 ms 440 KB Output is correct
7 Correct 5 ms 692 KB Output is correct
8 Correct 5 ms 720 KB Output is correct
9 Correct 3 ms 716 KB Output is correct
10 Correct 5 ms 684 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 696 KB Output is correct
2 Correct 4 ms 720 KB Output is correct
3 Correct 5 ms 688 KB Output is correct
4 Correct 5 ms 552 KB Output is correct
5 Correct 4 ms 684 KB Output is correct
6 Correct 1 ms 540 KB Output is correct
7 Correct 2 ms 688 KB Output is correct
8 Correct 3 ms 684 KB Output is correct
9 Correct 6 ms 684 KB Output is correct
10 Correct 4 ms 720 KB Output is correct
11 Correct 7 ms 1488 KB Output is correct
12 Correct 3 ms 720 KB Output is correct
13 Correct 5 ms 2684 KB Output is correct
14 Correct 4 ms 672 KB Output is correct
15 Correct 6 ms 1108 KB Output is correct
16 Correct 42 ms 3636 KB Output is correct
17 Correct 2 ms 564 KB Output is correct
18 Partially correct 50 ms 4048 KB Partially correct - number of queries: 5306
19 Correct 3 ms 560 KB Output is correct
20 Correct 11 ms 1192 KB Output is correct
21 Correct 21 ms 1880 KB Output is correct
22 Correct 5 ms 936 KB Output is correct
23 Correct 5 ms 680 KB Output is correct
24 Correct 6 ms 720 KB Output is correct
25 Correct 28 ms 2484 KB Output is correct
26 Correct 27 ms 2416 KB Output is correct
27 Correct 7 ms 940 KB Output is correct
28 Correct 34 ms 3880 KB Output is correct
29 Correct 37 ms 3612 KB Output is correct
30 Partially correct 52 ms 4076 KB Partially correct - number of queries: 5386
31 Correct 4 ms 432 KB Output is correct
32 Correct 5 ms 2280 KB Output is correct
33 Correct 0 ms 464 KB Output is correct
34 Correct 18 ms 1620 KB Output is correct
35 Correct 4 ms 1280 KB Output is correct
36 Correct 16 ms 1392 KB Output is correct
37 Correct 5 ms 932 KB Output is correct
38 Correct 4 ms 804 KB Output is correct
39 Correct 28 ms 2200 KB Output is correct
40 Correct 48 ms 4004 KB Output is correct
41 Correct 32 ms 2632 KB Output is correct
42 Correct 21 ms 2620 KB Output is correct
43 Correct 13 ms 2484 KB Output is correct
44 Correct 11 ms 2072 KB Output is correct
45 Correct 9 ms 1700 KB Output is correct
46 Correct 2 ms 464 KB Output is correct
47 Correct 13 ms 2148 KB Output is correct
48 Correct 26 ms 3128 KB Output is correct
49 Correct 7 ms 840 KB Output is correct
50 Partially correct 38 ms 4012 KB Partially correct - number of queries: 5322
51 Correct 20 ms 1992 KB Output is correct
52 Correct 3 ms 760 KB Output is correct
53 Correct 4 ms 1452 KB Output is correct
54 Correct 25 ms 2088 KB Output is correct
55 Correct 3 ms 436 KB Output is correct
56 Partially correct 50 ms 4140 KB Partially correct - number of queries: 5319
57 Correct 36 ms 3164 KB Output is correct
58 Correct 29 ms 3144 KB Output is correct
59 Correct 23 ms 2632 KB Output is correct
60 Correct 30 ms 2464 KB Output is correct
61 Correct 6 ms 1488 KB Output is correct
62 Correct 3 ms 692 KB Output is correct
63 Correct 3 ms 1400 KB Output is correct
64 Correct 3 ms 1176 KB Output is correct
65 Incorrect 81 ms 632 KB Incorrect
66 Halted 0 ms 0 KB -