# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
566800 | Hanksburger | Wiring (IOI17_wiring) | C++17 | 53 ms | 8512 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>
using namespace std;
long long dp[200005], sum[200005];
pair<int, bool> a[200005];
long long min_total_length(vector<int> r, vector<int> b)
{
for (int i=0; i<r.size(); i++)
a[i+1]={r[i], 0};
for (int i=0; i<b.size(); i++)
a[r.size()+i+1]={b[i], 1};
int n=r.size()+b.size(), pre=1;
sort(a+1, a+n+1);
a[0]={-1e9, !a[1].second};
for (int i=1; i<=n; i++)
sum[i]=sum[i-1]+a[i].first;
for (int i=1; i<=n; i++)
dp[i]=1e18;
for (int i=1; i<=n; i++)
{
int ind=i;
while (ind<n && a[i].second==a[ind+1].second)
ind++;
for (int j=pre; j<i; j++)
dp[j]=min(dp[j], dp[j-1]+a[i].first-a[j].first);
long long x=0, y=dp[i-1];
for (int j=i; j<=ind; j++)
{
x+=a[j].first-a[i-1].first;
int tmp=i*2-j-2;
if (tmp+1>=pre)
y=min(y, dp[tmp]+1LL*a[i-1].first*(i-tmp-1)-sum[i-1]+sum[tmp]);
dp[j]=x+y;
}
pre=i;
i=ind;
}
return dp[n];
}
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... |