oj.uz

Submission #961752

# Submission time Handle Problem Language Result Execution time Memory
961752 2024-04-12T12:05:45 Z steveonalex The Big Prize (IOI17_prize) C++17
100 / 100
 31 ms 3436 KB 
#include <bits/stdc++.h>
#include "prize.h"

 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n"){
        for(auto i: a) cout << i << separator;
        cout << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
 
// namespace Interactor{
//     const int BLOCK = 400;
//     int o_cnt = 0;
//     int n;
//     vector<int> a;

//     vector<int> ask(int i){
//         o_cnt++;
//         vector<int> ans(2);
//         for(int j = 0; j < i; ++j) ans[0] += (a[j] < a[i]);
//         for(int j = i+1; j<n; ++j) ans[1] += (a[j] < a[i]);
//         return ans;
//     }

    int range_query(set<int> &S, int l, int r){
        auto it = S.lower_bound(l);
        int cnt = 0;
        while(it != S.end()){
            if (*it > r) break;
            cnt++;
            it++;
        }
        return cnt;
    }

    void DnC(int l, int r, int ma, vector<pair<int, int>> &b, set<int> &S1, set<int> &S2){
        if (l > r) return;
        int x = (l + r) >> 1;
        if (b[x].first == -1){
            vector<int> cur= ask(x);
            b[x] = {cur[0], cur[1]};
        }
        if (b[x].first + b[x].second >= ma){
            S1.insert(x);

            // look to the left
            auto it = S1.lower_bound(x); it--;
            int dL = b[x].first - b[*it].first;
            if (dL - range_query(S2, *it, x) > 0) DnC(l, x - 1, ma, b, S1, S2);

            // look to the right
            it = S1.upper_bound(x);
            if (it == S1.end()) {
                DnC(x + 1, r, ma, b, S1, S2);
                return;
            }
            dL = b[*it].first - b[x].first;
            if (dL - range_query(S2, x, *it) > 0) DnC(x + 1, r, ma, b, S1, S2);
        }
        else{
            S2.insert(x);
            DnC(l, x - 1, ma, b, S1, S2);
            DnC(x + 1, r, ma, b, S1, S2);
        }
    }

    int find_best(int n) {
        const int BLOCK = 500;
        vector<pair<int, int>> b(n, {-1, -1});
        if (n <= 5000){
            for(int i = 0; i<n; ++i) {
                vector<int> cur = ask(i);
                if (cur[0] + cur[1] == 0) return i;
            }
        }
        int ma = 0;
        int pos = 0;
        for(int i = 0; i<BLOCK; ++i){
            pos = i;
            vector<int> cur = ask(i);
            b[i] = {cur[0], cur[1]};
            maximize(ma, cur[0] + cur[1]);
            if (ma >= 22) break;
        }

        set<int> S1, S2;
        for(int i = 0; i<n; ++i){
            if (b[i].first == -1) continue;
            if (b[i].first + b[i].second == ma) S1.insert(i);
            else S2.insert(i);
        }

        DnC(pos + 1, n-1, ma, b, S1, S2);

        for(int i: S2) if (b[i].first + b[i].second == 0) return i;
        exit(-1);
        return -1;
    }

//     bool solve(){
//         n = 2e5;
//         a.resize(n, 3);
//         a[0] = 1;
//         for(int i = 1; i<=BLOCK; ++i) a[i] = 2;
//         // reverse(ALL(a));
//         shuffle(ALL(a), rng);

//         // printArr(a, "");

//         int j = find_best(n);
//         cout << "! " << j << "\n";
//         return a[j] == 1; 
//     }

// }

 
// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     bool verdict = Interactor::solve();
//     if (verdict) cout << "AC\n";
//     else cout << "WA\n";

//     cout << Interactor::o_cnt << "\n";

//     return 0;
// }

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2272 KB Output is correct
2 Correct 3 ms 2016 KB Output is correct
3 Correct 3 ms 2020 KB Output is correct
4 Correct 3 ms 2016 KB Output is correct
5 Correct 3 ms 2020 KB Output is correct
6 Correct 4 ms 2192 KB Output is correct
7 Correct 4 ms 2016 KB Output is correct
8 Correct 4 ms 2016 KB Output is correct
9 Correct 3 ms 2020 KB Output is correct
10 Correct 3 ms 2020 KB Output is correct

Subtask #2
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2016 KB Output is correct
2 Correct 3 ms 2020 KB Output is correct
3 Correct 3 ms 2016 KB Output is correct
4 Correct 3 ms 2016 KB Output is correct
5 Correct 4 ms 2020 KB Output is correct
6 Correct 4 ms 2024 KB Output is correct
7 Correct 4 ms 2016 KB Output is correct
8 Correct 3 ms 2016 KB Output is correct
9 Correct 3 ms 2024 KB Output is correct
10 Correct 4 ms 2028 KB Output is correct
11 Correct 3 ms 2288 KB Output is correct
12 Correct 3 ms 2276 KB Output is correct
13 Correct 4 ms 2288 KB Output is correct
14 Correct 6 ms 1136 KB Output is correct
15 Correct 22 ms 2684 KB Output is correct
16 Correct 29 ms 3132 KB Output is correct
17 Correct 21 ms 3436 KB Output is correct
18 Correct 24 ms 2540 KB Output is correct
19 Correct 23 ms 3120 KB Output is correct
20 Correct 16 ms 2068 KB Output is correct
21 Correct 25 ms 2692 KB Output is correct
22 Correct 20 ms 2616 KB Output is correct
23 Correct 6 ms 2196 KB Output is correct
24 Correct 3 ms 2032 KB Output is correct
25 Correct 30 ms 2640 KB Output is correct
26 Correct 20 ms 2844 KB Output is correct
27 Correct 4 ms 2044 KB Output is correct
28 Correct 23 ms 2692 KB Output is correct
29 Correct 16 ms 2856 KB Output is correct
30 Correct 23 ms 2600 KB Output is correct
31 Correct 22 ms 3196 KB Output is correct
32 Correct 3 ms 2276 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 25 ms 2936 KB Output is correct
35 Correct 4 ms 2036 KB Output is correct
36 Correct 30 ms 2824 KB Output is correct
37 Correct 3 ms 2532 KB Output is correct
38 Correct 4 ms 2232 KB Output is correct
39 Correct 25 ms 3392 KB Output is correct
40 Correct 22 ms 2640 KB Output is correct
41 Correct 27 ms 2616 KB Output is correct
42 Correct 22 ms 2892 KB Output is correct
43 Correct 23 ms 2928 KB Output is correct
44 Correct 23 ms 3332 KB Output is correct
45 Correct 22 ms 2696 KB Output is correct
46 Correct 28 ms 2928 KB Output is correct
47 Correct 24 ms 3096 KB Output is correct
48 Correct 21 ms 2864 KB Output is correct
49 Correct 28 ms 2812 KB Output is correct
50 Correct 31 ms 2860 KB Output is correct
51 Correct 24 ms 2864 KB Output is correct
52 Correct 26 ms 3092 KB Output is correct
53 Correct 4 ms 2044 KB Output is correct
54 Correct 24 ms 3092 KB Output is correct
55 Correct 22 ms 2812 KB Output is correct
56 Correct 23 ms 3380 KB Output is correct
57 Correct 21 ms 2884 KB Output is correct
58 Correct 27 ms 2628 KB Output is correct
59 Correct 28 ms 2688 KB Output is correct
60 Correct 23 ms 2916 KB Output is correct
61 Correct 3 ms 2040 KB Output is correct
62 Correct 4 ms 2044 KB Output is correct
63 Correct 3 ms 2044 KB Output is correct
64 Correct 4 ms 2044 KB Output is correct
65 Correct 1 ms 2024 KB Output is correct
66 Correct 3 ms 2460 KB Output is correct
67 Correct 3 ms 2284 KB Output is correct
68 Correct 3 ms 2020 KB Output is correct
69 Correct 3 ms 2024 KB Output is correct
70 Correct 2 ms 2032 KB Output is correct
71 Correct 25 ms 3216 KB Output is correct
72 Correct 3 ms 2288 KB Output is correct
73 Correct 25 ms 2684 KB Output is correct
74 Correct 26 ms 2216 KB Output is correct
75 Correct 4 ms 2032 KB Output is correct
76 Correct 22 ms 2420 KB Output is correct
77 Correct 29 ms 3044 KB Output is correct
78 Correct 3 ms 2280 KB Output is correct
79 Correct 12 ms 2804 KB Output is correct
80 Correct 21 ms 2784 KB Output is correct
81 Correct 26 ms 2872 KB Output is correct
82 Correct 23 ms 3312 KB Output is correct
83 Correct 4 ms 2024 KB Output is correct
84 Correct 21 ms 3040 KB Output is correct
85 Correct 25 ms 2936 KB Output is correct
86 Correct 3 ms 2272 KB Output is correct
87 Correct 1 ms 2268 KB Output is correct
88 Correct 3 ms 2276 KB Output is correct
89 Correct 3 ms 2272 KB Output is correct
90 Correct 3 ms 2016 KB Output is correct
91 Correct 3 ms 2016 KB Output is correct
92 Correct 4 ms 2028 KB Output is correct
93 Correct 3 ms 2028 KB Output is correct
94 Correct 3 ms 2028 KB Output is correct
95 Correct 4 ms 2268 KB Output is correct
96 Correct 3 ms 2236 KB Output is correct
97 Correct 3 ms 2020 KB Output is correct