Submission #679190

#	Time	Username	Problem	Language	Result	Execution time	Memory
679190		penguin133	Palembang Bridges (APIO15_bridge)	C++17	22 / 100	97 ms	5892 KiB

bridge

#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
 
int n, k;
vector<int> st, en;
bool vis[100005], vis2[100005];
int P[100005], S[100005];
vector<int> pos;
void solve(){
	cin >> k >> n;
	int ans = 0, tmp = 0;
	for(int i=1;i<=n;i++){
		char a, c; int b, d; cin >> a >> b >> c >> d;
		if(a == c)ans += abs(b - d);
		else st.push_back(max(b, d)), en.push_back(min(b, d)), tmp += abs(b - d) + 1, pos.push_back(b), pos.push_back(d);
	}
	if(k == 2){
		cout << ans + tmp << '\n';
		return;
	}
	sort(st.begin(), st.end());
	sort(en.begin(), en.end());
	if(st.size())P[0] = st[0];
	int mn = (st.size() ? 1e18 : 0);
	for(int i=1;i<(int)st.size();i++)P[i] = P[i-1] + st[i];
	for(int i=(int)en.size()-1;i>=0;i--)S[i] = S[i+1] + en[i];
	for(auto i : pos){
		int cur = 0;
		int x = upper_bound(st.begin(), st.end(), i) - st.begin();
		if(x != 0){
			x--;
			cur += 2 * ((x + 1) * i - P[x]);
		}
		x = upper_bound(en.begin(), en.end(), i) - en.begin();
		if(x != (int)en.size()){
			cur += 2 * (S[x] - i * ((int)en.size() - x));
		}
		//cout << i << " " << cur << '\n';
		mn = min(mn, cur);
	}
	cout << ans + tmp + mn;
}
 
main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message (stderr)

bridge.cpp:53:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   53 | main(){
      | ^~~~

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