Submission #172853

#	Time	Username	Problem	Language	Result	Execution time	Memory
172853		dolphingarlic	Palembang Bridges (APIO15_bridge)	C++14	22 / 100	57 ms	3568 KiB

bridge

#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int k, n;
    ll ans = 0;
    vector<int> v;
    cin >> k >> n;
    FOR(i, 0, n) {
        char a, b;
        int x, y;
        cin >> a >> x >> b >> y;
        if (a == b) ans += abs(x - y);
        else {
            v.push_back(x);
            v.push_back(y);
        }
    }
    sort(v.begin(), v.end());
    n = v.size();
    ans += n / 2;

    if (k == 1) {
        if (!n) return cout << ans, 0;
        int median = v[n / 2];
        for (int i : v) ans += abs(i - median);
        cout << ans;
    } else {
        
    }
    return 0;
}

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