제출 #288256

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
288256		MasterTaster	구경하기 (JOI13_watching)	C++14	100 / 100	81 ms	8704 KiB

watching

#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define pii pair<int, int>
#define xx first
#define yy second
#define endl "\n"

int n, p, q;
vector<int> arr;
//bool dp[110][110][110];
int dp[2010][2010];
int kolikoMala[2010], kolikoVelika[2010];

int prviManji(int x)
{
    //cout<<endl<<x<<" e "<<arr[0]<<endl;
    if (x<=arr[0]) return 0;
    auto it=lower_bound(arr.begin(), arr.end(), x);

    //cout<<endl<<arr[distance(arr.begin()-1, it)]<<" koji"<<endl;
    return distance(arr.begin(), it)-1;
}

bool check(int w)
{
    for (int i=0; i<n; i++)
    {
        auto it1=upper_bound(arr.begin(), arr.end(), arr[i]+w-1);
        if (it1==arr.end()) { /*cout<<"ee"<<endl;*/ kolikoMala[i]=n-i; }
        else kolikoMala[i]=(distance(arr.begin(), it1)-i);

        auto it2=upper_bound(arr.begin(), arr.end(), arr[i]+2*w-1);
        if (it2==arr.end()) { /*cout<<"ee"<<endl;*/ kolikoVelika[i]=n-i; }
        else kolikoVelika[i]=(distance(arr.begin(), it2)-i);

        //cout<<kolikoMala[i]<<" "<<kolikoVelika[i]<<endl;
    }

    for (int i=0; i<=p; i++)
    {
        for (int j=0; j<=q; j++)
        {
            dp[i][j]=-1;
            if (i==0 && j==0) { dp[i][j]=-1; continue; }
            if (i>0) dp[i][j]=max(dp[i][j], dp[i-1][j]+kolikoMala[dp[i-1][j]+1]);
            if (j>0) dp[i][j]=max(dp[i][j], dp[i][j-1]+kolikoVelika[dp[i][j-1]+1]);
            if (dp[i][j]>=n-1) { /*cout<<i<<" nasao "<<j<<" "<<dp[i][j]<<endl;*/ return true; }
        }
    }
    return false;
}

/*bool check(int w)
{
    for (int i=0; i<=p; i++) for (int j=0; j<=q; j++) dp[0][i][j]=true;
    dp[0][0][0]=false;

    for (int i=1; i<n; i++)
    {
        for (int j=0; j<=p; j++)
        {
            for (int k=0; k<=q; k++)
            {
                dp[i][j][k]=false;
                //cout<<i<<" "<<prviManji(arr[i]-w+1)<<" "<<prviManji(arr[i]-2*w+1)<<endl;
                if (j>0 && arr[i]-w+1<=arr[0]) dp[i][j][k]=true;
                else if (j>0) dp[i][j][k]=max(dp[i][j][k], dp[prviManji(arr[i]-w+1)][j-1][k]);
                if (k>0 && arr[i]-2*w+1<=arr[0]) dp[i][j][k]=true;
                else if (k>0) dp[i][j][k]=max(dp[i][j][k], dp[prviManji(arr[i]-2*w+1)][j][k-1]);
            }
        }
    }

    return dp[n-1][p][q];
}*/

int bs()
{
    int l=1, r=1000000000;
    int ress=-1;
    while (l<=r)
    {
        int mid=l+(r-l)/2;
        //cout<<mid<<":"<<endl;
        if (check(mid))
        {
            ress=mid;
            r=mid-1;
        }
        else l=mid+1;
    }
    return ress;
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    cin>>n>>p>>q;
    for (int i=0; i<n; i++)
    {
        int x; cin>>x; arr.pb(x);
    }
    sort(arr.begin(), arr.end());

    if (p+q>=n) { cout<<1; exit(0); }

    cout<<bs();
}

• Subtask 1: 50 / 50
• Subtask 2: 50 / 50