Submission #1322432

#TimeUsernameProblemLanguageResultExecution timeMemory
1322432kawhietPalembang Bridges (APIO15_bridge)C++20
0 / 100
4 ms332 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long

constexpr int inf = 1e18;

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int k, n;
    cin >> k >> n;
    vector<int> pos;
    vector<array<int, 2>> a;
    int sum = 0;
    for (int i = 0; i < n; i++) {
        char p, q;
        int s, t;
        cin >> p >> s >> q >> t;
        pos.push_back(t);
        if (s > t) swap(s, t);
        sum += t - s;
        if (p != q) {
            sum++;
            a.push_back({s, t});
        }
    }
    n = a.size();
    int ans = inf;
    for (auto x : pos) {
        int cur = 0;
        for (auto [l, r] : a) {
            if (r < x) cur += (x - r) * 2;
            if (l > x) cur += (l - x) * 2;
        }
        ans = min(ans, sum + cur);
    }
    cout << ans << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...