This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//by szh
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}
#include "wiring.h"
const int maxn = 222;
ll dp[maxn][maxn];
long long min_total_length(std::vector<int> r, std::vector<int> b) {
memset(dp,inf,sizeof(dp));
ll tmp = dp[0][0];
if (SZ(r)<SZ(b)) swap(r,b);
rep(i,0,SZ(r))
rep(j,0,min(SZ(b),i+1)) {
if (i==0) dp[i][j] = 0;
else {
dp[i][j] = dp[i-1][j];
if (j>=0) dp[i][j] = min(dp[i][j],min(dp[i][j-1],dp[i-1][j-1]));
}
if (dp[i][j]!=tmp) dp[i][j] += abs(r[i]-b[j]);
}
return dp[SZ(r)-1][SZ(b)-1];
}
# | 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... |