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"
long long min_total_length(std::vector<int> r, std::vector<int> b) {
int n, m;
n = r.size();
m = b.size();
if (r[n-1] < b[0]){
long long ans = 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];
}
if (n > m){
ans += n * (b[0] - r[n-1]);
}
else{
ans += m * (b[0] - r[n-1]);
}
return ans;
}
return 0;
}
# | 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... |