# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
404551 | danielcm585 | Palembang Bridges (APIO15_bridge) | C++14 | 48 ms | 3524 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;
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> ii;
int n, k, s, t;
char p, q;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> k >> n;
ll ans = 0;
vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> p >> s >> q >> t;
if (p == q) ans += abs(s-t);
else {
v.push_back(s);
v.push_back(t);
}
}
sort(v.begin(),v.end());
int mid = v.size()/2;
for (int i = 0; i < v.size(); i++) {
ans += abs(v[mid-1]-v[i]);
}
ans += mid;
cout << ans << '\n';
return 0;
}
/*
1 5
B 0 A 4
B 1 B 3
A 5 B 7
B 2 A 6
B 1 A 7
*/
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... |