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;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;
#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)
long long min_total_length(std::vector<int> r, std::vector<int> b) {
ll ans=0;
if(r.size()<b.size()) swap(r,b);
set<int> bb;
FOA(v,b) bb.insert(v);
FOA(v, r){
if(!bb.empty()){
ans += abs(v - *bb.begin());
bb.erase(bb.begin());
}
else{
int d1=MOD, d2=MOD;
auto it1 = lower_bound(b.begin(), b.end(), v);
auto it2 = lower_bound(b.begin(), b.end(), v);
it2--;
if(it1!=b.end()) d1 =abs(v - *it1);
if(it1!=b.begin()) d2 = abs(v - *it2);
ans += min(d1, d2);
}
}
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... |