Submission #47957

#	Time	Username	Problem	Language	Result	Execution time	Memory
47957		khohko	Gap (APIO16_gap)	C++17	100 / 100	80 ms	3552 KiB

gap

#include <bits/stdc++.h>
//#include "grader.cpp"
#include "gap.h"

#pragma GCC optimize("O3")
using namespace std;
#define ll long long
#define lol long long
#define pb push_back
//#define mp make_pair
#define fr first
#define sc second
#define MAX ((lol)(1e15+100))
#define MX ((lol)(4e9+100))
#define ARRS ((lol)(1e6+100))
#define MOD ((lol)(1e9+7))
#define EP ((double)(1e-9))
#define EPS ((double)(1e-8))
#define pb push_back
#define PI ((double)3.141592653)
#define LG 21




long long findGap(int T, int n)
{
    if(T==2){
        vector<ll> v;
        ll k,p;
        MinMax(0,1e18,&k,&p);

        v.pb(k);
        v.pb(p);

        if(n>2){
            ll l=k+1,r=p-1;
            ll t=(r-l+n)/(n-1);
            t=max(t,1ll);
            for(ll i=l; i<=r; i+=t){
                MinMax(i,min(r,i+t-1),&k,&p);
                if(k<0)continue;
                v.pb(k);
                v.pb(p);
            }
        }

        sort(v.begin(),v.end());
        ll pas=0;
        for(int i=1; i<v.size(); i++)
            pas=max(pas,v[i]-v[i-1]);
        return pas;
    }
    else {
        vector<ll> v;
        ll k,p;
        ll l=0,r=1e18;
        while(n>0){
            if(l>r)break;
            MinMax(l,r,&k,&p);
            if(k<0)break;
            v.pb(k);
            v.pb(p);
            l=k+1ll;
            r=p-1ll;
            n-=2ll;
        }

        sort(v.begin(),v.end());
        ll pas=0;
        for(int i=1; i<v.size(); i++)
            pas=max(pas,v[i]-v[i-1]);
        return pas;

    }
}

Compilation message (stderr)

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:50:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=1; i<v.size(); i++)
                      ~^~~~~~~~~
gap.cpp:71:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=1; i<v.size(); i++)
                      ~^~~~~~~~~

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