# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
661502 | sofija6 | Watching (JOI13_watching) | C++14 | 843 ms | 63352 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>
#define ll long long
#define MAXN 2010
using namespace std;
ll a[MAXN],n,p,q;
pair<ll,ll> dp[MAXN][MAXN];
ll Last(ll pos)
{
ll l=1,r=n,mid,ans;
while (l<=r)
{
mid=(l+r)/2;
if (a[mid]<=pos)
{
ans=mid;
l=mid+1;
}
else
r=mid-1;
}
return ans;
}
bool Check(ll w)
{
for (ll i=0;i<=n+1;i++)
{
for (ll j=0;j<=min(n,p);j++)
dp[i][j]={0,LLONG_MAX};
}
dp[1][0]={1,0};
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |