# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43380 | top34051 | Palembang Bridges (APIO15_bridge) | C++14 | 28 ms | 2304 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;
const int maxn = 1e5 + 5;
int n,k,sz;
int pos[maxn];
int main() {
long long ans = 0;
scanf("%d%d",&k,&n);
for(int i=1;i<=n;i++) {
int x, y;
char t1, t2;
scanf(" %c%d %c%d",&t1,&x,&t2,&y);
if(t1==t2) ans += abs(y-x);
else {
pos[sz++] = x;
pos[sz++] = y;
ans++;
}
}
sort(&pos[0],&pos[sz]);
int opt = pos[sz/2];
// printf("opt %d\n",opt);
for(int i=0;i<sz;i++) ans += abs(opt-pos[i]);
printf("%lld",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... |