# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1139746 | octa_bos | Swimming competition (LMIO18_plaukimo_varzybos) | C++17 | 0 ms | 324 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;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |