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>
using namespace std;
#define ll long long
ll min_total_length(vector<int> r, vector<int> b)
{
int n=r.size(),m=b.size();
ll ans=0;
for (int i=0;i<min(n,m);i++)
ans+=b[i]-r[n-i-1];
if (n>m)
{
for (int i=m;i<n;i++)
ans+=b[0]-r[n-i-1];
}
else
{
for (int i=n;i<m;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... |