Submission #1197452

#	Time	Username	Problem	Language	Result	Execution time	Memory
1197452		HappyCapybara	전선 연결 (IOI17_wiring)	C++17	0 / 100	0 ms	328 KiB

wiring

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

#define ll long long

ll min_total_length(vector<int> r, vector<int> b){
	int n = r.size();
	int m = b.size();
	vector<pair<int,int>> v;
	for (int i=0; i<n; i++) v.push_back({r[i], 0});
	for (int i=0; i<m; i++) v.push_back({b[i], 1});
	sort(v.begin(), v.end());
	vector<int> bl(n+m);
	bl[0] = 1;
	for (int i=1; i<n+m; i++){
		if (v[i].second == v[i-1].second) bl[i] = bl[i-1]+1;
		else bl[i] = 1;
	}
	vector<ll> dp(n+m+1, 1ll<<50);
	dp[0] = 0;
	for (int i=0; i<n+m; i++){
		if (bl[i] == i+1) continue;
		int lb = i-bl[i];
		for (int j=0; j<bl[lb]; j++){
			ll k = 0;
			for (int x=0; x<min(bl[i], j+1); x++) k += abs(v[lb-x].first-v[lb+1+x].first);
			for (int x=bl[i]; x<j+1; x++) k += abs(v[lb-x].first-v[lb+1].first);
			for (int x=j+1; x<bl[i]; x++) k += abs(v[lb].first-v[lb+1+x].first);
			//cout << i << " " << j << " " << k << endl;
			int res;
			if (j == bl[lb]-1) res = k+min(dp[lb-j], dp[lb-j+1]);
			else res = k+dp[lb-j];
			if (res > dp[i+1] && dp[i+1] != 1ll<<50) break;
			dp[i+1] = res;
		}
	}
	return dp[n+m];
}

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