题解

（请在此补充题目的中文题解与思路描述。）

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n, n1, n2;
	cin >> n >> n1 >> n2;
	queue<int> q1, q2;
	for (int i = 1; i <= n1; i++)
	{
		int a;
		cin >> a;
		q1.push(a);
	}
	for (int i = 1; i <= n2; i++)
	{
		int a;
		cin >> a;
		q2.push(a);
	}
	int cnt1 = 0, cnt2 = 0;
	while (n--)
	{
		int a = q1.front(), b = q2.front();
		q1.pop(), q2.pop();
		q1.push(a), q2.push(b);
		if (a == b)
			continue;
		if (a == 0)
		{
			if (b == 2 || b == 3)
				cnt1++;
			else
				cnt2++;
		}
		else if (a == 1)
		{
			if (b == 0 || b == 3)
				cnt1++;
			else
				cnt2++;
		}
		else if (a == 2)
		{
			if (b == 1 || b == 4)
				cnt1++;
			else
				cnt2++;
		}
		else if (a == 3)
		{
			if (b == 2 || b == 4)
				cnt1++;
			else
				cnt2++;
		}
		else
		{
			if (b == 0 || b == 1)
				cnt1++;
			else
				cnt2++;
		}
	}
	cout << cnt1 << " " << cnt2;
	return 0;
}