Submission #1339643

#TimeUsernameProblemLanguageResultExecution timeMemory
1339643javkhlantogsPalembang Bridges (APIO15_bridge)C++20
0 / 100
0 ms344 KiB
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
	ll k,n,i,j;
	cin>>k>>n;
	vector<ll> s(n),t(n);
	vector<char> p(n),q(n);
	ll ans=0;
	for(i=0 ; i<n ; i++){
		cin>>p[i]>>s[i]>>q[i]>>t[i];
		if(p[i]==q[i]){
			ans+=abs(s[i]-t[i]);
			continue;
		}
	}
	if(k==1){
		ll val=1e18;
		for(i=0 ; i<n ; i++){
			if(p[i]==q[i]) continue;
			ll pos=s[i];
			ll cnt=0;
			for(j=0 ; j<n ; j++){
				if(p[j]==q[j]) continue;
				cnt+=abs(pos-s[j])+abs(pos-t[j])+1;
			}
			val=min(val,cnt);
			pos=t[i];
			cnt=0;
			for(j=0 ; j<n ; j++){
				if(p[j]==q[j]) continue;
				cnt+=abs(pos-s[j])+abs(pos-t[j])+1;
			}
			val=min(val,cnt);
		}
		ans+=val;
		cout<<ans<<"\n";
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...