제출 #1037780

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

bridge

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

using ll = long long;

#define int long long

#define ff  first
#define ss  second
#define pii pair<int, int>

ll f(int x, vector<pii> &v) {
    ll sm = 0;
    for (auto i : v) sm += abs(i.ff - x) + 1 + abs(i.ss - x);
    
    return sm;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);

    int k, n;
    cin >> k >> n;

    ll sm = 0;
    vector<pii> v;
    for (int i = 0; i < n; i++) {
        char p, q;
        int s, t;
        cin >> p >> s >> q >> t;
    
        if (p == q) sm += abs(t - s);
        else {
            if (p != 'A') swap(s, t);
            v.push_back({s, t});
        }
    }

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

    ll ans = LLONG_MAX;
    for (int i = 0; i < (int)v.size(); i++) {
        vector<pii> u1, u2;
        for (int j = 0; j <= i; j++) u1.push_back(v[j]);
        for (int j = i + 1; j < (int)v.size(); j++) u2.push_back(v[j]);

        int l = 0, r = (int)1e9;
        while (l <= r) {
            int md = (l + r) >> 1;
        
            if (f(md, u1) >= f(md + 1, u1)) l = md + 1;
            else r = md - 1;
        }

        int l1 = 0, r1 = (int)1e9;
        while (l1 <= r1) {
            int md = (l1 + r1) >> 1;
        
            if (f(md, u2) >= f(md + 1, u2)) l1 = md + 1;
            else r1 = md - 1;
        }
    
        ans = min(ans, f(l, u1) + f(l1, u2));
    }

    cout << sm + ans;
}

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