Submission #1045349

#	Time	Username	Problem	Language	Result	Execution time	Memory
1045349		Hugo1729	Wiring (IOI17_wiring)	C++11	13 / 100	29 ms	10688 KiB

wiring

#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll dp[200001]={0};
ll pref[200001]={0};

ll min_total_length(vector<int> r, vector<int> b) {
	ll n=r.size(),m=b.size();

	vector<pair<ll,ll>> a;
	for(ll v : r)a.push_back({v,0});
	for(ll v : b)a.push_back({v,1});

	sort(a.begin(),a.end());
	for(ll i=0;i<n+m;i++){
		pref[i+1]=pref[i]+a[i].first;
	}
	// for(ll i=0;i<n+m;i++)cout << a[i].first << ' ';
	// cout << '\n';
	// for(ll i=0;i<=n+m;i++)cout << pref[i] << ' ';
	// cout << '\n';

	ll prev_begin=-1,prev_end=-1;

	for(ll i=1;i<n+m;i++){
		if(a[i].second!=a[i-1].second){
			prev_begin=prev_end+1;
			prev_end=i-1;
		}

		if(prev_begin==-1)continue;

		if(prev_begin==0){
			dp[i]=LLONG_MAX;

			ll x=(prev_end-prev_begin+1),y=i-prev_end;

			
			if(x<=y){
				dp[i]=(a[prev_end].first*x-pref[prev_end+1])+(pref[i+1]-pref[prev_end+1]-a[prev_end].first*y);
				// cout << i << ' ' << prev_begin << ' ' << prev_end << ' ' << "a: " << (a[prev_end].first*x-pref[prev_end+1]) << ' ' << (pref[i+1]-pref[prev_end+1]-a[prev_end].first*y) << '\n';
			}else{
				dp[i]=(a[prev_end+1].first*x-pref[prev_end+1])+(pref[i+1]-pref[prev_end+1]-a[prev_end+1].first*y);
				// cout << i << ' ' << prev_begin << ' ' << prev_end << ' ' <<  "b: " << (a[prev_end+1].first*x-pref[prev_end+1]) << ' ' << (pref[i+1]-pref[prev_end+1]-a[prev_end+1].first*y) << '\n';
			}
			continue;
		}

		dp[i]=LLONG_MAX;

		for(ll j=prev_begin;j<=prev_end;j++){

			ll x=(prev_end-j+1),y=i-prev_end;

			if(x<=y){
				dp[i]=min(dp[i],(a[prev_end].first*x-(pref[prev_end+1]-pref[j]))+(pref[i+1]-pref[prev_end+1]-a[prev_end].first*y)+dp[j-1]);
			}else{
				dp[i]=min(dp[i],(a[prev_end+1].first*x-(pref[prev_end+1]-pref[j]))+(pref[i+1]-pref[prev_end+1]-a[prev_end+1].first*y)+dp[j-1]);
			}

			
			
		}
	}

	// cout << "\n\n";
	// for(ll i=0;i<n+m;i++)cout << dp[i] << ' ';
	// cout << "\n\n";



	return dp[n+m-1];
}

• Subtask 1: 0 / 7
• Subtask 2: 13 / 13
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 45