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;
long long min_total_length(vector<int> R, vector<int> B) {
int N = R.size();
int M = B.size();
int64_t ans = 0;
int K = min(N, M);
for (int i = 0; i < K; i++) {
ans += B[M - i - 1] - R[i];
}
if (N > K) {
for (int i = K; i < N; i++) {
ans += B[0] - R[i];
}
}
if (M > K) {
for (int i = 0; i < M - K; i++) {
ans += B[i] - R[N - 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... |