제출 #1164094

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

bridge

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl "\n";
#define all(x) x.begin(), x.end()
const ll MOD = 1e9+7;
#define int long long

struct House {
    ll location;
    bool isStart;
    bool operator<(const House& other) const {
        return location < other.location;
    }
};

void solve() {
    int k, n; cin >> k >> n;
    if (k == 2) {
        cout << -1 << endl;
        return;
    }
    vector<House> houses;
    ll sum = 0;
    ll initLoss = 0;
    int nonTriv = 0;
    for (int i = 0; i < n; i++) {
        char a; int s; char b; int e;
        cin >> a >> s >> b >> e;
        if (a == b) {
            sum += abs(e-s);
        } else {
            nonTriv++;
            if (s > e) {
                swap(s, e);
            }
            sum += abs(e-s);
            sum++;
            initLoss += s;
            houses.push_back({s, true});
            houses.push_back({e, false});
        }
    }

    sort(all(houses));
    ll minLoss = initLoss;
    ll curLoss = initLoss;
    int left = 0;
    int right = nonTriv;
    for (int i = 0; i < houses.size(); i++) {
        if (i > 0) {
            curLoss -= right * (houses[i].location - houses[i-1].location);
            curLoss += left * (houses[i].location - houses[i-1].location);
        }
        if (houses[i].isStart) {
            right--;
        } else {
            left++;
        }
        
        minLoss = min(minLoss, curLoss);
    }
    cout << sum + minLoss*2 << endl;

}
signed main() {
    ios::sync_with_stdio(0); cin.tie(NULL);
    // freopen("example.in", "r", stdin);
    // freopen("hayfeast.out", "w", stdout);
    int t = 1; // cin >> t;
    while (t--) {
        solve();
    }
}

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