# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
492598 | ToroTN | Watching (JOI13_watching) | C++14 | 910 ms | 16524 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;
int n,p,q,a,st,md,ed,dp[2005][2005],val,idx,st1,st2,type;
vector<int> small[2005],large[2005],v;
int main()
{
scanf("%d%d%d",&n,&p,&q);
for(int i=1;i<=n;i++)
{
scanf("%d",&a);
v.push_back(a);
}
sort(v.begin(),v.end());
st=1;
ed=1e9;
while(ed>=st)
{
md=(st+ed)/2;
//printf("%d %d %d\n",st,md,ed);
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
dp[i][j]=1e9;
}
}
md=(st+ed)/2;
for(int i=0;i<v.size()-1;i++)
{
val=v[i+1]+md-1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |