Submission #20150067

---

Source Code Expand

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<bitset>
#include<deque>
#include<cstdlib>
#include<set>
#include<ctime>
#define ll long long
#define mp make_pair
using namespace std;
ll read()
{
	ll x=0,f=1;
	char c=getchar();
	while(c>'9'||c<'0')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+c-'0';
		c=getchar();
	}
	return f*x;
}
ll B,C;
ll work1(ll C){
	ll ans=0;
	if(C/2>=B) ans+=abs(B)*2-1;
	else 
	{
		ans+=C/2*2-!(C&1);
	}
	return ans;
}
ll work2(ll C)
{
	return C/2*2-!(C&1);
}
int main()
{	
	B=read(),C=read();
	if(C==1) cout<<2-(B==0)<<'\n';
	else if(!B)
	{
		cout<<1+C/2*2-!(C&1)<<'\n';
	}
	else 
	{
		if(B<0) cout<<work1(C-1)+work2(C)+2<<'\n';
		else cout<<work1(C)+work2(C-1)+2<<'\n';
		
	}
	return 0;
 }

Submission Info

Judge Result