| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 50480 | ayhcbagnop | 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.
#ifdef atom
#include "grader.cpp"
#endif
#include "wiring.h"
#include <bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> ii;
vector<int> x;
vector<int> pong;
vector<int> prv;
vector< vector< ll > > pref;
vector< vector< ll > > dp;
vector< vector<int> > buck;
long long min_total_length(std::vector<int> r, std::vector<int> b)
{
int ir, ib; ir = ib = 0;
while(ir< r.size() && ib< b.size())
{
if(r[ir]< b[ib])
{
x.pb(r[ir]); pong.pb(0);
ir++;
}
else
{
x.pb(b[ib]); pong.pb(1);
ib++;
}
}
while(ir< r.size()) x.pb(r[ir++]), pong.pb(0);
while(ib< b.size()) x.pb(b[ib++]), pong.pb(1);
ll last = -1e18;
int n = pong.size();
for(int i = 0; i< n; i++)
{
if(i && pong[i] != pong[i-1]) last = x[i-1];
prv.pb(last);
}
pref.pb(vector<ll>());
buck.pb(vector<int>());
for(int i = 0; i< n; i++)
{
if(i && pong[i] != pong[i-1])
{
pref.pb(vector<ll>());
buck.pb(vector<int>());
}
pref.back().pb(pref.back().empty()?x[i]:(pref.back().back()+x[i]) );
buck.back().pb(x[i]);
}
dp.resize(pref.size());
int comps = pref.size();
for(int i = 0; i< (int) dp.size(); i++)
{
dp[i].resize(pref[i].size()+1);
}
for(int i = comps-1; i>= 0; i--)
{
if(i == comps-1) dp[i][pref[i].size()] = 0;
else dp[i][pref[i].size()] = dp[i+1][0];
//printf("%d\n", i);
for(int j = pref[i].size()-1; j>= 0; j--)
{
//printf("dp[%d][%d]\n", i, j);
int numleft = pref[i].size()-j;
//printf("numleft = %d ((%d))->(%d)\n", numleft, pref[i].size()-numleft-1, pref[i][pref[i].size()-1]);
ll sumhere = pref[i][pref[i].size()-1]-(((int)pref[i].size()-numleft-1>= 0)?pref[i][pref[i].size()-numleft-1]:0ll);
ll sumnext;
if(i+1< comps)
{
if(numleft-1< pref[i+1].size()) sumnext = pref[i+1][numleft-1];
else sumnext = pref[i+1].back() + pref[i+1][0]*(numleft-pref[i+1].size());
}
else sumnext = 1e18;
//printf("sumnext %lld sumhere %lld\n", sumnext, sumhere);
ll prev;
if(i) prev = buck[i-1].back();
else prev = -1e18;
dp[i][j] = min(i+1< comps?dp[i+1][min(numleft, (int)pref[i+1].size())]+sumnext-sumhere:(ll)1e18, dp[i][j+1]+buck[i][j]-prev);
//printf("dp[%d][%d] = %lld\n", i, j, dp[i][j]);
}
}
return dp[0][0];
}