# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
883911 | JakobZorz | Wiring (IOI17_wiring) | C++14 | 1074 ms | 8540 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<iostream>
#include<algorithm>
#include<set>
using namespace std;
typedef long long ll;
const int TREE_SIZE=1<<18;
ll tree[TREE_SIZE];
ll min_total_length(vector<int>r,vector<int>b){
vector<pair<int,int>>arr;
for(int i:r)
arr.push_back({i,0});
for(int i:b)
arr.push_back({i,1});
sort(arr.begin(),arr.end());
vector<ll>dp(arr.size(),1e18);
dp.push_back(0);
arr.emplace_back(-1,arr.back().second^1);
int i2=(int)dp.size()-1;
int i3=(int)dp.size()-1;
multiset<int>ms;
ll cost1=0;
for(int i1=(int)dp.size()-2;i1>=0;i1--){
if(arr[i2].second==arr[i1].second){
i3=i2;
i2=i1+1;
cost1=0;
int first1=arr[i2-1].first;
for(int i=i2;i<i3;i++)
tree[i]=arr[i].first-first1;
}
if(i2==dp.size()-1)
continue;
int mid=arr[i2].first;
int num1=i2-i1;
cost1+=mid-arr[i1].first;
dp[i1]=dp[i2];
tree[2*i2-i1-1]=arr[2*i2-i1-1].first-mid;
/*for(int i=i2;i<i3;i++){
if(num1==0){
cost+=arr[i].first-first1;
}else{
num1--;
cost+=arr[i].first-mid;
}
dp[i1]=min(dp[i1],dp[i+1]+cost);
}*/
ll cost=0;
for(int i=i2;i<i3;i++){
cost+=tree[i];
dp[i1]=min(dp[i1],dp[i+1]+cost);
}
dp[i1]+=cost1;
}
return dp[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... |