oj.uz

답안 #170662

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
170662 2019-12-26T02:39:10 Z mdn2002 구경하기 (JOI13_watching) C++14
0 / 100
 613 ms 33400 KB 
#include<bits/stdc++.h>
using namespace std;
const long long mod=998244353;
long long n,a,b,sum,c[2003],dp[2050][2050];
long long f(int x,int y,long long z)
{
    if(y>a)return 1e12;
    if(x==n)return 0;
    if(dp[x][y]!=-1)return dp[x][y];
    long long mx=1e12;
    for(int i=x;i<n;i++)
    {
        if(c[i]-c[x]+1>z*2)break;
        if(c[i]-c[x]+1<=z)mx=min(mx,f(i+1,y+1,z));
        else mx=min(mx,f(i+1,y,z)+1);
    }
    return dp[x][y]=mx;
}
bool ck(int x)
{
    memset(dp,-1,sizeof dp);
    if(f(0,0,x)<=b)return 1;
    else return 0;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
    cin>>n>>a>>b;
    for(int i=0;i<n;i++)cin>>c[i];
    long long l=1,r=1e9+1,mid;
    sort(c,c+n);
    while(l<r)
    {
        mid=(l+r)/2;
        if(ck(mid))r=mid;
        else l=mid+1;
    }
    cout<<l;
}

Subtask #1
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 33272 KB Output is correct
2 Correct 155 ms 33400 KB Output is correct
3 Correct 153 ms 33276 KB Output is correct
4 Correct 176 ms 33400 KB Output is correct
5 Incorrect 172 ms 33272 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 613 ms 33388 KB Output is correct
2 Incorrect 175 ms 33272 KB Output isn't correct
3 Halted 0 ms 0 KB -