# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
548487 | krit3379 | Collecting Stamps 3 (JOI20_ho_t3) | C++17 | 126 ms | 132852 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;
#define N 205
int x[N],rev[N],t[N],ans;
long long dp[2][N][N][N];
int main(){
int n,m,l,i,j,k;
scanf("%d %d",&n,&l);
for(i=1;i<=n;i++)scanf("%d",&x[i]),rev[n-i+1]=l-x[i];
for(i=1;i<=n;i++)scanf("%d",&t[i]);
for(i=0;i<=n+1;i++)for(j=0;j<=n+1;j++)for(k=0;k<=n+1;k++)dp[0][i][j][k]=dp[1][i][j][k]=1e18;
dp[1][0][0][0]=dp[0][0][0][0]=0;
//dp[][i][j][k] collect i stamp at j-th left and k-th right
//dp[0]->left dp[1]->right
for(i=0;i<=n;i++)for(j=0;j<=n;j++)for(k=0;k<=n;k++){
if(j+k>n)continue;
if(j)dp[0][i][j][k]=min({dp[0][i][j][k],dp[0][i][j-1][k]+rev[j]-rev[j-1],dp[1][i][j-1][k]+rev[j]+x[k]});
if(k)dp[1][i][j][k]=min({dp[1][i][j][k],dp[1][i][j][k-1]+x[k]-x[k-1],dp[0][i][j][k-1]+rev[j]+x[k]});
if(i&&j&&min(dp[0][i-1][j-1][k]+rev[j]-rev[j-1],dp[1][i-1][j-1][k]+rev[j]+x[k])<=t[n-j+1])dp[0][i][j][k]=min({dp[0][i][j][k],dp[0][i-1][j-1][k]+rev[j]-rev[j-1],dp[1][i-1][j-1][k]+rev[j]+x[k]});
if(i&&k&&min(dp[1][i-1][j][k-1]+x[k]-x[k-1],dp[0][i-1][j][k-1]+rev[j]+x[k])<=t[k])dp[1][i][j][k]=min({dp[1][i][j][k],dp[1][i-1][j][k-1]+x[k]-x[k-1],dp[0][i-1][j][k-1]+rev[j]+x[k]});
if(dp[0][i][j][k]<1e18||dp[1][i][j][k]<1e18)ans=max(ans,i);
}
printf("%d",ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |