You are to write a program that tries to find an optimal coloring for a given graph. Colors are applied to the nodes of the graph and the only available colors are black and white. The coloring of the graph is called optimal if a maximum of nodes is black. The coloring is restricted by the rule that no two connected nodes may be black.
Figure 1: An optimal graph with three black nodes
Input
The graph is given as a set of nodes denoted by numbers 1...n, n <= 100, and a set of undirected edges denoted by pairs of node numbers (n1, n2), n1 != n2. The input file contains m graphs. The number m is given on the first line. The first line of each graph contains n and k, the number of nodes and the number of edges, respectively. The following k lines contain the edges given by a pair of node numbers, which are separated by a space.
Output
The output should consists of 2m lines, two lines for each graph found in the input file. The first line of should contain the maximum number of nodes that can be colored black in the graph. The second line should contain one possible optimal coloring. It is given by the list of black nodes, separated by a blank.
Sample Input
1 6 8 1 2 1 3 2 4 2 5 3 4 3 6 4 6 5 6
Sample Output
3 1 4 5
(思路:因为数据量很小,直接dfs就可以了。从点1搜到点n,如果该点的邻点有一个是黑色,它只能是白色,否则可以是黑色。)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#define ll long long
using namespace std;
const int N=1e2+10;
int head[N],vis[N],cnt,ans[N],res,tmp[N];
int n,k;
struct node{ int to,next; }E[N*N];
void Init()
{
cnt=0;
for(int i=1;i<=n;i++)
vis[i]=head[i]=-1;
}
void add(int u,int v)
{
E[cnt].to=v;
E[cnt].next=head[u];
head[u]=cnt++;
return ;
}
void dfs(int pos,int cnt)
{
if(pos>n)
{
if(res<cnt)
{
res=cnt;
for(int i=0;i<res;i++)
ans[i]=tmp[i];
}
return ;
}
int flag=1;
for(int i=head[pos];i!=-1;i=E[i].next)
{
int v=E[i].to;
if(vis[v]==1)
flag=0;
}
//先涂白色
vis[pos]=0;
dfs(pos+1,cnt);
if(flag)
{
//可以的话涂黑色
vis[pos]=1;
tmp[cnt]=pos;
dfs(pos+1,cnt+1);
}
}
int main(void)
{
int m;
scanf("%d",&m);
while(m--)
{
res=0;
int u,v;
scanf("%d%d",&n,&k);
Init();
while(k--)
{
scanf("%d%d",&u,&v);
add(u,v);
add(v,u);
}
dfs(1,0);
printf("%d\n",res);
for(int i=0;i<res;i++)
printf("%d%c",ans[i],i==res-1?'\n':' ');
}
return 0;
}