Graph coloring(P1419)

这个题直接暴搜就可以，

一开始我还直接就默认着就用树形DP了，结果在序列号输出的时候就纠结了，

收获：想不到办法的时候就想一下其它的各种方法。

          用压缩了的MP来存储图的连接信息可以提高搜索时间，但没有与vector进行比较过，估计差不多的，可能前者还会优一点点。

就是这样，，

#include<iostream>
#include<vector>
#include<map>
#include<string>
#include<cstdio>
using namespace std;

#define N 101


int e[N],node[N];
int ans;
int ne,nnode;
int n;
int rear[N];
int mp[N][N];
int optiblack[N],black[N];

void dfs(int k,int sum)
{
	int i;
	if (k>nnode)
	{
		if (sum>ans)
		{
			ans=sum;
			for (i=1;i<=nnode;i++)
				optiblack[i]=black[i];
		}
		return ;
	}

	black[k]=-1;
	for (i=0;i<rear[k];i++)
	{
		if (black[mp[k][i]]==-1)
			break;
	}

	if (i==rear[k])
		dfs(k+1,sum+1);
	black[k]=1;
	dfs(k+1,sum);
	black[k]=0;
}

int main()
{
	freopen("C:\in.txt","r",stdin);
	int i,j,k;
	int cases;
	cin>>cases;
	int a,b;
	int cur;
	while (cases--)
	{
		cin>>nnode>>ne;
		memset(rear,0,sizeof(rear));
		while (ne--)
		{
			cin>>a>>b;
			mp[a][rear[a]++]=b;
			mp[b][rear[b]++]=a;
		}
		ans=0;
		dfs(1,0);
		cout<<ans<<endl;
		
		for (i=1;i<=nnode;i++)
		{
			if (optiblack[i]==-1)
				cout<<i<<' ';
		}
		cout<<endl;
	}

	return 0;
}

Language: Graph Coloring Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 3301   Accepted: 1469   Special Judge Description 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 Source Southwestern European Regional Contest 1995