Submission #590904

#	Time	Username	Problem	Language	Result	Execution time	Memory
590904		MasterTaster	Gap (APIO16_gap)	C++14	30 / 100	3086 ms	1732 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
 
#define pb push_back
#define ll long long
#define pii pair<int, int>
#define xx first
#define yy second
#define MAXN 100010
 
using namespace std;
 
vector<int> svi;
 
long long findGap(int t, int n)
{
    if (t==1)
    {
        ll minn, maxx;
        MinMax(0LL, 1000000000000000000LL, &minn, &maxx);

        if (n==2) { return maxx-minn; }

        int i=1; int j=n-2;

        ll ress=0;
        while (i<=j)
        {
            ll staromin=minn, staromax=maxx;
            MinMax(minn+1, maxx-1, &minn, &maxx);

            if (j-i==1) { ress=max(ress, maxx-minn); }

            ress=max(ress, max(minn-staromin, staromax-maxx));

            i++; j--;
        }
        return ress;
    }
    else
    {
        ll minn, maxx;
        MinMax(0LL, 1000000000000000000LL, &minn, &maxx);
        int skok=(maxx-minn+n-2)/(n-1);

        //cout<<minn<<" "<<maxx<<" "<<skok<<endl;
        for (int i=minn; i<maxx; i+=skok)
        {
            ll a, b;
            MinMax(i, min(maxx-1, (ll)i+skok-1), &a, &b);
            //cout<<endl<<i<<" "<<min(maxx, (ll)i+skok-1)<<" "<<a<<" "<<b<<endl;
            if (a==-1) { continue; }
            else if (a!=b) { /*cout<<a<<" "<<b<<endl;*/ svi.pb(a); svi.pb(b); }
            else { /*cout<<a<<endl;*/ svi.pb(a); }
        }

        ll ress=skok;
        for (int i=0; i<svi.size()-1; i++) ress=max(ress, (ll)(svi[i+1]-svi[i]));
        ress=max(ress, maxx-svi[svi.size()-1]);
        return ress;
    }
}

Compilation message (stderr)

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:58:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         for (int i=0; i<svi.size()-1; i++) ress=max(ress, (ll)(svi[i+1]-svi[i]));
      |                       ~^~~~~~~~~~~~~

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