제출 #290770

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
290770		amoo_safar	Wiring (IOI17_wiring)	C++17	17 / 100	1070 ms	8424 KiB

wiring

#include "wiring.h"

#include <bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int N = 2e5 + 10;
const ll Inf = 1e18;

ll sm[N], ps[N];
vector<pii> V;
ll dp[N];

ll min_total_length(vector<int> r, vector<int> b) {
	for(int i = 0; i < (int) r.size(); i++)
		V.pb({r[i], 0});
	for(int i = 0; i < (int) b.size(); i++)
		V.pb({b[i], 1});
	
	V.pb({-1, -1});
	sort(all(V));

	int n = ((int) V.size()) - 1;
	
	sm[1] = 1;
	for(int i = 2; i <= n; i++)
		sm[i] = (V[i].S == V[i - 1].S ? sm[i - 1] : i);

	ps[1] = 0;
	for(int i = 2; i <= n + 1; i++) ps[i] = ps[i - 1] + V[i - 1].F;

	int la, la2;
	dp[0] = 0;
	for(int i = 1; i <= n; i++){
		dp[i] = Inf;
		if(sm[i] == 1)
			continue;
		la = sm[i];
		la2 = sm[la - 1];
		ll sum = ps[i + 1] - ps[la];
		ll dif;
		for(int j = la2; j < la; j++){
			dif = (i - la + 1) - (la - j);
			dp[i] = min(dp[i], min(dp[j], dp[j - 1]) + sum - (ps[la] - ps[j]) + ( dif < 0 ? abs(dif) * V[la].F : abs(dif) * (-V[la - 1].F) ));
		}
	}
	return dp[n];
}

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