# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
83689 | Bodo171 | Watching (JOI13_watching) | C++14 | 211 ms | 16336 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 <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const int nmax=2005;
int dp[nmax][nmax];
int v[nmax];
int n,p,q,i,j,p1,p2,val;
bool check(int val)
{
for(i=1;i<=n;i++)
for(j=0;j<=p;j++)
dp[i][j]=q+1;
p1=p2=1;
for(i=1;i<=n;i++)
{
while(v[i]-v[p1]+1>val)
p1++;
while(v[i]-v[p2]+1>2*val)
p2++;
for(j=1;j<=p;j++)
dp[i][j]=min(dp[p1-1][j-1],dp[p2-1][j]+1);
dp[i][0]=dp[p2-1][0]+1;
}
for(i=0;i<=p;i++)
if(dp[n][i]<=q)
return 1;
return 0;
}
int main()
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |