# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42992 | alenam0161 | Wiring (IOI17_wiring) | C++14 | 93 ms | 75700 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 <iostream>
#include <algorithm>
using namespace std;
vector<long long> pre, suf;
vector<pair<long long, int>> all;
int n;
long long pre_gum(int l, int r) {
if (l > r)return 0;
if (l == 0) {
return pre[r] - (r - l + 1)*all[0].first;
}
return pre[r] - pre[l - 1] - all[l].first * (r - l + 1);
}
long long suf_gum(int l, int r) {
if (l > r)return 0;
return suf[l] - suf[r + 1] - (all[n - 1].first - all[r].first) * (r - l + 1);
}
long long sum(int l, int mid, int r) {
return suf_gum(l, mid) + pre_gum(mid + 1, r) + 1ll * max(mid - l + 1, r - mid)*(all[mid + 1].first - all[mid].first);
}
long long min_total_length(std::vector<int> r, std::vector<int> b) {
for (int to : r)all.push_back({ to,1 });
for (int to : b)all.push_back({ to,2 });
int n = all.size();
::n = n;
sort(all.begin(), all.end());
vector<int> left(n + 1, 0);
for (int i = 0; i < n; ++i) {
if (i == 0 || (all[i].second != all[i - 1].second)) {
Compilation message (stderr)
# | 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... |