# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
363425 | luciocf | Palembang Bridges (APIO15_bridge) | C++14 | 1 ms | 512 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;
typedef long long ll;
const int maxn = 1e5+10;
char t[2][maxn];
int pos[2][maxn];
int main(void)
{
int k, n;
scanf("%d %d", &k, &n);
for (int i = 1; i <= n; i++)
scanf(" %c %d %c %d", &t[0][i], &pos[0][i], &t[1][i], &pos[1][i]);
if (k == 1)
{
ll ans = 0;
vector<int> v;
for (int i = 1; i <= n; i++)
{
if (t[0][i] == t[1][i]) ans += 1ll*abs(pos[0][i]-pos[1][i]);
else
{
v.push_back(pos[0][i]);
v.push_back(pos[1][i]);
}
}
int med = v[v.size()/2];
for (auto x: v)
ans += 1ll*abs(x-med);
printf("%lld\n", ans);
}
}
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... |