Submission #23295

#	Time	Username	Problem	Language	Result	Execution time	Memory
23295		repeating	Gap (APIO16_gap)	C++11	0 / 100	76 ms	6772 KiB

gap

#include <bits/stdc++.h>
#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define pll pair<ll,ll>
#define SF(x) scanf("%I64d",&x)

using namespace std;
const long long INF = 2e9;
long long MOD = 1e9+7;
void MinMax(ll ,ll ,ll *,ll *);
long long findGap(int ,int );
long long findGap(int t,int n){
    ll l=-1,r=1e18;
    r++;
    vector<ll> v;
    W(l+1<r){
        MinMax(l+1,r-1,&l,&r);
        if(l!=-1)v.pb(l);
        if(r!=-1&&r!=l)v.pb(r);
    }
    sort(v.begin(),v.end());
    ll res=0;
    for(int i=1;i<v.SI;i++){
        res=max(res,v[i]-v[i-1]);
    }
    R res;
}
//int main(){
//    cout<<findGap(1,1);
//}
//void MinMax(ll s,ll t,ll *mn,ll *mx){
//    cout<<s<<" "<<t<<endl;
//    cin>>*mn>>*mx;
//}

Compilation message (stderr)

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:31:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1;i<v.SI;i++){
                  ^

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