PAT甲级1154 Vertex Coloring (25 分)

最新推荐文章于 2020-08-10 20:52:47 发布

rf4csdm

最新推荐文章于 2020-08-10 20:52:47 发布

阅读量139

点赞数

分类专栏： PAT甲级文章标签： PAT

本文链接：https://blog.csdn.net/qq_42306885/article/details/100604299

版权

PAT甲级专栏收录该内容

158 篇文章 0 订阅

订阅专栏

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 104), 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

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

题目大意：

给出n个结点m条边的图，随后有k次着色，要求一条边上的两个点要有不同的颜色，询问最多能有多少种颜色。

思路：

关于边的算法，用临接矩阵存储，枚举每一条边，如果同一边的两点是相同颜色的，就令flag = false，输出No，所有边都不同的时候就输出color，color在录入颜色的时候就记录了不同的颜色。

参考代码：

#include<vector>
#include<cstdio>
#include<set>
using namespace std;
struct node{
	int v1, v2;
};
vector<node> list; 
int main(){
	int n, m, k;
	scanf("%d%d", &n, &m);
	list.resize(n);
	for(int i = 0; i < m; ++i) scanf("%d%d", &list[i].v1, &list[i].v2);
	scanf("%d", &k);
	for(int i = 0; i < k; ++i){
		bool flag = true;
		vector<int> w(n);
		set<int> color;
		for(int j = 0; j < n; ++j) scanf("%d", &w[j]), color.insert(w[j]);
		for(int j = 0; j < m; ++j)
			if(w[list[j].v1] == w[list[j].v2]){
				flag = false;
				break;
			}
		if(!flag) printf("No\n");
		else printf("%d-coloring\n", color.size());
	}
	return 0;
}

代码参考：https://blog.csdn.net/liuchuo/article/details/84973030