Submission #1179093

#	Time	Username	Problem	Language	Result	Execution time	Memory
1179093		alexander707070	Palembang Bridges (APIO15_bridge)	C++20	22 / 100	25 ms	2244 KiB

bridge

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

struct house{
	int x,y;
};

int n,k,x,y,m;
long long ans;
char s,t;
house h[MAXN];

void solve_easy(){
	vector<int> vals;
	for(int i=1;i<=m;i++){
		vals.push_back(h[i].x);
		vals.push_back(h[i].y);
	}

	sort(vals.begin(),vals.end());

	int pos=vals[m];
	for(int i=1;i<=m;i++){
		ans+=abs(pos-h[i].x);
		ans+=abs(pos-h[i].y);
		ans++;
	}

	cout<<ans<<"\n";
}

int main(){

	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	cin>>k>>n;
	for(int i=1;i<=n;i++){
		cin>>s>>x>>t>>y;
		
		if(s==t){
			ans+=abs(x-y);
			continue;
		}

		m++; h[m]={x,y};
	}

	if(k==1){
		solve_easy();
	}

	return 0;
}

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