# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
422257 | Pbezz | Wiring (IOI17_wiring) | C++14 | 0 ms | 0 KiB |
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>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
typedef pair<ll,ll> pii;
typedef tree<ll, null_type,less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
const ll MAXN = 2e5+4;
const ll INF = 1e9+7;
long long min_total_length(std::vector<int> r, std::vector<int> b){
ll n=(ll)r.size(), m=(ll)b.size(),ans=0,i;
ll le=n-1,ri=0;
while(le>=0&&ri<=m){
ans+=b[ri]-r[le];
le--;
ri++;
}
if(le<0){
while(rri<=m){
ans+=b[ri]-r[n-1];
ri++;
}
}else{
while(le>=0){
ans+=b[0]-r[le];
le--;
}
}
return ans;
}