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"
//#include "grader.cpp"
using namespace std ;
const int MAX = 2e5 + 10 ;
int n , m ;
vector<int>A , B ;
long long min_total_length(std::vector<int> r, std::vector<int> b)
{
A = r , B = b ;
n = A.size() , m = B.size() ;
long long sum = 0 ;
for(int i = 0 ; i < n ; ++i)
sum += B[0] - A[i] ;
if(m > n)
sum += (B[0] - A.back()) * 1ll * (m - n) ;
for(int i = 0 ; i < m ; ++i)
sum += B[i] - B[0] ;
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... |