# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
34183 | nibnalin | Palembang Bridges (APIO15_bridge) | C++14 | 0 ms | 3576 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 <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int lli;
const lli maxn = lli(1e5)+5;
lli S[maxn], T[maxn];
int main(void)
{
lli k, n, res = 0;
char p, q;
scanf("%lld%lld", &k, &n);
vector<lli> A;
for(lli i = 0;i < n;i++)
{
cin >> p >> S[i] >> q >> T[i];
if(p == q) res += abs(S[i]-T[i]);
else
{
res++;
A.push_back(S[i]), A.push_back(T[i]);
}
}
sort(A.begin(), A.end());
lli x = A[lli(A.size())/2];
for(auto it: A) res += abs(it-x);
printf("%lld\n", res);
}
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... |