# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
283274 | davi_bart | Wiring (IOI17_wiring) | C++14 | 1106 ms | 148688 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 <bits/stdc++.h>
#include <wiring.h>
using namespace std;
#define ll long long
//#define int ll
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int> x, y;
map<int,bool> vis[100010];
map<int,ll> memo[100010];
ll sol(int a,int b){
if(a==x.size() && b==y.size())return 0;
if(vis[a][b])return memo[a][b];
vis[a][b]=1;
if(a==x.size()){
ll t=0;
for(int i=b;i<y.size();i++)t+=abs(y[i]-x.back());
return memo[a][b]=t;
}
if(b==y.size()){
ll t=0;
for(int i=a;i<x.size();i++)t+=abs(x[i]-y.back());
return memo[a][b]=t;
}
ll best=1e16;
best=min(best,sol(a+1,b+1)+abs(x[a]-y[b]));
if(a>0)best=min(best,sol(a,b+1)+abs(x[a-1]-y[b]));
if(b>0)best=min(best,sol(a+1,b)+abs(x[a]-y[b-1]));
return memo[a][b]=best;
}
long long min_total_length(std::vector<int> r, std::vector<int> b) {
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... |