# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
29374 | Namnamseo | Palembang Bridges (APIO15_bridge) | C++14 | 0 ms | 2024 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;
typedef pair<int,int> pp;
typedef pair<ll,ll> pll;
void read(int& x){ scanf("%d",&x); }
void read(ll& x){ scanf("%lld",&x); }
template<typename T,typename... Args>
void read(T& a,Args&... b){ read(a); read(b...); }
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
#define x first
#define y second
int k, n;
vector<pp> d;
ll ans_base;
void in(){
read(k, n);
for(int i=1; i<=n; ++i){
char p, q;
int s, t;
auto f = [](){char t; do{t=getchar();}while(t!='A'&&t!='B'); return t;};
p = f(); read(s);
q = f(); read(t);
if(p == q){
ans_base += abs(s - t);
} else {
++ans_base;
d.eb(min(s, t), max(s, t));
}
}
n = d.size();
}
vector<int> pt;
int main()
{
in();
for(auto tmp:d) pt.pb(tmp.x), pt.pb(tmp.y);
sort(all(pt));
ll ans=0; int p=pt[n];
for(auto tmp:d) ans += abs(tmp.x-p) + abs(tmp.y-p);
printf("%lld\n", ans + ans_base);
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... |