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 K lines 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

大意 ：输入m对结点，各个结点都有权，判断各对结点是否权值不同，若是再求权的去重后的个数。
思路：

• 没必要建图，直接对 结点对建立结构体存起来，等把权存好，然后依次检验
• set 的利用 去重，排列，求数量

代码：

#include<iostream>
#include<set>

using namespace std;
struct node{
	int n1;
	int n2;
} v[10010];
int w[10010];

int main(){
	int  n, m, k;
	cin >> n >> m;
	for (int i = 0; i < m; i++){
		cin >> v[i].n1 >> v[i].n2;
	}
	cin >> k;
	for (int i = 0; i < k; i++){
		bool flag = false;

		for (int j = 0; j < n; j++){
			cin >> w[j];
			s.insert(w[j]);
		}
		for (int l = 0; l < m; l++){
			if (w[v[l].n1] == w[v[l].n2])
				flag = true;
				break;
		}
		if (flag == true) cout << "No" << endl;
		else cout << s.size() << "-coloring" << endl;
	}
	system("pause");
	return 0;
}