# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43490 | Fated001 | Palembang Bridges (APIO15_bridge) | C++14 | 3 ms | 696 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;
pair<long long,long long> P[5005];
long long pos[100005];
int main()
{
int k,n;
scanf("%d %d",&k,&n);
if(k==2) assert(0);
long long out=0;
int cnt=0,c=0;
for(int i=1;i<=n;i++)
{
long long a,b;
char s1[2],s2[2];
scanf("%s %lld %s %lld",s1,&a,s2,&b);
if(s1[0]==s2[0]) out+=abs(b-a);
else
{
pos[++cnt]=a;
pos[++cnt]=b;
P[++c]={a,b};
}
}
long long mn=LLONG_MAX;
for(int i=1;i<=cnt;i++)
{
long long tmp=0;
for(int j=1;j<=c;j++)
tmp+=abs(pos[i]-P[j].first)+1+abs(pos[i]-P[j].second);
mn=min(mn,tmp);
}
printf("%lld\n",out+mn);
}
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... |