제출 #290813

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
290813		amoo_safar	전선 연결 (IOI17_wiring)	C++17	100 / 100	456 ms	16744 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 seg[N << 2];
ll lz[N << 2];

void Apply(int id, ll x){
	seg[id] += x;
	lz[id] += x;
}
void Shift(int id){
	Apply(id << 1, lz[id]);
	Apply(id << 1 | 1, lz[id]);
	lz[id] = 0;
}
void Add(int id, ll x, int l, int r, int L, int R){
	
	if(r <= L || R <= l) return ;
	if(l <= L && R <= r){
		Apply(id, x);
		return ;
	}
	Shift(id);
	int mid = (L + R) >> 1;
	Add(id << 1, x, l, r, L, mid);
	Add(id << 1 | 1, x, l, r, mid, R);
	seg[id] = min(seg[id << 1], seg[id << 1 | 1]);
}
ll Get(int id, int l, int r, int L, int R){
	if(r <= L || R <= l) return Inf;
	if(l <= L && R <= r) return seg[id];
	Shift(id);
	int mid = (L + R) >> 1;
	return min(Get(id << 1, l, r, L, mid), Get(id << 1 | 1, l, r, mid, R));
}


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) ));
		}
	}
	*/
	for(int i = 1; i <= n; i++){
		dp[i] = Inf;
		if(sm[i] == 1){
			Add(1, min(dp[i], dp[i - 1]) + ps[i], i, i + 1, 0, N);
			continue;
		}
		if(V[i].S != V[i - 1].S){
			for(int j = sm[i - 1]; j < i; j++){
				//if(j == 1) cerr << "^^^ " << 1ll * (i - j) * (-V[i].F) << ' ' << Get(1, 1, 2, 0, N) << '\n';
				Add(1, 1ll * (i - j) * (V[i].F), j, j + 1, 0, N);
			}
			if(sm[i - 1] != 1){
				ll pos = sm[i - 1] - 1;
				Add(1, Inf, sm[pos], pos + 1, 0, N);
			}
		}
		ll pos = sm[i] + sm[i] - i;

		la = sm[i];
		la2 = sm[la - 1];
		
		if(la2 < pos)
			Add(1, -V[la].F, la2, pos, 0, N);
		Add(1, -V[la - 1].F, pos, sm[i], 0, N);


		ll sum = ps[i + 1] - ps[la];
		//ll dif;
		


		//for(int j = la2; j < la; j++){
		//	dif = (i - la + 1) - (la - j);
		dp[i] = sum - ps[la] + Get(1, la2, la, 0, N);
			//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) ));
		//}
		Add(1, min(dp[i], dp[i - 1]) + ps[i], i, i + 1, 0, N);
		//if(i == 3) break;
	}
	//cerr << "! ";
	//for(int i = 0; i <= n; i++) cerr << dp[i] << ' ';
	//cerr << '\n';
	return dp[n];
}

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