Codeforces Round #665 (Div. 2)B. Ternary Sequence

#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 3005;
typedef long long ll;
const int inf = 0x3f3f3f3f;

int main()
{
	int t;
	cin >> t;

	while (t--)
	{
		int x1, y1, z1, x2, y2, z2;
		cin >> x1 >> y1 >> z1 >> x2 >> y2 >> z2;
		//对于a数组中的元素，b数组有一个和a数组元素配对的优先级：2和1，1和1，0和2
		int res = 0;
		int t = min(z1, y2);
		res += t * 2;
		z1 -= t, y2 -= t;//2和1

		t = min(z1, z2);
		z1 -= t, z2 -= t;

		t = min(y2, y1);
		y1 -= t, y2 -= t;

		if (y1 == 0)
		{
			cout << res << endl;
			continue;
		}

		t = min(y1, x2);
		y1 -= t, x2 -= t;

		if (y1 == 0)
		{
			cout <<res<< endl;
			continue;
		}

		res -= min(y1, z2) * 2 ;
		

		cout << res << endl;
	}

	return 0;
}