# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1068538 | edogawa_something | Wiring (IOI17_wiring) | C++17 | 1 ms | 604 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;
typedef long long ll;
typedef pair<ll,ll> pii;
typedef vector<ll> vii;
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pb push_back
const ll inf=1e18;
ll ans,dp[100100][35][35],n,m;
vector<pii>v;
long long min_total_length(std::vector<int> r, std::vector<int> b) {
n=r.size(),m=b.size();
for(int i=0;i<n;i++) {
v.pb({r[i],0});
}
for(int i=0;i<m;i++) {
v.pb({b[i],1});
}
sort(all(v));
dp[0][0][0]=0;
for(int i=1;i<=v.size();i++) {
for(int j=0;j<=30;j++) {
for(int k=0;k<=30;k++) {
if(v[i-1].S==1) {
dp[i][j][k]=inf;
if(j>0)
dp[i][j][k]=dp[i][j-1][k]-v[i-1].F;
dp[i][j][k]=min(dp[i][j][k],dp[i][j][k+1]+v[i-1].F);
}
else {
dp[i][j][k]=inf;
if(k>0)
dp[i][j][k]=dp[i][j][k-1]-v[i-1].F;
dp[i][j][k]=min(dp[i][j][k],dp[i][j+1][k]+v[i-1].F);
}
}
}
}
return dp[n+m][0][0];
}
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... |