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;
typedef long long LL;
LL min_total_length(vector<int> a, vector<int> b)
{
int n=(int)a.size(), m=(int)b.size();
int i, j;
LL sum=0;
if (n>m) {
for (i=j=0; i<m-1; i++) {
sum+=(LL)abs(a[j]-b[i]);
j++;
for (; j<n-(m-i-1)&&abs(a[j]-b[i])<abs(a[j]-b[i+1]); j++) sum+=(LL)abs(a[j]-b[i]);
}
for (; j<n; j++) sum+=(LL)abs(a[j]-b[m-1]);
}
else {
for (i=j=0; i<n-1; i++) {
sum+=(LL)abs(a[i]-b[j]);
j++;
for (; j<m-(n-i-1)&&abs(a[i]-b[j])<abs(a[i+1]-b[j]); j++) sum+=(LL)abs(a[i]-b[j]);
}
for (; j<m; j++) sum+=(LL)abs(a[n-1]-b[j]);
}
return sum;
}
# | 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... |