Submission #720771

#	Time	Username	Problem	Language	Result	Execution time	Memory
720771		mseebacher	Palembang Bridges (APIO15_bridge)	C++17	0 / 100	1 ms	212 KiB

bridge

#include <bits/stdc++.h> 
 
using namespace std;
 
// Idee 1 -> Set mit Wert|Index pair
// Idee 2 -> SegTree damit
 
 
void solve(){
	int k; cin >> k;
	int n; cin >> n;
	
	
	vector<int> diff;
	long long sum = 0;
	for(int i = 0;i<n;i++){
		char t1,t2;
		int c1,c2;
		cin >> t1 >> c1 >> t2 >> c2;
		
		if(t1 == t2){
			sum += abs(c2-c1);
		}else{
			diff.push_back(c1);
			diff.push_back(c2);
		}
	}
	if(diff.size() == 0) return;
	sort(diff.begin(),diff.end());
	sum += (diff.size() >> 1);
	int mid = diff[diff.size()/2];
	for(int i = 0;i<(int)diff.size();i++){
		sum += abs(diff[i]-mid);
	}
	
	cout << sum << " ";
	
}
 
int main(){
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    cout << fixed << setprecision(8);
 
    solve();
}

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