PAT Advanced 1154 Vertex Coloring （25）

问题描述：

1154 Vertex Coloring （25 分）

A proper vertex coloring is a labeling of the graph's vertices with colors such that no two vertices sharing the same edge have the same color. A coloring using at most k colors is called a (proper) k-coloring.

Now you are supposed to tell if a given coloring is a proper k-coloring.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers N and M (both no more than 10​4​​), being the total numbers of vertices and edges, respectively. Then M lines follow, each describes an edge by giving the indices (from 0 to N−1) of the two ends of the edge.

After the graph, a positive integer K (≤ 100) is given, which is the number of colorings you are supposed to check. Then Klines follow, each contains N colors which are represented by non-negative integers in the range of int. The i-th color is the color of the i-th vertex.

Output Specification:

For each coloring, print in a line k-coloring if it is a proper k-coloring for some positive k, or No if not.

Sample Input:

10 11
8 7
6 8
4 5
8 4
8 1
1 2
1 4
9 8
9 1
1 0
2 4
4
0 1 0 1 4 1 0 1 3 0
0 1 0 1 4 1 0 1 0 0
8 1 0 1 4 1 0 5 3 0
1 2 3 4 5 6 7 8 8 9

Sample Output:

4-coloring
No
6-coloring
No

 

这一题的时间和空间限制都比较宽松，所以直接邻接矩阵+暴力循环判断也能过。。。

这里使用map的好处有两个：第一，在k-coloring时可以输出map.size()代替k；第二，直接判断颜色相同结点之间的邻接关系可以降低比较次数。

AC代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
//	freopen("data.txt","r",stdin);
	int n,m,k1,k2;
	scanf("%d %d",&n,&m);
	vector<bool> v(n*n,0);
	for(;m--;)
	{
		scanf("%d %d",&k1,&k2);
		v[k1*n+k2]=1;
		v[k2*n+k1]=1;
	}
	scanf("%d",&m);
	for(;m--;)
	{
		map<int,vector<int> > ma;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&k1);
			auto it=ma.find(k1);
			if(it==ma.end())
			{
				vector<int> v0(1,i);
				ma.emplace(make_pair(k1,v0));
			}
			else
				(it->second).emplace_back(i);
		}
		bool flag=true;
		for(auto i:ma)
		{
			int s=i.second.size();
			for(int j=0;j<s&&flag;++j)
			for(int k=j+1;k<s&&flag;++k)
			if(v[(i.second)[j]*n+(i.second)[k]])
			flag=false;
			
			if(!flag)
			break;
		}
		if(flag)
		printf("%d-coloring\n",ma.size());
		else
		printf("No\n");
	}
	return 0;
}