oj.uz

Submission #778656

# Submission time Handle Problem Language Result Execution time Memory
778656 2023-07-10T14:19:10 Z benjaminkleyn The Big Prize (IOI17_prize) C++17
100 / 100
 525 ms 2568 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

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

unordered_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)
{
    if (l + 1 == r)
        return -1;

    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;
    }

    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 308 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 0 ms 308 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 0 ms 312 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 336 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 304 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 300 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 3 ms 796 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 7 ms 1360 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 13 ms 556 KB Output is correct
16 Correct 359 ms 2188 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 476 ms 2412 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 30 ms 696 KB Output is correct
21 Correct 88 ms 1040 KB Output is correct
22 Correct 7 ms 556 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 119 ms 1432 KB Output is correct
26 Correct 108 ms 1436 KB Output is correct
27 Correct 1 ms 432 KB Output is correct
28 Correct 379 ms 2348 KB Output is correct
29 Correct 238 ms 1964 KB Output is correct
30 Correct 501 ms 2424 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 4 ms 1136 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 43 ms 964 KB Output is correct
35 Correct 2 ms 684 KB Output is correct
36 Correct 29 ms 976 KB Output is correct
37 Correct 2 ms 556 KB Output is correct
38 Correct 1 ms 316 KB Output is correct
39 Correct 99 ms 1220 KB Output is correct
40 Correct 396 ms 2344 KB Output is correct
41 Correct 169 ms 1576 KB Output is correct
42 Correct 148 ms 1504 KB Output is correct
43 Correct 133 ms 1532 KB Output is correct
44 Correct 73 ms 1088 KB Output is correct
45 Correct 54 ms 968 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 86 ms 1232 KB Output is correct
48 Correct 256 ms 1828 KB Output is correct
49 Correct 5 ms 448 KB Output is correct
50 Correct 523 ms 2500 KB Output is correct
51 Correct 80 ms 1072 KB Output is correct
52 Correct 1 ms 300 KB Output is correct
53 Correct 2 ms 720 KB Output is correct
54 Correct 83 ms 1132 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 518 ms 2336 KB Output is correct
57 Correct 248 ms 1848 KB Output is correct
58 Correct 228 ms 1768 KB Output is correct
59 Correct 163 ms 1604 KB Output is correct
60 Correct 148 ms 1508 KB Output is correct
61 Correct 2 ms 720 KB Output is correct
62 Correct 1 ms 308 KB Output is correct
63 Correct 3 ms 688 KB Output is correct
64 Correct 1 ms 580 KB Output is correct
65 Correct 1 ms 476 KB Output is correct
66 Correct 1 ms 304 KB Output is correct
67 Correct 1 ms 336 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 336 KB Output is correct
71 Correct 523 ms 2460 KB Output is correct
72 Correct 8 ms 1360 KB Output is correct
73 Correct 514 ms 2384 KB Output is correct
74 Correct 513 ms 2524 KB Output is correct
75 Correct 2 ms 720 KB Output is correct
76 Correct 391 ms 2468 KB Output is correct
77 Correct 513 ms 2428 KB Output is correct
78 Correct 10 ms 1360 KB Output is correct
79 Correct 124 ms 2276 KB Output is correct
80 Correct 487 ms 2404 KB Output is correct
81 Correct 525 ms 2456 KB Output is correct
82 Correct 494 ms 2332 KB Output is correct
83 Correct 2 ms 720 KB Output is correct
84 Correct 331 ms 2376 KB Output is correct
85 Correct 524 ms 2568 KB Output is correct
86 Correct 13 ms 1180 KB Output is correct
87 Correct 4 ms 976 KB Output is correct
88 Correct 8 ms 1232 KB Output is correct
89 Correct 9 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 336 KB Output is correct
93 Correct 5 ms 976 KB Output is correct
94 Correct 5 ms 1104 KB Output is correct
95 Correct 8 ms 1124 KB Output is correct
96 Correct 5 ms 976 KB Output is correct
97 Correct 1 ms 336 KB Output is correct