Submission #1054184

#	Time	Username	Problem	Language	Result	Execution time	Memory
1054184		unnick	Palembang Bridges (APIO15_bridge)	C++14	22 / 100	56 ms	1572 KiB

bridge

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef long long int ll;

int main() {
    int k, n;
    cin >> k >> n;
    if (k != 1) return 1;

    vector<int> a;
    // vector<int> ba;
    // vector<int> bb;
    ll sum = 0;

    for (int i = 0; i < n; i++) {
        char sa, sb;
        int ia, ib;
        cin >> sa >> ia >> sb >> ib;
        if (sa == sb) {
            sum += abs(ia-ib);
            continue;
        }
        a.push_back(ia);
        a.push_back(ib);
        sum += 1;
        // ba.push_back(ia);
        // bb.push_back(ib);
    }

    sort(a.begin(), a.end());
    int p = a[a.size() / 2];

    // cout << p << "\n";

    for (auto v : a) {
        sum += abs(v-p);
    }

    cout << sum << "\n";
}

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