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

思路

在解这道题目时要看清楚节点的编号是0到N-1，如果忽视了这一条就可能出错。先使用vector数组将整个无向连通图存储起来，然后比较每一个已经读取到的节点，判断该节点的邻接节点时候和该节点的颜色相同。计算出现到底有几种颜色色就需要用到set容器，在获得节点的颜色序列的过程中将每一种颜色插入到该容器中，最有这个set集合的大小就是这个颜色总数。

#include <iostream>
#include<vector>
#include <map>
#include<set>
using namespace std;
vector<vector<int>> matrix;
vector<int> temp_mat;
set<int> count_set;
bool judge(int vertex) { // 通过使用vector存储的图结构来判断相邻节点时候颜色相同
	int length = matrix[vertex].size();
	for (int i = 0; i < length; i++) {
		if (temp_mat[matrix[vertex][i]] == temp_mat[vertex]) {
			return true;
		}
	}
	return false;
}
int main()
{
	int n, m;
	cin >> n >> m;
	matrix.resize(n + 1);
	for (int i = 0; i < m; i++) {
		int v1, v2;
		cin >> v1 >> v2;
		matrix[v1].push_back(v2);// 构造无向连接图
		matrix[v2].push_back(v1);
	}
	int k;
	cin >> k;
	temp_mat.resize(n + 1);//用于存储颜色序列
	for (int i = 0; i < k; i++) {
		for (int j = 0; j <n; j++) {
			cin >> temp_mat[j];
			count_set.insert(temp_mat[j]);//利用set计算所有出现的颜色总数
		}
		bool flag = false;
		for (int j = 0; j <n; j++) {
			flag = judge(j);
			if (flag == true) break;//如果点着色不可行，就马上终止判断
		}
		if (flag == true) cout << "No" << endl;
		else {
			cout << count_set.size() << "-coloring"<<endl;
		}
		count_set.clear();
	}

	return 0;
}