답안 #743416

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
743416 2023-05-17T11:30:38 Z Valters07 구경하기 (JOI13_watching) C++14
100 / 100
526 ms 15952 KB
#include <bits/stdc++.h>
#define fio ios_base::sync_with_stdio(0);cin.tie(0);
#define en cin.close();return 0;
#define ll long long
#define pb push_back
#define fi first
#define se second
using namespace std;
const int N = 2e3+5;
int dp[N][N];// pos, c0 taken = min c1 taken
bool check(vector<int> &pos, int c0, int c1, int w)
{
    int n = pos.size()-1;
    int k1 = 1, k2 = 2;
    if(c0>c1)
        swap(c0,c1),
        swap(k1,k2);
    for(int j = 0;j<=c0;j++)
    {
        int it0 = 1, it1 = 1;
        for(int i = 1;i<=n;i++)
        {
            while(pos[i]-pos[it0]+1>w*k1)
                it0++;
            while(pos[i]-pos[it1]+1>w*k2)
                it1++;
            dp[i][j]=dp[it1-1][j]+1;
            if(j>0)
                dp[i][j]=min(dp[i][j],dp[it0-1][j-1]);
        }
    }
    int minc1 = 1e9;
    for(int i = 0;i<=c0;i++)
        minc1=min(minc1,dp[n][i]);
    return (minc1<=c1);
}
int main()
{
//    ifstream cin("in.in");
    int n, c0, c1;
    cin >> n >> c0 >> c1;
    if(n<=c0+c1)
        return cout << 1, 0;
    vector<int> pos(n+1);
    for(int i = 1;i<=n;i++)
        cin >> pos[i];
    sort(pos.begin()+1,pos.end());
    for(int i = 1;i<=n;i++)
        dp[0][i]=n;
    int l = 1, r = 1e9;
    while(l<r)
    {
        int mid = (l+r)/2;
        if(check(pos,c0,c1,mid))
            r=mid;
        else
            l=mid+1;
    }
    cout << l;
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8344 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 15 ms 8368 KB Output is correct
8 Correct 64 ms 9300 KB Output is correct
9 Correct 65 ms 9300 KB Output is correct
10 Correct 47 ms 9008 KB Output is correct
11 Correct 51 ms 8916 KB Output is correct
12 Correct 526 ms 15952 KB Output is correct
13 Correct 10 ms 8404 KB Output is correct
14 Correct 11 ms 8404 KB Output is correct
15 Correct 12 ms 8404 KB Output is correct