Submission #589559

#	Time	Username	Problem	Language	Result	Execution time	Memory
589559		1ne	Palembang Bridges (APIO15_bridge)	C++14	22 / 100	39 ms	3668 KiB

bridge

#include<bits/stdc++.h>
using namespace std;
struct node{
	char p,q;
	int s,t;
	void inn(){
		cin>>p>>s>>q>>t;
	}
};
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int k,n;cin>>k>>n;
	vector<node>arr(n);
	vector<long long>brr;
	for (int i = 0;i<n;++i){
		arr[i].inn();
		if (arr[i].p!=arr[i].q){
			brr.push_back(arr[i].s);
			brr.push_back(arr[i].t);
		}
	}
	const long long mxn = 1e18;
	long long ans = mxn;
	sort(brr.begin(),brr.end());
	if (k == 1 || n == 1){
		for (int i = 0;i<2;++i){
			long long curans = 0;
			int temp = (int)brr.size()/2 - 1 + i;
			for (int j = 0;j<n;++j){
				if (arr[j].p == arr[j].q){
					curans+=abs(arr[j].t - arr[j].s);
				}
				else{
					curans+=abs(arr[j].t - brr[temp]) + abs(arr[j].s - brr[temp]) + 1;
				}
			}
			ans = min(ans,curans);
		}
	}
	if (k == 2 && n > 1){
		for (int x = 0;x<(int)brr.size();++x){
			for (int y = 0;y<(int)brr.size();++y){
				if (abs(brr[x] - brr[y])==1)continue;
				long long curans = 0;
					for (int j = 0;j<n;++j){
						if (arr[j].p == arr[j].q){
							curans+=abs(arr[j].t - arr[j].s);
						}
						else{
							curans+=min(abs(arr[j].t - brr[x]) + abs(arr[j].s - brr[x]),abs(arr[j].t - brr[y]) + abs(arr[j].s - brr[y])) + 1;
						}
					}
					ans = min(curans,ans);
			}
		}
	}
	cout<<ans<<'\n';
	return 0;
}

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