Submission #1041212

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}
typedef long long ll;
ll d[4][4];
ll inf=1e18;
ll a[4];
int main(){
	ll x,y;
	cin>>x>>y;
	a[0]=x,a[1]=-x,a[2]=y,a[3]=-y;
	rep(i,4) rep(j,4) d[i][j]=inf;
	rep(i,4) d[i][i]=0;
	rep(i,4) rep(j,4) if(i!=j){
		if((i^1)==j) chmin(d[i][j],1LL);
		if(a[i]<=a[j]) chmin(d[i][j],a[j]-a[i]);
	}
	rep(i,4) rep(j,4) rep(k,4) chmin(d[j][k],d[j][i]+d[i][k]);
	cout<<d[0][2]<<endl;
}

Submission Info

Judge Result