oj.uz

Submission #778648

# Submission time Handle Problem Language Result Execution time Memory
778648 2023-07-10T14:13:10 Z benjaminkleyn The Big Prize (IOI17_prize) C++17
100 / 100
 588 ms 2560 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair

bool asked[200000] = {false};
int L[200000], R[200000];

map<int, set<int>> queries;

bool Ask(int i)
{
    if (asked[i]) return L[i] + R[i] == 0;
    asked[i] = true;
    vector<int> res = ask(i);
    L[i] = res[0], R[i] = res[1];

    if (queries.find(L[i] + R[i]) == queries.end())
        queries[L[i] + R[i]] = set<int>();
    queries[L[i] + R[i]].insert(i);

    return L[i] + R[i] == 0;
}


int Find(int l, int r)
{
    for (auto [x, s] : queries)
    {
        auto it1 = s.upper_bound(l), it2 = s.lower_bound(r);
        if (it1 == s.begin() || it2 == s.end()) continue;
        if (L[*prev(it1)] == L[*it2]) return -1;
    }

    if (l + 1 == r)
    {
        if (Ask(l)) return l;
        if (Ask(r)) return r;
        return -1;
    }

    int m = (l + r) / 2;
    if (Ask(m)) return m;

    int x = Find(l, m);
    if (x >= 0) return x;

    int y = Find(m, r);
    if (y >= 0) return y;

    return -1;
}

int find_best(int n) 
{
    if (Ask(0)) return 0;
    if (Ask(n-1)) return n-1;
    return Find(0, n - 1);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 336 KB Output is correct

Subtask #2
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 0 ms 304 KB Output is correct
5 Correct 0 ms 312 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 0 ms 300 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 3 ms 720 KB Output is correct
12 Correct 1 ms 432 KB Output is correct
13 Correct 9 ms 1360 KB Output is correct
14 Correct 3 ms 276 KB Output is correct
15 Correct 11 ms 604 KB Output is correct
16 Correct 366 ms 2056 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 559 ms 2408 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 37 ms 744 KB Output is correct
21 Correct 78 ms 1080 KB Output is correct
22 Correct 4 ms 528 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 135 ms 1572 KB Output is correct
26 Correct 135 ms 1364 KB Output is correct
27 Correct 1 ms 428 KB Output is correct
28 Correct 400 ms 2224 KB Output is correct
29 Correct 260 ms 1992 KB Output is correct
30 Correct 574 ms 2392 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 6 ms 1104 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 52 ms 972 KB Output is correct
35 Correct 1 ms 708 KB Output is correct
36 Correct 26 ms 720 KB Output is correct
37 Correct 1 ms 552 KB Output is correct
38 Correct 1 ms 300 KB Output is correct
39 Correct 98 ms 1264 KB Output is correct
40 Correct 419 ms 2284 KB Output is correct
41 Correct 186 ms 1492 KB Output is correct
42 Correct 167 ms 1504 KB Output is correct
43 Correct 148 ms 1480 KB Output is correct
44 Correct 77 ms 1132 KB Output is correct
45 Correct 50 ms 912 KB Output is correct
46 Correct 0 ms 316 KB Output is correct
47 Correct 104 ms 1188 KB Output is correct
48 Correct 298 ms 1752 KB Output is correct
49 Correct 5 ms 588 KB Output is correct
50 Correct 572 ms 2396 KB Output is correct
51 Correct 87 ms 1124 KB Output is correct
52 Correct 1 ms 440 KB Output is correct
53 Correct 2 ms 692 KB Output is correct
54 Correct 86 ms 1132 KB Output is correct
55 Correct 1 ms 304 KB Output is correct
56 Correct 588 ms 2448 KB Output is correct
57 Correct 259 ms 1812 KB Output is correct
58 Correct 258 ms 1732 KB Output is correct
59 Correct 179 ms 1572 KB Output is correct
60 Correct 158 ms 1456 KB Output is correct
61 Correct 2 ms 736 KB Output is correct
62 Correct 1 ms 336 KB Output is correct
63 Correct 2 ms 720 KB Output is correct
64 Correct 1 ms 544 KB Output is correct
65 Correct 1 ms 428 KB Output is correct
66 Correct 1 ms 316 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 1 ms 304 KB Output is correct
69 Correct 1 ms 336 KB Output is correct
70 Correct 1 ms 308 KB Output is correct
71 Correct 566 ms 2440 KB Output is correct
72 Correct 12 ms 1328 KB Output is correct
73 Correct 582 ms 2344 KB Output is correct
74 Correct 553 ms 2376 KB Output is correct
75 Correct 1 ms 736 KB Output is correct
76 Correct 392 ms 2472 KB Output is correct
77 Correct 559 ms 2516 KB Output is correct
78 Correct 8 ms 1352 KB Output is correct
79 Correct 138 ms 2204 KB Output is correct
80 Correct 557 ms 2416 KB Output is correct
81 Correct 580 ms 2396 KB Output is correct
82 Correct 519 ms 2452 KB Output is correct
83 Correct 3 ms 720 KB Output is correct
84 Correct 380 ms 2560 KB Output is correct
85 Correct 570 ms 2476 KB Output is correct
86 Correct 11 ms 1232 KB Output is correct
87 Correct 5 ms 976 KB Output is correct
88 Correct 10 ms 1128 KB Output is correct
89 Correct 12 ms 1104 KB Output is correct
90 Correct 2 ms 720 KB Output is correct
91 Correct 5 ms 848 KB Output is correct
92 Correct 1 ms 340 KB Output is correct
93 Correct 6 ms 968 KB Output is correct
94 Correct 8 ms 1140 KB Output is correct
95 Correct 6 ms 1084 KB Output is correct
96 Correct 5 ms 1004 KB Output is correct
97 Correct 1 ms 336 KB Output is correct