1154 Vertex Coloring （25 point(s)）

最新推荐文章于 2025-01-12 12:03:02 发布

原创最新推荐文章于 2025-01-12 12:03:02 发布 · 427 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

PAT甲级专栏收录该内容

6 篇文章

订阅专栏

本文探讨了图论中的k-着色问题，详细解释了如何判断给定的图是否能进行k-着色，并通过代码示例展示了算法的具体实现过程。

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 Nand 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
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条边，题目规定一条边的两个顶点不能同色。有则输出"NO"，否则输出共有几种颜色。代码如下：

#include <iostream>
#include <cstdio>
#include <unordered_set>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=1e4+10;
int col[maxn];
struct vertex{    //创建一个结构体表示一条边的两个顶点
	int x,y;
}graph[maxn];
int main()
{
//	freopen("1154.txt","r",stdin);
	int n,m,k,color;
	scanf("%d %d",&n,&m);
	fill(col,col+n,-1);
	for(int i=0;i<m;i++)
		scanf("%d %d",&graph[i].x,&graph[i].y);    
	scanf("%d",&k);
	for(int i=0;i<k;i++){
		int flag=0;
		unordered_set<int> st;   //用unordered_set去重（不用排序）统计颜色种类（即容器size）
		for(int j=0;j<n;j++){
			scanf("%d",&color);
			col[j]=color;
			st.insert(color);
		}
		for(int j=0;j<m;j++){        //遍历m条边，开始写成n个顶点了，扣了2分
			if(col[graph[j].x]==col[graph[j].y]) {        //如果有不符合条件的将flag置1
				flag=1;
				break;
			}
		}
		if(flag)	printf("No\n");
		else 	printf("%d-coloring\n",st.size());
	}
	return 0;
}