제출 #1207533

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1207533		liza	구경하기 (JOI13_watching)	C++20	100 / 100	751 ms	16192 KiB

watching

#include <bits/stdc++.h>

using namespace std;
/*
5 1 1
2 2 2 2 2
*/
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, p, q;
    cin >> n >> p >> q;
    vector<int> v(n);
    for(int i =0; i < n; i++) cin >> v[i];
    sort(v.begin(), v.end());
    //for(int i =0; i < n; i++) cout << v[i];
    int l = 1, r = 1e9;
    int rez=1e9;
    while(l<r)
    {
        int m = l+(r-l)/2;
        int dp[n+6][n+6];
        dp[0][0]=0;
        if(p > 0)
            dp[1][0]=v[0]+m-1;
        if(q > 0)
            dp[0][1]=v[0]+2*m-1;
        int c =0;
        for(int j = 2; j <= min(q, n+5); j++)
        {
             auto y = upper_bound(v.begin(), v.end(), dp[0][j-1]);
             if(y==v.end())
                {
                    rez=min(rez, m);
                    r=m;
                    c=1;
                    break;
                }
             dp[0][j]=*y+2*m-1;
        }
        if(c)continue;
        for(int i = 2; i <= min(p,n+5); i++)
        {
            auto x = upper_bound(v.begin(), v.end(), dp[i-1][0]);
             if(x==v.end())
                {
                    rez=min(rez, m);
                    r=m;
                    c=1;
                    break;
                }
                dp[i][0]=*x+m-1;
        }
        if(c)continue;
        for(int i = 1; i <= min(p, n+5); i++)
        {
            for(int j = 1; j <= min(q, n+5); j++)
            {
                auto x = upper_bound(v.begin(), v.end(), dp[i-1][j]);
                auto y = upper_bound(v.begin(), v.end(), dp[i][j-1]);

                if(x==v.end()|| y==v.end())
                {
                    rez=min(rez, m);
                    r=m;
                    c=1;
                    break;
                }
                dp[i][j]=max(*x+m-1, *y+2*m-1);
            }
            if(c)break;
        }
        if(c)continue;
        if(dp[ min(p, n+5)][min(q, n+5)]>= v[v.size()-1])
        {
            rez=min(rez, m);
            r=m;
        }
        else
        {
            l=m+1;
        }

    }
    rez=min(l, rez);
    cout << rez << "\n";



    return 0;
}

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