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>
#define ll long long
const ll INF = LLONG_MAX - 1e17;
using namespace std;
vector<int> r;
vector<int> b;
ll dp[500][500];
ll solve(int i,int j){
if(i==0 && j==0)return abs(r[0]-b[0]);
else if(i<0 || j<0)return INF;
if(dp[i][j]!=0)return dp[i][j];
if(abs(i-j)>14)return INF;
dp[i][j] = min(solve(i-1,j),min(solve(i,j-1),solve(i-1,j-1))) + abs(r[i]-b[j]);
return dp[i][j];
}
long long min_total_length(std::vector<int> R, std::vector<int> B){
r=R,b=B;
//subtask 1
return solve(R.size()-1,B.size()-1);
//subtask 2
// ll ans = 0;
// for(int x:R)
// ans += abs(x-R[R.size()-1]);
// for(int x:B)
// ans += abs(x-B[0]);
// ans += max(R.size(),B.size())*abs(R[R.size()-1]-B[0]);
// 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... |