Helix distance of point

Original link

Ideas ：

• For point $A(x,y)$, First, determine which area the point belongs to
  

• Then find out where the point is “ ray ” The endpoint of $B(a,b)$（ find Endpoint coordinates and $(x,y)$ The relationship between ）
  

• Looking for a regular , Find out $B$ The distance to the origin $|BO|$
  

• seek $|AO|$ Turn into ：$|AO|=|BO|+|AB|$

#include <iostream>
using namespace std;
typedef long long LL;

int main()
{
    
    int x, y;
    cin >> x >> y;

    int a, b; // Endpoint coordinates of rays 
    LL d; // The distance from the endpoint to the origin 

    if (-y <= x && x <= y)  //  On the top 
    {
    
        a = -y, b = y;
        d = (LL)2 * abs(a) * (2 * abs(a) - 1);
        cout << d + x - a;
    }
    else if (-x <= y && y <= x)  //  On the right 
    {
    
        a = x, b = x;
        d = (LL)2 * a * 2 * a;
        cout << d + b - y;
    }
    else if (y - 1 <= x && x <= -y)  //  Below 
    {
    
        a = -y, b = y;
        d = (LL)2 * abs(a) * (2 * abs(a) + 1);
        cout << d + a - x;
    }
    else  //  On the left 
    {
    
        a = x, b = x + 1;
        d = (LL)(2 * abs(a) - 1) * (2 * abs(a) - 1);
        cout << d + y - b;
    }

    return 0;
}