Submission #564291

#TimeUsernameProblemLanguageResultExecution timeMemory
564291four_specksPalembang Bridges (APIO15_bridge)C++17
22 / 100
46 ms4304 KiB
#include <bits/stdc++.h>

using namespace std;

inline namespace
{
} // namespace

void solve()
{
    int n, k;
    cin >> k >> n;

    vector<long> x;

    long add = 0;
    for (int i = 0; i < n; i++)
    {
        char p, q;
        long s, t;
        cin >> p >> s >> q >> t;

        if (p == q)
            add += abs(s - t);
        else
            add += 1,
            x.push_back(s),
            x.push_back(t);
    }
    sort(x.begin(), x.end());

    int m = (int)x.size();

    long u = x[(m - 1) / 2];

    long sum = add;
    for (long s : x)
        sum += abs(u - s);

    cout << sum << '\n';
}

int main()
{
    ios_base::sync_with_stdio(false), cin.tie(NULL);

    solve();

    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...