[C++] 축사 배정 - 2188

#include <iostream>
#include <vector>
using namespace std;

const int MAX = 201;

vector<int> v[MAX];
bool c[MAX];
int d[MAX];

bool dfs(int x)
{
	for (int i = 0; i < v[x].size(); i++)
	{
		int s = v[x][i];
        
		if (c[s]) continue;     
		c[s] = true;

		if (d[s] == 0 || dfs(d[s]))
		{
			d[s] = x;
			return true;
		}
	}
	return false;
}

int main()
{
	int N, M;
	cin >> N >> M;

	for (int i = 1; i < N + 1; i++)
	{
		int si, Mn;
		cin >> si;
		for (int j = 0; j < si; j++)
		{
			cin >> Mn;
			v[i].push_back(Mn);
		}
	}
    
	int sum = 0;
	for (int i = 1; i < N + 1; i++)
	{
		fill(c, c + MAX, false);
		if (dfs(i)) sum++;
	}

	cout << sum;
	return 0;
}