PAT 1154

最新推荐文章于 2021-09-04 08:02:15 发布

weixin_30660027

最新推荐文章于 2021-09-04 08:02:15 发布

阅读量88

点赞数

原文链接：http://www.cnblogs.com/luoshiyong/p/10098726.html

版权

这道题是水题

#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<map>
using namespace std;
int main()
{
	int n = 0, m = 0;
	cin >> n >> m;
	vector<vector<int> > data(n+2);
	for (int i = 0; i < m; i++)
	{
		int a, b;
		scanf("%d%d",&a,&b);
		data[a].push_back(b);
		data[b].push_back(a);
	}
	int h;
	cin >> h;
	for (int i = 0; i < h; i++)
	{
		set<int> sp; map<int,int> p;
		for (int j = 0; j < n; j++)  //输入每个点的颜色
		{
			int y;
			scanf("%d",&y); sp.insert(y);
			p[j] = y;
		}
		bool is = true;
		for (int k = 0; k < n; k++)  //检查每一个节点是否有颜色相同的节点
		{
			for (int ij = 0; ij < data[k].size(); ij++)
			{
				int dian = data[k][ij];
				int x1 = p[k]; int x2 = p[data[k][ij]];
				if (p[k] == p[data[k][ij]]){
					is = false; break;
				}
			}
			if (is == false)break;
		}
		if (is == false)printf("No");
		else printf("%d-coloring", sp.size());
		if (i != h - 1)printf("\n");
	}


	return 0;
}

转载于:https://www.cnblogs.com/luoshiyong/p/10098726.html