oj.uz

Submission #1001108

# Submission time Handle Problem Language Result Execution time Memory
1001108 2024-06-18T14:45:44 Z c2zi6 The Big Prize (IOI17_prize) C++14
90 / 100
 55 ms 5724 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "prize.h"

VVI qr;
VI myask(int ind) {
    if (qr[ind].size()) return qr[ind];
    return qr[ind] = ask(ind);
}
int sum(int ind) {
    return qr[ind][0] + qr[ind][1];
}

int dfs(int l, int r) {
    /*cout << "NOW PROCESSING " << l+1 << " " << r+1 << endl;*/
    myask(l);
    if (sum(l) == 0) return l;
    myask(r);
    if (sum(r) == 0) return r;
    if (l > r) return -1;
    if (sum(l) > sum(r)) return dfs(l, r-1);
    if (sum(l) < sum(r)) return dfs(l+1, r);
    if (qr[l][0] == qr[r][0]) return -1;
    int L = l, R = r;
    while (L + 1 < R) {
        int M = (L + R) / 2;
        myask(M);
        if (sum(M) == 0) return M;
        if (sum(M) != sum(l)) {
            int ret;
            ret = dfs(l, M);
            if (ret != -1) return ret;
            ret = dfs(M, r);
            if (ret != -1) return ret;
            return -1;
        }
        if (qr[M][0] - qr[l][0] == 0) L = M;
        else R = M;
    }
    return -1;
}

int find_best(int n) {
    qr = VVI(n);
    return dfs(0, n-1);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 2 ms 4952 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 1 ms 5204 KB Output is correct
6 Correct 2 ms 4952 KB Output is correct
7 Correct 2 ms 4952 KB Output is correct
8 Correct 1 ms 4952 KB Output is correct
9 Correct 1 ms 4952 KB Output is correct
10 Correct 2 ms 4952 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 2 ms 4952 KB Output is correct
7 Correct 2 ms 4952 KB Output is correct
8 Correct 1 ms 4952 KB Output is correct
9 Correct 1 ms 4964 KB Output is correct
10 Correct 1 ms 4952 KB Output is correct
11 Correct 3 ms 4952 KB Output is correct
12 Correct 2 ms 4952 KB Output is correct
13 Correct 3 ms 4952 KB Output is correct
14 Correct 2 ms 856 KB Output is correct
15 Correct 5 ms 5208 KB Output is correct
16 Partially correct 37 ms 5384 KB Partially correct - number of queries: 6232
17 Correct 2 ms 4952 KB Output is correct
18 Partially correct 55 ms 5208 KB Partially correct - number of queries: 7332
19 Correct 2 ms 4952 KB Output is correct
20 Correct 10 ms 2648 KB Output is correct
21 Correct 12 ms 4952 KB Output is correct
22 Correct 4 ms 4952 KB Output is correct
23 Correct 2 ms 4952 KB Output is correct
24 Correct 2 ms 4952 KB Output is correct
25 Correct 16 ms 5456 KB Output is correct
26 Correct 18 ms 5216 KB Output is correct
27 Correct 2 ms 4952 KB Output is correct
28 Partially correct 33 ms 5268 KB Partially correct - number of queries: 6289
29 Partially correct 24 ms 5184 KB Partially correct - number of queries: 5003
30 Partially correct 40 ms 5200 KB Partially correct - number of queries: 7549
31 Correct 2 ms 4952 KB Output is correct
32 Correct 3 ms 4952 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 12 ms 5284 KB Output is correct
35 Correct 3 ms 4952 KB Output is correct
36 Correct 10 ms 5192 KB Output is correct
37 Correct 2 ms 4952 KB Output is correct
38 Correct 2 ms 5032 KB Output is correct
39 Correct 14 ms 5216 KB Output is correct
40 Partially correct 36 ms 5200 KB Partially correct - number of queries: 6437
41 Correct 21 ms 5208 KB Output is correct
42 Correct 21 ms 5208 KB Output is correct
43 Correct 25 ms 5156 KB Output is correct
44 Correct 15 ms 5208 KB Output is correct
45 Correct 10 ms 5208 KB Output is correct
46 Correct 1 ms 4952 KB Output is correct
47 Correct 20 ms 5168 KB Output is correct
48 Partially correct 22 ms 5456 KB Partially correct - number of queries: 5369
49 Correct 5 ms 5208 KB Output is correct
50 Partially correct 55 ms 5192 KB Partially correct - number of queries: 7339
51 Correct 18 ms 5200 KB Output is correct
52 Correct 2 ms 4952 KB Output is correct
53 Correct 2 ms 5032 KB Output is correct
54 Correct 16 ms 5404 KB Output is correct
55 Correct 2 ms 4952 KB Output is correct
56 Partially correct 54 ms 5500 KB Partially correct - number of queries: 7318
57 Partially correct 24 ms 5144 KB Partially correct - number of queries: 5229
58 Correct 17 ms 5724 KB Output is correct
59 Correct 27 ms 5200 KB Output is correct
60 Correct 19 ms 5208 KB Output is correct
61 Correct 2 ms 4952 KB Output is correct
62 Correct 1 ms 4952 KB Output is correct
63 Correct 2 ms 4952 KB Output is correct
64 Correct 2 ms 4952 KB Output is correct
65 Correct 1 ms 4952 KB Output is correct
66 Correct 2 ms 5040 KB Output is correct
67 Correct 3 ms 4952 KB Output is correct
68 Correct 4 ms 4952 KB Output is correct
69 Correct 2 ms 4952 KB Output is correct
70 Correct 3 ms 4952 KB Output is correct
71 Partially correct 43 ms 5200 KB Partially correct - number of queries: 7755
72 Correct 4 ms 5208 KB Output is correct
73 Partially correct 44 ms 5456 KB Partially correct - number of queries: 7639
74 Partially correct 34 ms 5500 KB Partially correct - number of queries: 7696
75 Correct 2 ms 4952 KB Output is correct
76 Partially correct 34 ms 5188 KB Partially correct - number of queries: 6637
77 Partially correct 35 ms 5200 KB Partially correct - number of queries: 6904
78 Correct 5 ms 4952 KB Output is correct
79 Correct 16 ms 5208 KB Output is correct
80 Partially correct 36 ms 5484 KB Partially correct - number of queries: 7179
81 Partially correct 51 ms 5712 KB Partially correct - number of queries: 7236
82 Partially correct 43 ms 5416 KB Partially correct - number of queries: 7275
83 Correct 2 ms 4952 KB Output is correct
84 Partially correct 29 ms 5196 KB Partially correct - number of queries: 5670
85 Partially correct 52 ms 5528 KB Partially correct - number of queries: 7292
86 Correct 5 ms 4952 KB Output is correct
87 Correct 2 ms 5200 KB Output is correct
88 Correct 4 ms 4952 KB Output is correct
89 Correct 4 ms 5164 KB Output is correct
90 Correct 2 ms 4952 KB Output is correct
91 Correct 3 ms 4952 KB Output is correct
92 Correct 3 ms 4952 KB Output is correct
93 Correct 3 ms 4952 KB Output is correct
94 Correct 3 ms 4952 KB Output is correct
95 Correct 3 ms 4952 KB Output is correct
96 Correct 3 ms 4952 KB Output is correct
97 Correct 2 ms 4952 KB Output is correct