解题思路:左上角的点作为上面横线的基点,右上角的点作为右边竖线的基点,右下角的点作为下面横线的基点,左下角的点作为左面竖线的基点,找出规律即可。
#include<bits/stdc++.h>
#define x first
#define y second
#define mem1(h) memset(h,-1,sizeof h)
#define mem0(h) memset(h,0,sizeof h)
#define mcp(a,b) memcpy(a,b,sizeof b)
using namespace std;
typedef long long LL;
typedef unsigned long long ull;
typedef pair<int,int>PII;
typedef pair<double,double>PDD;
namespace IO{
inline LL read(){
LL o=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){o=o*10+c-'0';c=getchar();}
return o*f;
}
}using namespace IO;
const int N=1e5+7,M=2e5+7,INF=0x3f3f3f3f,mod=1e9+9,P=131;
int x,y;
int main(){
int x,y,n;
LL ans;
cin>>x>>y;
if(abs(x)<=y){
n=y;
ans=1ll*(2*n-1)*2*n+(x+n);
}else if(abs(y)<=x){
n=x;
ans=1ll*(2*n)*(2*n)+(n-y);
}else if(abs(x)<=abs(y)+1&&y<0){
n=abs(y);
ans=1ll*2*n*(2*n+1)+(n-x);
}else{
n=abs(x);
ans=1ll*(2*n-1)*(2*n-1)+(y+n-1);
}
cout<<ans<<endl;
return 0;
}