# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47995 | yusufake | Palembang Bridges (APIO15_bridge) | C++98 | 203 ms | 2300 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;
typedef long long ll;
const int N = 1e5 + 5;
ll A[N],B[N],n,k,nn,t,w,i,x,y,l,m1,m2,r,ans;
char c1,c2;
ll g(ll a, ll b){
ll t=0,i;
for(i=1;i<=nn;i++)
t += min( abs(a - A[i]) + abs(a - B[i]) , b == -1 ? 1LL<<55 : abs(b - A[i]) + abs(b - B[i]) ) + 1;
return t;
}
ll f(ll a){
if(k == 1) return g(a,-1);
ll i, l=a+1,m1,m2,r=1LL<<30;
for(i=66; i--;){
m1 = l + (r-l)/3;
m2 = r - (r-l)/3;
if(g(a,m1) > g(a,m2)) l = m1;
else r = m2;
}
ll mn = 1LL<<55;
for(i=l-33; i<l+33; i++)
mn = min(mn , g(a,max(a+1,i)));
return mn;
}
int main(){
cin >> k >> n;
for(i=1;i<=n;i++){
scanf(" %c%d %c%d",&c1,&x,&c2,&y);
if(c1 == c2) { ans += abs(y-x); continue; }
A[++nn] = x; B[nn] = y;
}
l=0; r=1LL<<30;
for(i=66; i--;){
// cout << l << " " << r << " ss\n";
m1 = l + (r-l)/3;
m2 = r - (r-l)/3;
if(f(m1) > f(m2)) l = m1;
else r = m2;
}
ll mn = 1LL<<55;
for(i=l-33; i<l+33; i++)
mn = min(mn , f(i));
cout << ans + mn;
return 0;
}
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... |