oj.uz

답안 #77434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
77434 2018-09-27T20:02:34 Z Vardanyan 구경하기 (JOI13_watching) C++14
0 / 100
 176 ms 64128 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 201;
int a[N];
int mxshort[N];
int mxlong[N];
int dp[N][N][N];
int main(){
    int n,p,q;
    scanf("%d%d%d",&n,&p,&q);
    for(int i = 1;i<=n;i++) scanf("%d",&a[i]);
    sort(a+1,a+1+n);
    int l = 1;
    int r = 1000*1000*1000;
    int ans = r;
    while(l<=r){
        int m = (l+r)/2;
        /*if(m == 1){
            cout<<0<<endl;
        }*/
        memset(mxlong,0,sizeof(mxlong));
        memset(mxshort,0,sizeof(mxshort));
        memset(dp,0,sizeof(dp));
        int now = n;
        int noww = n;
        for(int i = n;i>=1;i--){
            while(!(abs(a[i]-a[now])+1<=m)) now--;
            mxshort[i] = now;
            while(!(abs(a[i]-a[noww])+1<=2*m)) noww--;
            mxlong[i] = noww;
        }
        bool f = false;
        for(int i = 1;i<=n;i++){
            for(int j = 0;j<=min(100,p);j++){
                for(int k = 0;k<=min(100,q);k++){
                    if(i == 1 || dp[i][j][k]){
                        if(i == n && (j<p || k<q)){
                            f = true;
                            break;
                        }
                        dp[min(n,mxshort[i]+1)][j+1][k] = dp[min(n,mxlong[i]+1)][j][k+1] = 1;
                    }
                }
                if(f) break;
            }
            if(f) break;
        }
        if(f){
            ans = m;
            r = m-1;
        }
        else l = m+1;
    }
    cout<<ans-1<<endl;
    return 0;
}

Compilation message

watching.cpp: In function 'int main()':
watching.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&n,&p,&q);
     ~~~~~^~~~~~~~~~~~~~~~~~~
watching.cpp:11:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1;i<=n;i++) scanf("%d",&a[i]);
                             ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 176 ms 32140 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 65 ms 64128 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -