제출 #388903

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
388903		talant117408	Palembang Bridges (APIO15_bridge)	C++17	31 / 100	2082 ms	2584 KiB

bridge

/*
    Code written by Talant I.D.
*/
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
 
const int mod = 998244353;
 
ll mode(ll a) {
    a %= mod;
    if (a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b) {
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b) {
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b) {
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int main() {
    do_not_disturb
    
    int k, n;
    cin >> k >> n;
    
    if (k == 1) {
		ll sum = 0;
		vector <ll> v;
		for (int i = 0; i < n; i++) {
			char a, b;
			int aa, bb;
			cin >> a >> aa >> b >> bb;
			if (a == b) {
				sum += abs(aa-bb);
			}
			else {
				v.pb(aa); v.pb(bb);
			}
		}
		sort(all(v));
		sum += sz(v)/2;
		
		for (int i = 0; i < sz(v)/2; i++) sum -= v[i];
		for (int i = sz(v)/2; i < sz(v); i++) sum += v[i];
		cout << sum;
	}
	else {
		ll ans = 9e18;
		vector <pair <char, char>> zone(n);
		vector <pii> pos(n);
		vector <int> v;
		for (int i = 0; i < n; i++) {
			cin >> zone[i].first >> pos[i].first >> zone[i].second >> pos[i].second;
			v.pb(pos[i].first); v.pb(pos[i].second);
		}
		
		sort(all(v));
		
		for (int i = 0; i < sz(v); i++) {
			for (int j = i+1; j < sz(v); j++) {
				ll res = 0;
				for (int l = 0; l < n; l++) {
					if (zone[l].first == zone[l].second) {
						res += abs(pos[l].first-pos[l].second);
					}
					else {
						res += 1+min(abs(v[i]-pos[l].first)+abs(v[i]-pos[l].second), abs(v[j]-pos[l].first)+abs(v[j]-pos[l].second));
					}
				}
				ans = min(ans, res);
			}
		}
		cout << ans;
	}
    
    return 0;
}

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