洛谷P1328 [NOIP2014 提高组] 生活大爆炸版石头剪刀布进阶解法

#include<iostream>

using namespace std;
int n, a[200], b[200],na,nb,c,d;

void initialize()
{
	int i;
	cin >> n >> na >> nb;
	for (i = 0; i < na; i++)
		cin >> a[i];
	for (; i < n; i++)
		a[i] = a[i - na];
	for (i = 0; i < nb; i++)
		cin >> b[i];
	for (; i < n; i++)
		b[i] = b[i - nb];
}

void compare(int x,int y)
{
	switch (x)
	{
	case 0:
		switch (y)
		{
		case 1:
		case 4:d++; break;
		case 2:
		case 3:c++; break;
		}
		break;
	case 1:
		switch (y)
		{
		case 2:
		case 4:d++; break;
		case 0:
		case 3:c++; break;
		}
		break;
	case 2:
		switch (y)
		{
		case 0:
		case 3:d++; break;
		case 1:
		case 4:c++; break;
		}
		break;
	case 3:
		switch (y)
		{
		case 1:
		case 0:d++; break;
		case 2:
		case 4:c++; break;
		}
		break;
	case 4:
		switch (y)
		{
		case 2:
		case 3:d++; break;
		case 0:
		case 1:c++; break;
		}
	}
}

void operate()
{
	for (int i = 0; i < n; i++)
		compare(a[i], b[i]);
}

void show()
{
	cout << c << ' ' << d;
}

int main()
{
	initialize();
	operate();
	show();
	return 0;
}