Submission #3607627

---

Source Code Expand

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

using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#define vsort_r(v) sort(v.begin(), v.end(), greater<int>())
#define vunique(v) v.erase(unique(v.begin(), v.end()), v.end())
#define mp make_pair
#define ts(x) to_string(x)
#define rep(i, a, b) for(int i = (int)a; i < (int)b; i++)
#define repm(i, a, b) for(int i = (int)a; i > (int)b; i--)
#define bit(a) bitset<8>(a)
#define des_priority_queue priority_queue<int, vector<int>, greater<int> >
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1e18;

#define MAX_V 1000000

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll x, y;
	cin >> x >> y;

	if(x <= y) {
		if(x >= 0 and y >= 0) {
			cout << y - x << endl;
			return 0;
		}
		if(x <= 0 and y >= 0) {
			if(abs(x) <= abs(y)) {
				ll rsl = 1 + y - abs(x);
				cout << rsl << endl;
				return 0;
			} else {
				ll rsl = abs(x) - y + 1;
				cout << rsl << endl;
				return 0;
			}
		}
		if(x <= 0 and y <= 0) {
			ll rsl = abs(x) - abs(y);
			cout << rsl << endl;
			return 0;
		}
	}

	if(x >= 0 and y >= 0) {
		ll rsl = 2 + x - y ;
		cout << rsl << endl;
	}

	if(x >= 0 and y <= 0) {
		if(abs(x) >= abs(y)) {
			ll rsl = 1 + x - abs(y);
			cout << rsl << endl;
			return 0;
		} else {
			ll rsl = 1 + abs(y) - x;
			cout << rsl << endl;
			return 0;
		}
	}

	if(x <= 0 and y <= 0) {
		ll rsl = 2 + abs(y) - abs(x);
		cout << rsl << endl;
		return 0;
	}

}

Submission Info

Judge Result