# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
17345 | comet | Palembang Bridges (APIO15_bridge) | C++98 | 0 ms | 4240 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 <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
int K,N;
ll base;
ll a[200010],sum[200010],sz;
int main(){
scanf("%d%d ",&K,&N);
char tx,ty;
ll x,y;
for(int i=0;i<N;i++){
scanf("%c %lld %c %lld ",&tx,&x,&ty,&y);
//printf("%c %lld %c %lld\n",tx,x,ty,y);
if(tx==ty){
base+=abs(x-y);
}else{
a[++sz]=x;
a[++sz]=y;
base++;
}
}
sort(a+1,a+sz+1);
a[sz+1]=-1;
for(int i=1;i<=sz;i++){
sum[i]=sum[i-1]+a[i];
}
ll ans=1e18;
for(ll i=1;i<=sz;i++){
x=a[i];
while(i<=sz&&a[i+1]==x)i++;
//printf("%lld %d ")
ans=min(ans,sum[sz]-2ll*sum[i]+(2ll*i-sz)*x);
}
printf("%lld",ans+base);
}
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... |