Submission #905919

#	Time	Username	Problem	Language	Result	Execution time	Memory
905919		Muhammad_Aneeq	Palembang Bridges (APIO15_bridge)	C++17	0 / 100	1 ms	600 KiB

bridge

/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool comp(pair<int,int>a,pair<int,int>b)
{
	return (b.second>a.second);
}
void solve()
{
	int k,n;
	cin>>k>>n;
	long long ans=0;
	vector<pair<int,int>>d;
	int z=0;
	for (int i=0;i<n;i++)
	{
		char a,b;
		int x,y;
		cin>>a>>x>>b>>y;
		if (a==b)
			ans+=abs(x-y);
		else
		{
			z+=abs(x-y);
			if (a=='B')
				swap(x,y);
			d.push_back({x,y});
		}	
	}
	if (d.size())
	{
		sort(begin(d),end(d));
		int z=d[(d.size()-1)/2].first;
		long long x=0;
		for (auto i:d)
			x+=(abs(i.first-z)+abs(i.second-z))+1;
		long long f=0;
		sort(begin(d),end(d),comp);
		z=d[(d.size()-1)/2].second;
		for (auto i:d)
			f+=(abs(i.first-z)+abs(i.second-z))+1;
		ans+=min(x,f);
	}	
	cout<<ans<<endl;
}
int main()
{
  ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}

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