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 "wiring.h"
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
long long min_total_length(std::vector<int> r, std::vector<int> b) {
ll n=r.size();
ll m=b.size();
ll ans=0;
ll dp[n+1][m+1];
if(n<=200 && m<=200)
{
memset(dp,0,sizeof(dp));
for(int i =0;i<n;i++)
{
for(int j =0;j<m;j++)
{
dp[i][j]=min({dp[i-1][j],dp[i][j-1],dp[i-1][j-1]})+abs(r[i]-b[j]);
}
}
ans = dp[n-1][m-1];
}
else
{
for(ll i =0;i<n;i++)
{
ans+=(ll)(r[n-1]-r[i]);
}
for(ll i =0;i<m;i++)
{
ans+=(ll)(b[i]-b[0]);
}
ans+=((max(ll(n),(ll)m))*(ll)(b[0]-r[n-1]));
}
return ans;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |