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 <bits/stdc++.h>
#include "wiring.h"
using namespace std;
typedef long long ll;
ll min_total_length(vector<int> r, vector<int> b)
{
int n = r.size(), m = b.size();
ll ans = 0;
if (m > n)
{
for (int i = m-1; i >= n; i--)
ans += 1ll*(b[i]-r[n-1]);
for (int i = n-1; i >= 0; i--)
ans += 1ll*(b[i]-r[i]);
}
else if (m < n)
{
for (int i = 0; i < n-m; i++)
ans += 1ll*(b[0]-r[i]);
for (int i = n-m; i < n; i++)
ans += 1ll*(b[i-(n-m)]-r[i]);
}
else
{
for (int i = 0; i < n; i++)
ans += 1ll*(b[i]-r[i]);
}
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... |