Submission #483899

#	Time	Username	Problem	Language	Result	Execution time	Memory
483899		beaconmc	Gap (APIO16_gap)	C++14	0 / 100	2866 ms	524292 KiB

gap

#include <bits/stdc++.h>
#include "gap.h"
typedef long long ll;
#define FOR(i, x, y) for(ll i=x; i<y; i++)

using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<ll, null_type,greater_equal<int>, rb_tree_tag,tree_order_statistics_node_update>

ll findGap(int t, int n){
    if (t==1){
        vector<ll> sussy;
        ll l=0; ll r=1e18;
        ll lc=0; ll rc=0;
        while (l!=r){
            MinMax(l,r,&lc,&rc);
            sussy.push_back(lc);
            sussy.push_back(rc);
            l = lc; r=rc;
        }
        sort(sussy.begin(), sussy.end());
        ll prv = sussy[0];
        ll maxi = 0;
        for (auto&i : sussy){
            maxi = max(maxi, i-prv);
            prv = i;
        }
         return maxi;
    }
    return 0;
    
}

/*
int main(){
}*/

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