# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
110205 | SamAnd | Palembang Bridges (APIO15_bridge) | C++17 | 140 ms | 6636 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int k, n;
long long ans;
vector<int> a;
long long p[N * 2], s[N * 2];
int main()
{
cin >> k >> n;
for (int i = 1; i <= n; ++i)
{
char xx;
int x;
char yy;
int y;
cin >> xx >> x >> yy >> y;
if (xx == yy)
ans += abs(x - y);
else
{
a.push_back(x);
a.push_back(y);
}
}
sort(a.begin(), a.end());
ans += (a.size() / 2);
for (int i = 1; i < a.size(); ++i)
p[i] = p[i - 1] + (a[i] - a[i - 1]) * 1LL * i;
for (int i = a.size() - 2; i >= 0; --i)
s[i] = s[i + 1] + (a[i + 1] - a[i]) * 1LL * (a.size() - i - 1);
long long pans = p[0] + s[0];
for (int i = 1; i < a.size(); ++i)
pans = min(pans, p[i] + s[i]);
cout << ans + pans << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |