Submission #582814

#	Time	Username	Problem	Language	Result	Execution time	Memory
582814		Justin1	Palembang Bridges (APIO15_bridge)	C++14	22 / 100	114 ms	4036 KiB

bridge

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

struct ppl {
	ll h,o; //house, office
};

ll n,m,k,x,y,z;
vector<ll> median;
vector<ppl> city;
char st, ed;

ll cal(vector<ppl> & city, vector<ll> & median) {
	ll ans = 0;
	sort(median.begin(),median.end());
	if (median.size()) {
		ll bridge = median[median.size()/2];
		for (auto i : city) ans += abs(i.h-bridge) + abs(i.o-bridge) + 1;
	}
	return ans;
}

void sub1() {
	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		cin >> st >> x >> ed >> y;
		if (st == ed) ans += abs(x-y);
		else {
			median.push_back(x);
			median.push_back(y);
			city.push_back({x,y});
		}
	}
	cout << ans + cal(city,median) << "\n";
}

void sub2() {
	cout << "oh no :(";
}

signed main() {
	cin >> m >> n;
	if (m == 1) sub1();
	else sub2();
}

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