# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
365937 | BartolM | Palembang Bridges (APIO15_bridge) | C++17 | 55 ms | 3552 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 X first
#define Y second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
const int INF=0x3f3f3f3f;
int k, n;
ll sol=0;
vector <int> v;
void solve() {
sort(v.begin(), v.end());
// assert(k==1);
int len=v.size();
for (int i=0; i<len; ++i) sol+=abs(v[i]-v[len/2]);
printf("%lld\n", sol+len/2);
}
void load() {
scanf("%d %d", &k, &n);
for (int i=0; i<n; ++i) {
char ca, cb; int a, b;
scanf(" %c %d %c %d", &ca, &a, &cb, &b);
if (ca==cb) sol+=abs(a-b);
else v.pb(a), v.pb(b);
}
}
int main() {
load();
solve();
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... |