Submission #949165

#	Time	Username	Problem	Language	Result	Execution time	Memory
949165		steveonalex	Gap (APIO16_gap)	C++14	30 / 100	35 ms	4008 KiB

gap

#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;
    }
}

ll findGap(int T, int N){
    return Sub1::solve(N);
}


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


//     return 0;
// }

Compilation message (stderr)

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 / 30
• Subtask 2: 0 / 70