Submission #1041507

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

// c++11
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>

#define mp make_pair
#define mt make_tuple
#define rep(i, n) for (int i = 0; i < (n); i++)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

const int INF = 1 << 29;
const double EPS = 1e-9;
const ll MOD = 1000000007;

const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
int x,y;
int nx,ny;
int main() {
  cin >> x >> y;
  nx = abs(x);
  ny = abs(y);
  int result;
  result = 0;
  if (x >= 0 and y < 0){
    if (abs(x) >= abs(y)){
      result++;
      result += abs(nx - ny);
    }else{//abs(x) < abs(y)
      result += abs(nx - ny);
      result++;
    }
  }else if(x >= 0 and y >= 0){
    if (abs(x) >= abs(y)){
      result++;
      result += abs(nx - ny);
      result++;
    }else{//x < y
      result += abs(nx - ny);
    }
  }else if(x < 0 and y >= 0){
    if (abs(x) >= abs(y)){
      result++;
      result += abs(nx - ny);
    }else{//abs(x) < abs(y)
      result += abs(nx - ny);
      result++;
    }
  }else if(x < 0 and y < 0){
    if (abs(x) >= abs(y)){
      result += abs(nx - ny);

    }else{//abs(x) < abs(y)
      result++;
      result += abs(nx - ny);
      result++;
    }
  }
  cout << result << endl;
  return 0;
}

Submission Info

Judge Result