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>
using namespace std;
const int MN=200+10;
long long dp[MN][MN];
long long min_total_length(std::vector<int> r, std::vector<int> b) {
int n=r.size(),m=b.size();
long long ans=0;
if(r[n-1]<b[0]){
for(int i=0;i<n;i++){
ans+=r[n-1]-r[i];
}
for(int i=0;i<m;i++){
ans+=b[i]-b[0];
}
ans+=1ll*max(n,m)*(b[0]-r[n-1]);
}
else{
for(int i=0;i<n;i++){
ans+=r[i]-r[0];
}
for(int i=0;i<m;i++){
ans+=b[m-1]-b[i];
}
ans+=1ll*max(n,m)*(r[0]-b[m-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... |