oj.uz

Submission #949205

# Submission time Handle Problem Language Result Execution time Memory
949205 2024-03-19T03:43:04 Z steveonalex Gap (APIO16_gap) C++14
30 / 100
 39 ms 4092 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());
    }

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{
    void dnc(ll l, ll r, ll &ans){ 
        if (r - l + 1 <= ans) return;
        ll L, R;
        ll mid = (l + r) >> 1;
        MinMax(l, mid, &L, &R);
        if (R == -1) return;
        ll x = R;

        MinMax(mid + 1, r, &L, &R);
        if (L == -1) return;
        ll y = L;
        maximize(ans, y - x);

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

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

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


//     return 0;
// }

Compilation message

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

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 0 ms 2392 KB Output is correct
4 Correct 0 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 0 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 2852 KB Output is correct
17 Correct 10 ms 2844 KB Output is correct
18 Correct 10 ms 2904 KB Output is correct
19 Correct 12 ms 2844 KB Output is correct
20 Correct 8 ms 2840 KB Output is correct
21 Correct 36 ms 3980 KB Output is correct
22 Correct 32 ms 3988 KB Output is correct
23 Correct 32 ms 3820 KB Output is correct
24 Correct 33 ms 4004 KB Output is correct
25 Correct 29 ms 3992 KB Output is correct
26 Correct 32 ms 3992 KB Output is correct
27 Correct 39 ms 4092 KB Output is correct
28 Correct 37 ms 3992 KB Output is correct
29 Correct 32 ms 3880 KB Output is correct
30 Correct 35 ms 3948 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 2392 KB Partially correct
2 Partially correct 1 ms 2644 KB Partially correct
3 Partially correct 1 ms 2392 KB Partially correct
4 Partially correct 1 ms 2392 KB Partially correct
5 Incorrect 1 ms 2392 KB Output isn't correct
6 Partially correct 1 ms 2392 KB Partially correct
7 Partially correct 1 ms 2392 KB Partially correct
8 Partially correct 1 ms 2392 KB Partially correct
9 Partially correct 1 ms 2392 KB Partially correct
10 Incorrect 1 ms 2392 KB Output isn't 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 Incorrect 1 ms 2392 KB Output isn't correct
16 Partially correct 7 ms 2592 KB Partially correct
17 Partially correct 9 ms 2580 KB Partially correct
18 Partially correct 7 ms 2844 KB Partially correct
19 Partially correct 7 ms 2584 KB Partially correct
20 Incorrect 2 ms 2576 KB Output isn't correct
21 Partially correct 28 ms 2864 KB Partially correct
22 Partially correct 26 ms 2848 KB Partially correct
23 Partially correct 33 ms 2828 KB Partially correct
24 Partially correct 23 ms 2856 KB Partially correct
25 Incorrect 14 ms 2852 KB Output isn't correct
26 Partially correct 25 ms 2844 KB Partially correct
27 Partially correct 26 ms 2860 KB Partially correct
28 Partially correct 27 ms 2860 KB Partially correct
29 Partially correct 30 ms 2844 KB Partially correct
30 Incorrect 12 ms 2852 KB Output isn't correct
31 Partially correct 0 ms 2392 KB Partially correct
32 Correct 1 ms 2392 KB Output is correct