제출 #882437

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
882437		vjudge1	Palembang Bridges (APIO15_bridge)	C++11	22 / 100	150 ms	12088 KiB

bridge

#include<bits/stdc++.h>
#define all(aa) aa.begin(), aa.end()
#define endl ("\n")
#define pb push_back
typedef long long ll;
const int maxn = 1e5 + 5;
using namespace std;

int n, k;
vector<pair<ll, ll>> v;
vector<ll> u;
multiset<ll> vis;
multiset<pair<ll, ll>> come; // vis r'ye gore artan come l'ye gore artan
ll lft, rgt, lst;
ll ans = LONG_LONG_MAX, cur;

int main(){
	cin >> k >> n;
	assert(k == 1);
	for(int i = 0; i < n; i++){
		char c1, c2;
		int a, b;
		cin >> c1 >> a >> c2 >> b;
		if(b > a) swap(a, b);
		cur+=a-b;
		if(c1!=c2){
			++cur;
			v.pb({b, a});
			u.pb(a), u.pb(b);
			come.insert({b, a});
			cur+=2*b;
		}
	}
	rgt = n = v.size();
	sort(all(u));
	ans = cur;
	for(int i = 0; i < 2*n; i++){
		cur += lft*2*(u[i] - lst) - rgt*2*(u[i] - lst);
		while(!come.empty() && (*come.begin()).first == u[i]){
			pair<ll, ll> p = *come.begin();
			vis.insert({p.second});
			come.erase(come.find(p));
			rgt--;
		} 
		while(!vis.empty() && *vis.begin() == u[i]){
			lft++;
			vis.erase(vis.find(u[i]));
		}
		ans = min(ans, cur);
		lst = u[i];
	}

	cout << ans << endl;

	
}

• Subtask 1: 8 / 8
• Subtask 2: 14 / 14
• Subtask 3: 0 / 9
• Subtask 4: 0 / 32
• Subtask 5: 0 / 37