oj.uz

Submission #1055670

# Submission time Handle Problem Language Result Execution time Memory
1055670 2024-08-13T02:54:27 Z thieunguyenhuy The Big Prize (IOI17_prize) C++17
92.83 / 100
 28 ms 1364 KB 
#ifndef hwe
	#include "prize.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;

map<int, vector<int>> mem;
int ans = -1, not_lolipop = -1;

#ifdef hwe
vector<int> ask(int id) {
    return {0, 1};
}
#endif

vector<int> myask(int id) {
    auto it = mem.find(id);
    if (it != mem.end()) return mem[id];
    vector<int> tmp = ask(id); mem[id] = tmp;
    if (tmp[0] + tmp[1] == 0) ans = id;
    return tmp;
}

void dnc(int l, int r, int prefL, int prefR) {
    if (ans != -1) return;
    if (prefR - prefL == 0) return;
    
    if (l == r) {
        vector<int> tmp = myask(l);
        if (tmp[0] + tmp[1] == 0) ans = l;
        return;
    }

    int mid = l + r + 1 >> 1; vector<int> ask_mid = myask(mid);

    dnc(l, mid - 1, prefL, ask_mid[0]);
    dnc(mid, r, ask_mid[0], prefR);
}

int find_best(int n) {
    ans = not_lolipop = -1;
    for (int i = 0; i < min(500, n); ++i) {
        vector<int> tmp = myask(i);
        if (tmp[0] + tmp[1] == 0) return i;
        maximize(not_lolipop, tmp[0] + tmp[1]);
    }

    dnc(0, n - 1, 0, not_lolipop);

    assert(0 <= ans && ans < n);
    return ans;
}

#ifdef hwe
signed main() {


    cerr << '\n'; return 0;
}
#endif

Compilation message

prize.cpp: In function 'void dnc(int, int, int, int)':
prize.cpp:97:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   97 |     int mid = l + r + 1 >> 1; vector<int> ask_mid = myask(mid);
      |               ~~~~~~^~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 344 KB Output is correct

Subtask #2
72.83 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 4 ms 804 KB Output is correct
16 Correct 19 ms 848 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Partially correct 25 ms 1004 KB Partially correct - number of queries: 5581
19 Correct 2 ms 344 KB Output is correct
20 Correct 7 ms 556 KB Output is correct
21 Correct 11 ms 600 KB Output is correct
22 Correct 4 ms 452 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 2 ms 600 KB Output is correct
25 Correct 12 ms 600 KB Output is correct
26 Correct 12 ms 748 KB Output is correct
27 Correct 3 ms 600 KB Output is correct
28 Correct 20 ms 876 KB Output is correct
29 Correct 11 ms 856 KB Output is correct
30 Partially correct 22 ms 1112 KB Partially correct - number of queries: 5540
31 Correct 2 ms 344 KB Output is correct
32 Correct 4 ms 684 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 12 ms 572 KB Output is correct
35 Correct 3 ms 600 KB Output is correct
36 Correct 6 ms 600 KB Output is correct
37 Correct 3 ms 344 KB Output is correct
38 Correct 2 ms 344 KB Output is correct
39 Correct 15 ms 856 KB Output is correct
40 Correct 24 ms 760 KB Output is correct
41 Correct 13 ms 684 KB Output is correct
42 Correct 14 ms 600 KB Output is correct
43 Correct 18 ms 640 KB Output is correct
44 Correct 7 ms 600 KB Output is correct
45 Correct 6 ms 596 KB Output is correct
46 Correct 2 ms 884 KB Output is correct
47 Correct 11 ms 612 KB Output is correct
48 Correct 17 ms 848 KB Output is correct
49 Correct 3 ms 344 KB Output is correct
50 Partially correct 22 ms 956 KB Partially correct - number of queries: 5587
51 Correct 13 ms 588 KB Output is correct
52 Correct 4 ms 344 KB Output is correct
53 Correct 3 ms 344 KB Output is correct
54 Correct 8 ms 596 KB Output is correct
55 Correct 2 ms 344 KB Output is correct
56 Partially correct 21 ms 1364 KB Partially correct - number of queries: 5590
57 Correct 15 ms 976 KB Output is correct
58 Correct 15 ms 768 KB Output is correct
59 Correct 10 ms 600 KB Output is correct
60 Correct 9 ms 600 KB Output is correct
61 Correct 3 ms 344 KB Output is correct
62 Correct 2 ms 344 KB Output is correct
63 Correct 3 ms 428 KB Output is correct
64 Correct 3 ms 344 KB Output is correct
65 Correct 2 ms 344 KB Output is correct
66 Correct 3 ms 344 KB Output is correct
67 Correct 2 ms 344 KB Output is correct
68 Correct 2 ms 600 KB Output is correct
69 Correct 4 ms 344 KB Output is correct
70 Correct 3 ms 600 KB Output is correct
71 Partially correct 28 ms 876 KB Partially correct - number of queries: 5258
72 Correct 4 ms 344 KB Output is correct
73 Partially correct 24 ms 856 KB Partially correct - number of queries: 5195
74 Partially correct 19 ms 848 KB Partially correct - number of queries: 5222
75 Correct 3 ms 600 KB Output is correct
76 Correct 16 ms 836 KB Output is correct
77 Partially correct 26 ms 864 KB Partially correct - number of queries: 5717
78 Correct 6 ms 344 KB Output is correct
79 Correct 12 ms 600 KB Output is correct
80 Partially correct 21 ms 848 KB Partially correct - number of queries: 5694
81 Partially correct 20 ms 848 KB Partially correct - number of queries: 5708
82 Partially correct 28 ms 924 KB Partially correct - number of queries: 5656
83 Correct 2 ms 344 KB Output is correct
84 Correct 19 ms 764 KB Output is correct
85 Partially correct 20 ms 1040 KB Partially correct - number of queries: 5673
86 Correct 3 ms 344 KB Output is correct
87 Correct 2 ms 600 KB Output is correct
88 Correct 2 ms 344 KB Output is correct
89 Correct 3 ms 344 KB Output is correct
90 Correct 2 ms 344 KB Output is correct
91 Correct 3 ms 344 KB Output is correct
92 Correct 2 ms 344 KB Output is correct
93 Correct 4 ms 628 KB Output is correct
94 Correct 5 ms 600 KB Output is correct
95 Correct 4 ms 344 KB Output is correct
96 Correct 4 ms 344 KB Output is correct
97 Correct 2 ms 344 KB Output is correct