# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
921896 | Ludissey | Palembang Bridges (APIO15_bridge) | C++14 | 169 ms | 860 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
using namespace std;
vector<pair<int,int>> notSame; // min et le max
int N;
struct traj {
int l,r;
int mid;
};
vector<traj> a;
int calculate(int x1, int x2){
int s=0;
for (int i = 0; i < a.size(); i++)
{
int s1=abs(x1-a[i].l)+1+abs(x1-a[i].r);
int s2=abs(x2-a[i].l)+1+abs(x2-a[i].r);
s+=min(s1,s2);
}
return s;
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int n,k; cin >> k >> n;
N=n;
int sum=0;
vector<int> b;
for (int i = 0; i < n; i++){
char p,q; int s,t; cin >> p >> s >> q >> t;
if(p!=q) {
double mid=(((double)s+(double)t)/(double)2);
traj element=traj{s, t, mid};
a.push_back(element);
b.push_back(s);
b.push_back(t);
}else {
sum+=abs(s-t);
}
}
sort(b.begin(),b.end());
N=a.size();
int mn=1e12;
if(N==0) mn=0;
for (int i = 0; i < 2*N; i++)
{
int l=0,r=(2*N)-1;
while((r-l)>1){
int midLEFT=l+(r-l)/3;
int midRIGHT=r-(r-l)/3;
if(calculate(b[i], b[midLEFT])>calculate(b[i], b[midRIGHT])){
l=midLEFT+1;
}else{
r=midRIGHT-1;
}
}
for (int j = l; j <= r; j++)
{
mn=min(mn,calculate(b[i],b[j]));
}
}
cout << mn+sum << "\n";
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... |