# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
21048 | 2017-04-04T05:07:46 Z | sbansalcs | 구경하기 (JOI13_watching) | C++14 | 0 ms | 6540 KB |
#include <iostream> #include <algorithm> using namespace std; typedef long long ll; const int N = 105; ll arr[N]; int dp[N][N][N]; int n,p,q; bool check(ll w) { for (int i=n+1; i>=1; i--) { for (int j=0; j<=p; j++) { for (int k=0; k<=q; k++) { dp[i][j][k]=0; if(i==n+1) { dp[i][j][k]=1; } else { ll a; if(j!=0) { a=arr[i]+w; int lx=i+1,rx=n+1,mx; while (lx<rx) { mx= (lx+rx)/2; if(arr[mx]>=a) rx=mx; else lx=mx+1; } dp[i][j][k]|=dp[lx][j-1][k]; } if(k!=0 && !dp[i][j][k]) { a=arr[i]+2*w; int lx=i+1,rx=n+1,mx; while (lx<rx) { mx= (lx+rx)/2; if(arr[mx]>=a) rx=mx; else lx=mx+1; } dp[i][j][k]|=dp[lx][j][k-1]; } } } } } return dp[1][p][q]; } int main() { scanf("%d %d %d",&n,&p,&q); for (int i=1; i<=n; i++) { scanf("%lld",arr+i); } p+=2*q;q=0; if(p+q>=n) { cout<<1<<endl;return 0; } sort(arr+1,arr+1+n); arr[n+1]=2e9; int lx=1,rx=1e9,mx; while (lx<rx) { mx=(lx+rx)/2; if(check(mx)) rx=mx; else lx=mx+1; } cout<<lx<<endl; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 6540 KB | Output is correct |
2 | Correct | 0 ms | 6540 KB | Output is correct |
3 | Incorrect | 0 ms | 6540 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 0 ms | 6540 KB | Execution killed because of forbidden syscall futex (202) |
2 | Halted | 0 ms | 0 KB | - |