# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
549788 | ala2 | Palembang Bridges (APIO15_bridge) | C++14 | 0 ms | 212 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>
#define int long long
#define pb push_back
#define F first
#define S second
#define B begin()
#define E end()
using namespace std;
vector<pair<int,int>>v;
int f(int x)
{
int g=0;
for(int i=0;i<v.size();i++)
{
g+=abs(v[i].F-x )+abs(v[i].S-x);
}
return g;
}
signed main()
{
int n,k;
cin>>k>>n;
int ans=0;
for(int i=0;i<n;i++)
{
char x,y;
int a,b;
cin>>x>>a>>y>>b;
if(x==y)
{
ans+=abs(a-b);
}
else v.pb({a,b});
}
sort(v.B,v.E);
int x=v.size()/2;
int l=-3,r=1000000005;
int y=200;
while(y--)
{
int mid1=l+(r-l)/3;
int mid2=l+((r-l)/3)*2;
if(f(mid2)<=f(mid1))
{
l=mid1;
}
else
r=mid2;
}
cout<<min(f(l),f(r))<<endl;
}
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... |