Submission #1175421

---

Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<algorithm>

#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<=n;i++)
#define all(c) c.begin(), c.end()
#define MOD 1000000007
#define MAX 1000000001
#define INF 1410065408
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
struct edge{int from, to; ll cost;};

signed main(){
    ll x, y;
    ll ans = 0;
    cin >> x >> y;
    
    if(x + y == 0){
        cout << 1;
        return 0;
    }
    
    if(x > y){
        x *= -1;
        ans++;
    }
    //cout << x << " " << y << endl;
    
    ll diffa  = min(abs(y - x), abs(abs(y) - x));
    ans += diffa;
    x += diffa;
    //cout << x << " " << y << endl;
    
    if(x !=  y) ans++;
    cout << ans;
}

Submission Info

Judge Result