# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40183 | Abelyan | Palembang Bridges (APIO15_bridge) | C++14 | 5 ms | 2180 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;
#define fr first
#define sc second
#define _mp make_pair
vector <pair<int,int> > v;
int main()
{
ios_base::sync_with_stdio(false);
int k,n,ans=0;
cin>>k>>n;
for (int i=0;i<n;i++){
char c1,c2;
int a,b;
cin>>c1>>a>>c2>>b;
if (c1==c2){
ans+=abs(b-a);
continue;
}
v.push_back(_mp(a,b));
}
if (k==1){
int mn=INT_MAX;
for (int i=0;i<v.size();i++){
int an1=0,an2=0;
for (int j=0;j<v.size();j++){
an1+=abs(v[i].fr-v[j].fr)+abs(v[i].fr-v[j].sc)+1;
}
for (int j=0;j<v.size();j++){
an2+=abs(v[i].sc-v[j].fr)+abs(v[i].sc-v[j].sc)+1;
}
//cout<<an1<<" "<<an2<<endl;
mn=min(mn,min(an1,an2));
}
if (mn==INT_MAX) mn=0;
cout<<ans+mn<<endl;
}
else{
}
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... |