# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1129 | gs12117 | Watching (JOI13_watching) | C++98 | 105 ms | 16692 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<stdio.h>
int n,p,q;
int a[2010];
int sc[2010];
int lc[2010];
int dp[2010][2010];
int f(long long int x){
if(x<1)return 0;
int i,j;
j=0;
for(i=0;i<n;i++){
while(j<n&&a[j]-a[i]<x)j++;
sc[i]=j;
}
sc[n]=n;
j=0;
for(i=0;i<n;i++){
while(j<n&&a[j]-a[i]<x*2)j++;
lc[i]=j;
}
lc[n]=n;
for(i=0;i<=p;i++){
for(j=0;j<=q;j++){
dp[i][j]=-1;
}
}
dp[0][0]=0;
for(i=0;i<=p;i++){
for(j=0;j<=q;j++){
if(dp[i+1][j]<sc[dp[i][j]]){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |