oj.uz

Submission #949229

# Submission time Handle Problem Language Result Execution time Memory
949229 2024-03-19T04:00:55 Z steveonalex Gap (APIO16_gap) C++14
83.5083 / 100
 52 ms 5180 KB 
#include <bits/stdc++.h>
#include "gap.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
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);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

// int n;
// vector<ll> a;

// void MinMax(ll l, ll r, ll *mn, ll *mx){
//     cout << "? " << l << " " << r << "\n";
//     ll idx1 = lower_bound(ALL(a), l) - a.begin();
//     ll idx2 = upper_bound(ALL(a), r) - a.begin() - 1;
//     if (idx1 > idx2){
//         *mn = -1;
//         *mx = -1;
//     }
//     *mn = a[idx1];
//     *mx = a[idx2];
// }

namespace Sub1{
    ll solve(int n){
        vector<ll> a;
        ll l = 0, r = 1e18;
        for(int i = 0; i<n; i += 2){
            ll L, R;
            MinMax(l, r, &L, &R);
            a.push_back(L); a.push_back(R);
            l = L + 1, r = R - 1;
        }
        sort(ALL(a));

        ll ans = 0;
        for(int i = 1; i<a.size(); ++i) maximize(ans, a[i] - a[i-1]);
        return ans;
    }
}

namespace Sub2{
    vector<pair<ll, ll>> a;
    ll cap = 0;
    void dnc(ll l, ll r){ 
        if (r - l <= cap){
            ll L, R;
            MinMax(l, r, &L, &R);
            if (L != -1) a.push_back({L, R});
            return;
        } 
        ll mid = (l + r) >> 1;

        dnc(l, mid);
        dnc(mid + 1, r);
    }

    ll solve(int n){
        a.clear();
        ll l = 0, r = 1e18;
        ll L, R;
        MinMax(l, r, &L, &R);
        l = L, r = R;
        cap = (r - l) / n;
        dnc(l, r);

        ll ans = 0;
        for(int i = 1; i<a.size(); ++i) maximize(ans, a[i].first - a[i-1].second);
        return ans;
    }
}

ll findGap(int T, int N){
    if (T == 1) return Sub1::solve(N);
    return Sub2::solve(N);
}


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

//     cin >> n;
//     a.resize(n);
//     for(int i= 0; i<n; ++i) cin >> a[i];

//     cout << findGap(2, n) << "\n";

//     return 0;
// }

Compilation message

gap.cpp: In function 'll Sub1::solve(int)':
gap.cpp:76:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |         for(int i = 1; i<a.size(); ++i) maximize(ans, a[i] - a[i-1]);
      |                        ~^~~~~~~~~
gap.cpp: In function 'll Sub2::solve(int)':
gap.cpp:107:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |         for(int i = 1; i<a.size(); ++i) maximize(ans, a[i].first - a[i-1].second);
      |                        ~^~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 8 ms 2844 KB Output is correct
17 Correct 8 ms 2844 KB Output is correct
18 Correct 8 ms 2844 KB Output is correct
19 Correct 8 ms 3008 KB Output is correct
20 Correct 7 ms 2832 KB Output is correct
21 Correct 35 ms 3984 KB Output is correct
22 Correct 37 ms 4032 KB Output is correct
23 Correct 32 ms 3996 KB Output is correct
24 Correct 32 ms 4004 KB Output is correct
25 Correct 29 ms 4004 KB Output is correct
26 Correct 31 ms 3996 KB Output is correct
27 Correct 32 ms 3992 KB Output is correct
28 Correct 32 ms 3996 KB Output is correct
29 Correct 32 ms 3984 KB Output is correct
30 Correct 28 ms 3940 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct

Subtask #2
53.5083487467 / 70.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 2392 KB Partially correct
2 Partially correct 0 ms 2392 KB Partially correct
3 Partially correct 0 ms 2392 KB Partially correct
4 Partially correct 1 ms 2392 KB Partially correct
5 Partially correct 0 ms 2392 KB Partially correct
6 Partially correct 0 ms 2392 KB Partially correct
7 Partially correct 0 ms 2392 KB Partially correct
8 Partially correct 1 ms 2392 KB Partially correct
9 Partially correct 1 ms 2392 KB Partially correct
10 Partially correct 0 ms 2392 KB Partially correct
11 Partially correct 2 ms 2392 KB Partially correct
12 Partially correct 2 ms 2392 KB Partially correct
13 Partially correct 1 ms 2392 KB Partially correct
14 Partially correct 1 ms 2392 KB Partially correct
15 Partially correct 1 ms 2392 KB Partially correct
16 Partially correct 12 ms 3184 KB Partially correct
17 Partially correct 13 ms 3220 KB Partially correct
18 Partially correct 12 ms 3220 KB Partially correct
19 Partially correct 12 ms 3392 KB Partially correct
20 Partially correct 7 ms 2580 KB Partially correct
21 Partially correct 51 ms 4944 KB Partially correct
22 Partially correct 51 ms 4944 KB Partially correct
23 Partially correct 50 ms 4996 KB Partially correct
24 Partially correct 51 ms 4952 KB Partially correct
25 Partially correct 48 ms 5016 KB Partially correct
26 Partially correct 51 ms 5012 KB Partially correct
27 Partially correct 49 ms 5180 KB Partially correct
28 Partially correct 49 ms 5004 KB Partially correct
29 Partially correct 52 ms 5000 KB Partially correct
30 Partially correct 31 ms 3108 KB Partially correct
31 Partially correct 1 ms 2392 KB Partially correct
32 Partially correct 0 ms 2392 KB Partially correct