제출 #942948

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
942948		oblantis	Palembang Bridges (APIO15_bridge)	C++17	0 / 100	1 ms	456 KiB

bridge

#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll inf = 1e16;
const int mod = 1e9+7;
const int maxn = 1e6 + 1;

void solve() {
	int k, n, sz = 0;
	cin >> k >> n;
	ll ans = 0, s = inf, sum = 0, c1 = 0, c2 = 0;
	vt<pair<ll, bool>> v;
	for(int i = 0; i < n; i++){
		char a, b;
		int x, y;
		cin >> a >> x >> b >> y;
		if(x > y)swap(x, y);
		ans += y - x;
		if(a != b){
			v.pb({x, 0});
			v.pb({y, 1});
			sum += x;
			ans++;
			c1++;
			sz += 2;
		}
	}
	sort(all(v));
	for(int j = 0; j < sz; j++){
		if(v[j].ss == 0)sum -= v[j].ff, c1--;
		else sum -= v[j].ff, c2++;
		s = min(s, sum + (c2 - c1) * v[j].ff);
	}
	cout << ans + s * 2;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int times = 1;
	//cin >> times;
	for(int i = 1; i <= times; i++) {
		solve();
	}
	return 0;
}

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