# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
359099 | shahriarkhan | Watching (JOI13_watching) | C++14 | 1083 ms | 8812 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std ;
const int mx = 2005 ;
int a[mx] , dp[mx][mx] , n , p , q ;
set<pair<int,int> > s ;
int check(int w)
{
for(int i = 0 ; i <= p ; ++i)
{
for(int j = 0 ; j <= q ; ++j)
{
dp[i][j] = 0 ;
}
}
for(int i = 0 ; i <= p ; ++i)
{
for(int j = 0 ; j <= q ; ++j)
{
if(i)
{
pair<int,int> cur = *(--s.lower_bound({a[dp[i-1][j]+1]+w,0})) ;
dp[i][j] = max(dp[i][j],cur.second) ;
}
if(j)
{
pair<int,int> cur = *(--s.lower_bound({a[dp[i][j-1]+1]+w+w,0})) ;
dp[i][j] = max(dp[i][j],cur.second) ;
}
if(dp[i][j]==n) return 1 ;
}
}
return 0 ;
}
int main()
{
scanf("%d%d%d",&n,&p,&q) ;
for(int i = 1 ; i <= n ; ++i) scanf("%d",&a[i]) ;
if((p+q)>=n)
{
puts("1") ;
return 0 ;
}
sort(a+1,a+n+1) ;
for(int i = 1 ; i <= n ; ++i) s.insert({a[i],i}) ;
int low = 0 , high = a[n] ;
while(low<high)
{
int mid = (low+high)/2 ;
if(check(mid)) high = mid ;
else low = mid + 1 ;
}
printf("%d\n",low) ;
return 0 ;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |