# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
533695 | new_acc | Palembang Bridges (APIO15_bridge) | C++14 | 1 ms | 204 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 fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=1e5+10;
pair<ll,ll> t[N];
int main(){
//n^3
int n,k;
cin>>k>>n;
ll res=0;
int l=0;
for(int i=1;i<=n;i++){
char x,d;
ll a,b;
cin>>x>>a>>d>>b;
if(x==d) res+=(ll)abs(a-b);
else t[++l]={a,b},res++;
}
n=l;
vector<ll>v;
for(int i=1;i<=n;i++) v.push_back(t[i].fi),v.push_back(t[i].se);
ll res2=LLONG_MAX;
for(int i=0;i<v.size();i++){
for(int j=i;j<v.size();j++){
ll curr=0;
for(int xd=1;xd<=n;xd++)
curr+=(ll)min(abs(t[xd].fi-v[i])+abs(t[xd].se-v[i]),abs(t[xd].fi-v[j])+abs(t[xd].se-v[j]));
res2=min(res2,curr);
}
}
cout<<res2+res<<"\n";
}
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... |