# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
738355 | Elvin_Fritl | Wiring (IOI17_wiring) | C++17 | 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 <bits/stdc++.h>
using namespace std;
#include "wiring.h"
long long min_total_length(vector<int> r, vector<int> b){
set<pair<int,int>>s;
vector<int>chek((int)b.size()*2 +1,0);
for(int i=0;i<(int)r.size();i++){
b[r[i]]=1;
}
int j=0,n=(int)b.size()*2;
for(int i=0;i<=n;i++){
if(b[j] > i){
s.insert({i,chek[i]});
}
else if(b[j] <= i){
while(b[j] <= i && j<n){
j++;
}
}
}
long long res=0;
for(int i=0;i<(int)b.size();i++){
int toto=chek[b[i]];
set<int>s1;
while(s.size()!=0 && s.begin().last == toto){
s1.insert(s.begin().first);
s.erase(s.begin());
}
res+=abs(b[i] - s.begin().first);
s.erase(s.begin());
while(s1.size()!=0){
s.insert({*s1.begin(),toto});
}
}
return res;
}