# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
110945 | PeppaPig | Palembang Bridges (APIO15_bridge) | C++14 | 66 ms | 4456 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>
#define long long long
#define pii pair<int, int>
#define x first
#define y second
using namespace std;
const int N = 1e5+5;
int k, n;
long ans;
vector<pii> v;
int main() {
scanf("%d %d", &k, &n);
vector<int> vec;
for(int i = 1; i <= n; i++) {
char a, c; int b, d;
scanf(" %c %d %c %d", &a, &b, &c, &d);
if(b > d) swap(b, d);
if(a == c) ans += d - b;
else {
v.emplace_back(b, d);
if(k == 1) vec.emplace_back(b), vec.emplace_back(d);
}
}
n = v.size();
if(k == 1) {
if(!vec.empty()) {
sort(vec.begin(), vec.end());
int bridge = vec[(vec.size() - 1) / 2];
for(int i = 0; i < vec.size(); i++) ans += abs(bridge - vec[i]);
}
printf("%lld\n", ans + n);
}
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... |