oj.uz

답안 #329978

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
329978 2020-11-23T10:23:01 Z Sho10 구경하기 (JOI13_watching) C++14
50 / 100
 260 ms 159724 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod (10*10*10*10*10*10*10*10*10+7)
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int n,p,q,a[2005],dp[2005][10005];
int check(int x){
int l=1,r=1;
for(int i=1;i<=n;i++)
{
    while(a[l]<a[i]-x+1){
        l++;
    }
    while(a[r]<a[i]-2*x+1){
        r++;
    }
    for(int j=0;j<=p;j++)
    {
        dp[i][j]=INF;
        if(j){
            dp[i][j]=dp[l-1][j-1];
        }
        dp[i][j]=min(dp[r-1][j]+1,dp[i][j]);
    }
}
return (dp[n][p]<=q);
}
int32_t main(){
CODE_START;
cin>>n>>p>>q;
for(int i=1;i<=n;i++)
{
    cin>>a[i];
}
sort(a+1,a+n+1);
int l=1,r=1e9,res=0;
while(l<=r){
    int mid=(l+r)/2;
    if(check(mid)){
        res=mid;
        r=mid-1;
    }else l=mid+1;
}
cout<<res<<endl;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 175 ms 4716 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 165 ms 4716 KB Output is correct
7 Correct 1 ms 748 KB Output is correct
8 Correct 1 ms 748 KB Output is correct
9 Correct 1 ms 748 KB Output is correct
10 Correct 1 ms 748 KB Output is correct
11 Correct 1 ms 748 KB Output is correct
12 Correct 1 ms 748 KB Output is correct
13 Correct 1 ms 748 KB Output is correct
14 Correct 1 ms 748 KB Output is correct
15 Correct 1 ms 748 KB Output is correct

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8556 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 82 ms 20204 KB Output is correct
4 Runtime error 260 ms 159724 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -