Submission #1041810

---

Source Code Expand

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <utility>
using namespace std;

#define REP(i,n) for(int i = 0; i < n; i++)
#define MOD 1000000007

int main(int argc, char const *argv[]) {
  int x,y;
  cin >> x >> y;
  bool fugox = true;
  bool fugoy = true;
  if(x < 0) fugox = false;
  if(y <= 0) fugoy = false;
  int absx = abs(x);
  int absy = abs(y);
  if(fugox && fugoy){//両方正
    if(y - x >= 0){
      cout << y-x << endl;
    }else{
      cout << x-y+2 << endl;
    }
  }else if(fugox && !fugoy){
    if(absy >= absx){
      cout << absy-absx+1 << endl;
    }else{
      cout << absx-absy+1 << endl;
    }
  }else if(!fugox && fugoy){
    if(absy >= absx){
      cout << absy-absx+1 << endl;
    }else{
      cout << absx-absy+1 << endl;
    }
  }else{//両方負
    if(absy > absx){
      cout << absy-absx+2 << endl;
    }else{
      cout << absx-absy << endl;
    }
  }
}

Submission Info

Judge Result