Submission #307012

#	Time	Username	Problem	Language	Result	Execution time	Memory
307012		MarcoMeijer	Gap (APIO16_gap)	C++14	100 / 100	87 ms	2432 KiB

gap

#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }

//===================//
//   begin program   //
//===================//
 
const int MX = 1e5+2;

ll findGap(int T, int N) {
    vll a;
    ll lb=0, ub=1e18;
    if(T == 1 || N <= 6) {
        while(1) {
            ll mn, mx;
            MinMax(lb,ub,&mn,&mx);
            if(mn == -1) break;
            a.pb(mn);
            if(mx != mn) a.pb(mx);
            lb = mn+1, ub=mx-1;
            if(ub < lb) break;
            if(a.size() == N) break;
        }
        sort(all(a));
        ll ans = 0;
        RE(i,N-1) ans = max(ans, a[i+1]-a[i]);
        return ans;
    } else {
        MinMax(0,1e18,&lb,&ub);
        if(N == 2) return ub-lb;

        ll stepSize = (ub-lb-2)/(N-2);

        a.pb(lb); a.pb(ub);
        for(ll x=lb+1; x<ub; x+=stepSize+1) {
            ll mn, mx;
            MinMax(x,x+stepSize,&mn,&mx);
            if(mn == -1) continue;
            a.pb(mn);
            if(mn != mx) a.pb(mx);
        }

        sort(all(a));
        ll ans = 0;
        RE(i,a.size()-1) ans = max(ans, a[i+1]-a[i]);
        return ans;
    }
}

Compilation message (stderr)

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:65:25: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   65 |             if(a.size() == N) break;
      |                ~~~~~~~~~^~~~

• Subtask 1: 30 / 30
• Subtask 2: 70 / 70