| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 157167 | AKaan37 | 전선 연결 (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.
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
//~ #include "wiring.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 100000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
lo n,m,b[li],a[li],k,flag,t,mx,mn=inf,dp[205][205];
lo cev;
queue<lo> q,q1;
map<lo,lo> PS;
string s;
vector<PII> v;
inline lo f(lo l,lo rr,vector<lo>r,vector<lo>b){
lo cevv=inf;
if(l>=n){
if(rr==m-1)return 0;
return inf;
}
if(~dp[l][rr])return dp[l][rr];
for(int i=rr;i<m;i++){
cevv=min(cevv,f(l+1,i,r,b)+abs(b[i]-r[l])+(PS[i-1]-PS[rr]<0?0:PS[i-1]-PS[rr]));
}
return dp[l][rr]=cevv;
}
long long min_total_length(std::vector<lo> r, std::vector<lo> b) {
memset(dp,-1,sizeof(dp));
for(lo i=0;i<(lo)r.size();i++){v.pb(mp(r[i],1));}
for(lo i=0;i<(lo)b.size();i++){v.pb(mp(b[i],2));}
n=r.size();
m=b.size();
PS[-1]=0;
//~ if(m>n){
//~ swap(n,m);
//~ swap(b,r);
//~ }
//~ cout<<"**\n";
for(lo i=0;i<(lo)b.size();i++){
cev=inf;
for(lo j=0;j<(lo)r.size();j++){
cev=min(cev,abs(r[j]-b[i]));
}
if(i==0)PS[i]=cev;
else PS[i]=PS[i-1]+cev;
}
//~ cout<<"**\n";
return f(0,0,r,b);
}
int main() {
int n, m;
assert(2 == scanf("%d %d", &n, &m));
vector<lo> r(n), b(m);
for(int i = 0; i < n; i++)
assert(1 == scanf("%lld", &r[i]));
for(int i = 0; i < m; i++)
assert(1 == scanf("%lld", &b[i]));
long long res = min_total_length(r, b);
printf("%lld\n", res);
return 0;
}