oj.uz

답안 #13362

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
13362 2015-02-13T17:06:26 Z gs14004 구경하기 (JOI13_watching) C++14
100 / 100
 721 ms 16812 KB 
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

int n,p,q,a[2005];
int nxt[2005], nxt2[2005];

int dp[2005][2005];

bool trial(int x){
    for (int i=0; i<n; i++) {
        nxt[i] = (int)(lower_bound(a,a+n,a[i]+x) - a);
        nxt2[i] = (int)(lower_bound(a,a+n,a[i]+2*x) - a);
    }
    nxt[n] = nxt2[n] = n;
    for (int i=p; i>=0; i--) {
        for (int j=q; j>=0; j--) {
            if(i == p && j == q) continue;
            int ret = 0;
            if(i != p) ret = max(ret,nxt[dp[i+1][j]]);
            if(j != q) ret = max(ret,nxt2[dp[i][j+1]]);
            dp[i][j] = ret;
        }
    }
    return dp[0][0] >= n;
}

int main(){
    scanf("%d %d %d",&n,&p,&q);
    for (int i=0; i<n; i++) {
        scanf("%d",&a[i]);
    }
    p = min(p,n);
    q = min(q,n);
    sort(a,a+n);
    int s = 0, e = 5e8;
    while (s != e) {
        int m = (s+e)/2;
        if(trial(m)) e = m;
        else s = m+1;
    }
    printf("%d",s);
}

Subtask #1
50.0 / 50.0

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

Subtask #2
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 16812 KB Output is correct
2 Correct 0 ms 16812 KB Output is correct
3 Correct 411 ms 16812 KB Output is correct
4 Correct 37 ms 16812 KB Output is correct
5 Correct 35 ms 16812 KB Output is correct
6 Correct 721 ms 16812 KB Output is correct
7 Correct 5 ms 16812 KB Output is correct
8 Correct 24 ms 16812 KB Output is correct
9 Correct 21 ms 16812 KB Output is correct
10 Correct 39 ms 16812 KB Output is correct
11 Correct 34 ms 16812 KB Output is correct
12 Correct 176 ms 16812 KB Output is correct
13 Correct 8 ms 16812 KB Output is correct
14 Correct 8 ms 16812 KB Output is correct
15 Correct 6 ms 16812 KB Output is correct