이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define append push_back
#define add insert
#define nl '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(),(x).end()
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define terminator main
#define MAXN 201
ll dp[MAXN][MAXN];
ll min_total_length(vector<int> r,vector<int> b){
ll n,m,o;
n=r.size();
m=b.size();
for(ll i=0;i<=n;i++)
for(ll j=0;j<=m;j++)
dp[i][j]=1e18;
dp[0][0]=0;
for(ll i=1;i<=n;i++){
for(ll j=1;j<=m;j++){
o=0;
for(ll k=1;k<=j;k++){
o+=abs(r[i-1]-b[j-k]);
dp[i][j]=min(dp[i][j],dp[i-1][j-k]+o);
}
o=0;
for(ll k=1;k<=i;k++){
o+=abs(r[i-k]-b[j-1]);
dp[i][j]=min(dp[i][j],dp[i-k][j-1]+o);
}
}
}
return dp[n][m];
}
# | 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... |