제출 #284485

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
284485		mohammad	전선 연결 (IOI17_wiring)	C++14	0 / 100	1 ms	384 KiB

wiring

#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;
 
#define endl "\n"
// #define int long long

typedef long long ll ;
const ll ooo = 1e14 ;
const ll oo = 2e9 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7  ;
const int N = 10000010  ;

ll dp[200010] , d[200010] , sum[200010];

ll min_total_length(vector<int> r, vector<int> b) {
	vector<pair<int,int>> v;
	for(auto i : r) v.push_back({i , 0});
	for(auto i : b) v.push_back({i , 1});
	sort(v.begin(), v.end());
	int n = v.size();
	sum[0] = v[0].first ;
	d[0] = -1 ;
	dp[0] = ooo;
	for(int i = 1 ; i < n; ++i){
		dp[i] = ooo;
		sum[i] = sum[i - 1] + v[i].first;
		d[i] = (v[i].second == v[i - 1].second ? d[i - 1] : i - 1);
		if(d[i] == -1) continue ;
		// cout << i << ' ' << d[i] << ' ' << d[i] - (i - d[i]) << endl;
		dp[i] = min(dp[i - 1] + v[i].first - v[d[i]].first , dp[i]);
		if(d[d[i]] <= d[i] - (i - d[i]) ){
			dp[i] = min(dp[i] , 
				(sum[i] - sum[d[i]]) - (sum[d[i]] - sum[d[i] - (i - d[i])]) + dp[d[i] - (i - d[i])]);
		}
	}
	return dp[n - 1];
}

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