Submission #1139746

#TimeUsernameProblemLanguageResultExecution timeMemory
1139746octa_bosSwimming competition (LMIO18_plaukimo_varzybos)C++17
0 / 100
0 ms324 KiB
#include <iostream>
#include <algorithm>
using namespace std;
int v[1000005];
int n,a,b,ok,lungime,ans=0;
bool sepoate(int n)
{
    if(n%b==0)
    {
        if(n/a>=n/b)
        {
            return 1;
        return 0;
        }
        else
        {
            if(n/a>=n/b+1)
                return 1;
            return 0;
        }
    }
}
bool mergeoare(int x)
{
    ok=0,lungime=1;
    for(int i=2;i<=n;i++)
    {
        
        if(v[i]-v[i-1]<=x&&lungime+1<=b&&sepoate(n-i)==1)
            lungime++;
            else
            {
                if(lungime<a)
                {
                    ok=1;
                    break;
                }
                else lungime=1;
            }

    }
     if(lungime<a)
        ok=1;
    return ok;
}
int main()
{

    cin>>n>>a>>b;
    for(int i=1;i<=n;i++)
        cin>>v[i];
        sort(v+1,v+n+1);
        int ras=0;

    int st=0,dr=v[n]-v[1],mij;
    while(st<dr)
    {
        mij=(st+dr)/2;
        if(mergeoare(mij)==0)
        {
            ans=mij;
            dr=mij-1;

        }
        else
            st=mij+1;

    }
    cout<<ans;
    return 0;
}

Compilation message (stderr)

plaukimo_varzybos.cpp: In function 'bool sepoate(int)':
plaukimo_varzybos.cpp:22:1: warning: control reaches end of non-void function [-Wreturn-type]
   22 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...