Submission #47928

#TimeUsernameProblemLanguageResultExecution timeMemory
47928khohkoGap (APIO16_gap)C++17
0 / 100
86 ms16780 KiB
#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)
{
    vector<ll> v;
    ll k,p;
    MinMax(0,1e18,&k,&p);
    v.pb(k);
    v.pb(p);
    ll l=k+1,r=p-1;
    ll t=(r-l)/n;
    t=max(t,1ll);
    for(ll i=l; i<=r; i+=t){
        MinMax(i,min(r,i+t-1),&k,&p);
        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;
}

Compilation message (stderr)

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:43:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1; i<v.size(); i++){
                  ~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...