//------------------------------------\\
// ------------------------------ \\
// | created by Dinh Manh Hung | \\
// | tht.onepunchac168 | \\
// | THPT CHUYEN HA TINH | \\
// | HA TINH, VIET NAM | \\
// | Siuuu | \\
// ------------------------------ \\
//------------------------------------\\
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
#define task ""
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define ldb long double
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) begin(x),end(x)
#define uniquev(v) v.resize(unique(all(v))-v.begin())
#define rep(i,a,b) for (int i=a;i<=b;i++)
#define cntbit(v) __builtin_popcountll(v)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) ((1LL*a*b)/__gcd(a,b))
#define mask(x) (1LL<<(x))
#define readbit(x,i) ((x>>i)&1)
#define Yes cout << "Yes"
#define YES cout << "YES"
#define No cout << "No"
#define NO cout << "NO"
typedef long long ll;
typedef pair <ll,ll> ii;
typedef pair <ll,ii> iii;
typedef pair <ii,ii> iiii;
ll dx[]= {1,-1,0,0,1,-1,1,-1};
ll dy[]= {0,0,-1,1,1,-1,-1,1};
const ldb PI = acos (-1);
//const ll mod=978846151;
//const ll base=29;
const ll mod=1e9+7;
const char nl = '\n';
inline int ReadInt()
{
char co;
for (co = getchar(); co < '0' || co > '9'; co = getchar());
int xo = co - '0';
for (co = getchar(); co >= '0' && co <= '9'; co = getchar())
xo = (xo<<1) + (xo<<3) + co - '0';
return xo;
}
void WriteInt(int xo)
{
if (xo > 9)
WriteInt(xo / 10);
putchar(xo % 10 + '0');
}
// DEBUG
/*
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
*/
/* END OF TEMPLATE*/
// ================= Solution =================//
/*
void onepunchac168();
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
file(task);
int tests;
tests=1;
//cin>>tests;
while (tests--)
{
onepunchac168();
}
}
const int N=2e5+5;
void onepunchac168()
{
}
// goodbye see ya
*/
const int N=2e5+5;
vector <ii> vt;
ll sum[N];
ll dp[N];
int n;
long long min_total_length(std::vector<int> r, std::vector<int> b) {
for (auto v:r)
{
vt.pb({v,0});
}
for (auto v:b)
{
vt.pb({v,1});
}
vt.pb({-1e18-5,0});
n=vt.size()-1;
sort (vt.begin(),vt.end());
ll dem=0;
for (int i=1;i<=n;i++)
{
sum[i]=sum[i-1]+vt[i].fi;
}
for (int i=1;i<=n;i++)
{
dp[i]=1e18+5;
}
dp[0]=0;
for (int i=1;i<=n;i++)
{
dem++;
if (i==n||vt[i].se!=vt[i+1].se)
{
ll left=i-dem+1;
if (left==1)
{
}
else
{
int l1,r1;
r1=left-1;
l1=r1;
for (int j=r1-1;j>=1;j--)
{
if (vt[j].se==vt[r1].se)
{
l1=j;
continue;
}
break;
}
int pos=l1;
ll gmin=0;
for (int j=i;j>=left;j--)
{
while (pos <= r1 && r1-pos+1>j-left+1)
{
gmin=min(gmin+vt[left].fi-vt[pos].fi,dp[pos]);
pos++;
}
if (j-left+1<=r1-l1+1)
{
ll cost=sum[j]-sum[left-1]-(sum[left-1]-sum[2*left-j-2]);
dp[j]=min(dp[j],gmin+cost);
}
}
pos=r1;
gmin=dp[r1];
for (int j=left;j<=i;j++)
{
while (pos>=l1&&r1-pos+1<j-left+1)
{
gmin=min(gmin+vt[j].fi-vt[r1].fi,dp[pos-1]+sum[left+r1-pos]-sum[left-1]-(sum[r1]-sum[pos-1]));
pos--;
}
gmin+=vt[j].fi-vt[r1].fi;
dp[j]=min(dp[j],gmin);
}
}
dem=0;
}
}
return dp[n];
}
Compilation message
wiring.cpp:1:1: warning: multi-line comment [-Wcomment]
1 | //------------------------------------\\
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
3rd lines differ - on the 1st token, expected: '25859', found: '21937' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
30 ms |
8936 KB |
Output is correct |
| 4 |
Correct |
30 ms |
8380 KB |
Output is correct |
| 5 |
Correct |
30 ms |
8892 KB |
Output is correct |
| 6 |
Correct |
39 ms |
11192 KB |
Output is correct |
| 7 |
Correct |
48 ms |
10932 KB |
Output is correct |
| 8 |
Correct |
39 ms |
10156 KB |
Output is correct |
| 9 |
Correct |
39 ms |
10176 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
440 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
3rd lines differ - on the 1st token, expected: '17703', found: '17447' |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
3rd lines differ - on the 1st token, expected: '27', found: '10' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
3rd lines differ - on the 1st token, expected: '25859', found: '21937' |
| 2 |
Halted |
0 ms |
0 KB |
- |
