P8090 [USACO22JAN] Herdle B

传送门：P8090 [USACO22JAN] Herdle B。

考虑模拟，记录下答案方阵中每种字符出现次数，然后按照题意模拟。注意要先判断绿色个数再判断黄色个数，绿色优先级更高。

代码：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <map>
using namespace std;

const int N = 5;

char guess[N][N], ans[N][N];

map<char, int> as, gs;

int main()
{
	int green = 0, yellow = 0;
	for (int i = 1; i <= 3; i++)
	{
		for (int j = 1; j <= 3; j++)
		{
			cin >> ans[i][j];
			as[ans[i][j]]++;
		}
	}
	for (int i = 1; i <= 3; i++)
	{
		for (int j = 1; j <= 3; j++)
		{
			cin >> guess[i][j];
		}
	}
	for (int i = 1; i <= 3; i++)
	{
		for (int j = 1; j <= 3; j++)
		{
			if (guess[i][j] == ans[i][j])
			{
				green++; 
				as[guess[i][j]]--;
			}
		}
	}
	for (int i = 1; i <= 3; i++)
	{
		for (int j = 1; j <= 3; j++)
		{
			if (as[guess[i][j]] && guess[i][j] != ans[i][j])
			{
				yellow++;
				as[guess[i][j]]--;
			}
		}
	}
	printf("%d\n%d\n", green, yellow);
	return 0;
}