https://www.bnuoj.com/v3/problem_show.php?pid=51645
思路: 对边进行深搜即可
#include <bits/stdc++.h>
#define maxs 2020202
#define mme(i,j) memset(i,j,sizeof(i))
using namespace std;
struct node
{
int u,v;
}ed[2200];
int ans=0;
int n,m;
bool vis[2002];
void dfs(int sum,int total)
{
if(total>10)
return;
if(sum==m)
{
ans=min(ans,total);
return ;
}
if(vis[ ed[ sum ].u ] || vis[ ed[ sum ].v ] )
dfs( sum+1, total);
else{
vis[ ed[sum].u ]=1;
dfs( sum+1,total+1 );
vis[ ed[sum].u ]=0;
vis[ ed[sum].v ]=1;
dfs( sum+1,total+1 );
vis[ ed[sum].v ]=0;
}
return ;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
mme(vis,0);
ans=0x3f3f3f;
scanf("%d %d",&n,&m);
for(int i=0;i<m;i++) scanf("%d %d",&ed[i].u,&ed[i].v);
dfs(0,0);
if(ans>10)
puts("GG");
else
printf("%d\n",ans);
}
return 0;
}