# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
723046 | nihaddhuseynli | Wiring (IOI17_wiring) | C++14 | 149 ms | 262144 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 "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,ans1=INT_MAX;
long long int dp[n+1][m+1];
for(int i =0;i<=n;i++)
{
for(int j =0;j<=m;j++)
{
dp[i][j]=INT_MAX;
}
}
for(int i =0;i<n;i++)
{
for(int j =0;j<m;j++)
{
if(i==0)
{
if(j==0)
{
dp[i][j]=0;;
}
else {
dp[i][j]=dp[i][j-1];
}
}
else {
dp[i][j] = dp[i-1][j];
if (j>0){
dp[i][j] = min({dp[i][j],dp[i][j-1],dp[i-1][j-1]});
}
}
if(dp[i][j]!=INT_MAX)
{
dp[i][j]+=abs(r[i]-b[j]);
}
}
}
return dp[n-1][m-1];
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |