Submission #3776659

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

unordered_map <int,int> box;

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	// r g b 0 1 2
	int r,g,b;
	int res = 0;
	int idx1 = -100,idx2 = 0,idx3 = 100;

	cin >> r >> g >> b;

	box[idx1] = 0;
	r-=1;
	box[idx2] = 1;
	g-=1;
	box[idx3] = 2;
	b-=1;

	if(r<b)
	{
		int left = -1;
		int right = 1;
		bool turn = true;
		while(g>0)
		{
			if(turn)
			{
				while(1)
				{
					if(box.find(left)==box.end())
					{
						break;
					}
					left--;
				}
				box[left] = 1;
				g--;
				//cout << abs(left) << '\n';
				res += abs(left);
				turn = false;
			}
			else
			{
				while(1)
				{
					if(box.find(right)==box.end())
					{
						break;
					}
					right++;
				}
				box[right] = 1;
				g--;
				//cout << abs(right) << '\n';
				res += abs(right);
				turn = true;
			}
		}	
	}
	else
	{
		int left = -1;
		int right = 1;
		bool turn = false;
		while(g>0)
		{
			if(turn)
			{
				while(1)
				{
					if(box.find(left)==box.end())
					{
						break;
					}
					left--;
				}
				box[left] = 1;
				g--;
				//cout << abs(left) << '\n';
				res += abs(left);
				turn = false;
			}
			else
			{
				while(1)
				{
					if(box.find(right)==box.end())
					{
						break;
					}
					right++;
				}
				box[right] = 1;
				g--;
				//cout << abs(right) << '\n';
				res += abs(right);
				turn = true;
			}
		}	
	}

	// r

	bool flag = false;
	if(box.find(-99)!=box.end())
	{
		flag = true;
	}

	if(flag)
	{
		int left = -101;
		while(r>0)
		{
			while(1)
			{
				if(box.find(left)==box.end())
				{
					break;
				}
				left--;
			}
			box[left] = 0;
			r--;
			//cout << abs(-100 - left);
			res += abs(-100 - left);
		}
	}
	else
	{
		int left = -101;
		int right = -99;
		bool isused = true;
		bool turn = true;
		while(r>0)
		{
			if(isused)
			{
				if(turn==true)
				{
					while(1)
					{
						if(box.find(left)==box.end())
						{
							break;
						}
						left--;
					}
					box[left] = 0;
					r--;
					res += abs(-100 - left);
					turn = false;
				}
				else
				{
					if(box[right]==1)
					{
						isused=false;
					}
					else
					{
						box[right] = 0;
						r--;
						res += abs(-100 - right);
						turn = true;
						right++;
					}
				}

			}
			else
			{
				while(1)
				{
					if(box.find(left)==box.end())
					{
						break;
					}
					left--;
				}
				box[left] = 0;
				r--;
				res += abs(-100 -left);
			}
		}
	}

	flag = false;
	if(box.find(99)!=box.end())
	{
		flag = true;
	}

	if(flag)
	{
		int right = 101;
		while(b>0)
		{
			while(1)
			{
				if(box.find(right)==box.end())
				{
					break;
				}
				right++;
			}
			box[right] = 2;
			b--;
			res += abs(100 - right);
		}
	}
	else
	{
		int left = 99;
		int right = 101;
		bool isused = true;
		bool turn = true;
		while(b>0)
		{
			if(isused)
			{
				if(turn==true)
				{
					while(1)
					{
						if(box.find(right)==box.end())
						{
							break;
						}
						right++;
					}
					box[right] = 2;
					b--;
					res += abs(100 - right);
					turn = false;
				}
				else
				{
					if(box[left]==1)
					{
						isused=false;
					}
					else
					{
						box[left] = 2;
						b--;
						res += abs(100 - left);
						turn = true;
						left--;
					}
				}

			}
			else
			{
				while(1)
				{
					if(box.find(right)==box.end())
					{
						break;
					}
					right++;
				}
				box[right] = 2;
				b--;
				res += abs(100 - right);
			}
		}		
	}

	cout << res << '\n';

	return 0;
}

Submission Info

Judge Result