Submission #671684

#	Time	Username	Problem	Language	Result	Execution time	Memory
671684		Dan4Life	Palembang Bridges (APIO15_bridge)	C++17	41 / 100	2080 ms	8048 KiB

bridge

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define fi first
#define se second
#define pb push_back
using pii = pair<int,int>;
#define all(a) a.begin(),a.end()
#define sz(a) (int)a.size()
const int maxn = (int)1e5+10;
const int LINF = (int)1e18;
vector<int> v;
vector<pii> seg;
set<pii> bef,dur,aft;
int t, n, sum_bef, sum_dur, sum_aft, tot, ans=LINF;

int chk(int x, int t){
	vector<int> v; v.clear(); int ans = 0;
	if(t==0){
		for(int i = 0; i <= x; i++) 
			v.pb(seg[i].se), v.pb(seg[i].fi-seg[i].se);
	}
	else{
		for(int i = x+1; i < sz(seg); i++) 
			v.pb(seg[i].se), v.pb(seg[i].fi-seg[i].se);
	}
	sort(all(v)); int med = v[sz(v)/2];
	for(auto u : v) ans+=abs(med-u); 
	return ans;
}
int32_t main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> t >> n; int ans = LINF;
	for(int i = 0; i < n; i++){
		char a, c; int b, d;
		cin >> a >> b >> c >> d;
		if(a==c) tot+=abs(b-d);
		else seg.pb({b+d, min(b,d)}), tot++, v.pb(b), v.pb(d);
	}
	sort(all(v)); sort(all(seg));
	if(!seg.empty()) ans = chk(sz(seg)-1, 0);
	for(int i = 0; i < sz(seg); i++){
		ans = min(ans, chk(i,0)+chk(i,1));
	}
	if(seg.empty()) ans=0;
	cout << ans+tot;
}

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