# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337112 | pggp | 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 <bits/stdc++.h>
#include <wiring.h>
long long min_total_length(vector < int > r, vector < int > b){
int last_r = r[r.size() - 1];
int first_b = b[0];
long long ans = 0;
for(int i = 0; i < min(r.size(), b.size()); i++){
ans += b[i] - r[i];
if(i == r.size() - 1){
// łączę wszystkie niebieksie do ostatniego r
for (int j = i + 1; j < b.size(); ++b)
{
ans += b[i] - last_r;
}
return ans;
}
if(i == b.size() - 1){
// łączę wszystkie czerwone do pierwszego b
for (int j = i + 1; j < r.size(); ++b)
{
ans += r[i] - first_b;
}
return ans;
}
}
return ans;
}