Submission #1139829

#	Time	Username	Problem	Language	Result	Execution time	Memory
1139829		Persia	Palembang Bridges (APIO15_bridge)	C++20	8 / 100	2095 ms	1548 KiB

bridge

#include <bits/stdc++.h>
#define bit(i, x) (x >> i & 1)
#define ll long long
const int N = 2e5 + 5;
const int mod = 998244353;
using namespace std;

int k, n;
vector<int> a;

ll bonus;

signed main(int argc, char* argv[]) {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> k >> n;
    for(int i = 1; i <= n; i++) {
        char p, q; int s, t;
        cin >> p >> s >> q >> t;
        if(s > t) swap(s, t);
        if(p == q) {
            bonus += abs(t - s);
        }
        else {
            bonus++;
            a.push_back(s);
            a.push_back(t);
        }
    }

    sort(a.begin(), a.end());
    n = a.size();
    int m = n / 2;
    bool flag = 1;
    ll res = 0;
    for(int i = 0; i < n; i++) {
        ll val = 0;
        for(int j = 0; j < n; j++) {
            val += abs(a[j] - a[i]);
        }
        if(flag) {
            res = val;
            flag = 0;
        }
        else res = min(res, val);
    }

    cout << res + bonus;

    return 0 ^ 0;
}

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