# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
637322 | boris_mihov | 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 "wiring.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <set>
typedef long long llong;
const int MAXN = 100000 + 10;
long long min_total_length(std::vector <int> r, std::vector <int> b)
{
int ptr = 0;
llong ans = 0;
if (b.size() < r.size()) std::swap(r, b);
for (int i = 0 ; i < b.size() ; ++i)
{
if (b.size() - i == r.size() - ptr - 1 || (ptr + 1 != r.size() && abs(r[ptr] - b[i]) > abs(r[ptr + 1] - b[i]))) ++ptr;
ans += abs(b[i] - r[ptr]);
}
return ans;
}#include "wiring.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <set>
typedef long long llong;
const int MAXN = 100000 + 10;
long long min_total_length(std::vector <int> r, std::vector <int> b)
{
int ptr = 0;
llong ans = 0;
if (b.size() < r.size()) std::swap(r, b);
for (int i = 0 ; i < b.size() ; ++i)
{
if (b.size() - i == r.size() - ptr - 1 || (ptr + 1 != r.size() && abs(r[ptr] - b[i]) > abs(r[ptr + 1] - b[i]))) ++ptr;
ans += abs(b[i] - r[ptr]);
}
return ans;
}