제출 #1202427

#제출 시각아이디문제언어결과실행 시간메모리
1202427MongHwa전선 연결 (IOI17_wiring)C++20
13 / 100
37 ms6568 KiB
#include "wiring.h"
#include <set>
using namespace std;

#define INF 0x7f7f7f7f
bool chk[100005];

long long min_total_length(std::vector<int> r, std::vector<int> b) {
	if(r.size() > b.size())
		swap(r, b);
	
	int n = (int)r.size(), m = (int)b.size();

	set<int> st;
	for(int i = 0; i < m; i++)
		st.insert(b[i]);
	
	long long ans = 0;
	for(int i = 0; i < n; i++)
	{
		auto it = st.lower_bound(r[i]);
		int lval = INF, rval = INF;
		if(it != st.end())
			rval = *it-r[i];
		if(it != st.begin())
		{
			it = prev(it);
			lval = r[i]-*it;
		}

		ans += min(lval, rval);
		if(lval <= rval)
			st.erase(-lval+r[i]);
		else
			st.erase(rval+r[i]);
	}
	
	for(int i = 0; i < m; i++)
	{
		if(st.find(b[i]) == st.end())
			continue;
		
		int lval = INF, rval = INF;
		auto it = lower_bound(r.begin(), r.end(), b[i]);
		if(it != r.end())
			rval = *it-b[i];
		if(it != r.begin())
		{
			it = prev(it);
			lval = b[i]-*it;
		}

		ans += min(lval, rval);
	}

	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...