maximum matching game on a graph HAMILG.cpp

#include<iostream>
#include<vector>
#include<bits/stdc++.h>
#define lli long long int
#define mod 1000000007
#define pb push_back
#define mk make_pair
#define fastio ios_base::sync_with_stdio(false); cout.tie(NULL);
using namespace std;

vector<int> ar[2001];
int vis[2001],matching[2001];
int matched;

bool DFS(int src)
{
//	cout<<src<<" ";
	vis[src]=1;
	for(auto child : ar[src])
	{
		if(vis[child]==0)
		{
			if(matching[child]==0)
			{
				matching[child]=src;
				matching[src]=child;
				matched=1;
				return true;
			}
			else if(vis[matching[child]]==0 && DFS(matching[child])==true)
			{
				matching[child]=src;
				matching[src]=child;
				matched=1;
				return true;
			}
		}
	}
	return false;
}

void reset(int n)
{
	int i;
	matched=0;
	memset(matching,0,sizeof(matching));
	for(i=1;i<=n;i++)
		ar[i].clear();
}

int main()
{
	fastio;
	int t;
	cin>>t;
	while(t--)
	{
		int n,m,k,a,b,i,j,max_matching=0,win=0,cnt;
		cin>>n>>m;
		reset(n);
		for(i=0;i<m;i++)
		{
			cin>>a>>b;
			ar[a].pb(b);
			ar[b].pb(a);
		}
		for(i=1;i<=n;i++)
		{
			if(matching[i]==0)
			{
				matched=0;
				memset(vis,0,sizeof(vis));
				DFS(i);
				max_matching+=matched;
			}
		}
		for(j=1;j<=n;j++)
		{
			cnt=0;
			memset(matching,0,sizeof(matching));
			for(i=1;i<=n;i++)
			{
				matching[j]=-1;
				vis[j]=1;
				if(matching[i]==0)
				{
					matched=0;
					memset(vis,0,sizeof(vis));
					DFS(i);
					cnt+=matched;
				}
			}
	//		for(i=1;i<=n;i++)
	//			cout<<matching[i]<<" ";
	//		cout<<endl;
	//		cout<<j<<" "<<cnt<<"\n";
			if(cnt==max_matching)
				win++;
		}
		cout<<win<<"\n";
	}
	return 0;
}