1154 Vertex Coloring (25 分)（set水题）

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <unordered_map> 
using namespace std;

struct node {
	int s, e;
};
int n, m, k, bi[11000];
node arr[11000];
int main()
{
   
	cin >> n >> m;

	for (int i = 0; i<m ; i++) {
		cin >> arr[i].s >> arr[i].e;
	} 
	
	cin >> k;
	
	for (int i = 0; i<k; i++) {
		set<int> s;
		bool flag = true;
		for (int j = 0; j<n; j++) {
			int c;
			cin >> c;
			bi[j] = c;
			s.insert(c);
		}
		for (int j = 0; j<m; j++) {
			if (bi[arr[j].s] == bi[arr[j].e]) {
				printf("No\n");
				flag = false;
				break;
			} 
		}
		if (flag) printf("%d-coloring\n", s.size());
	}
	return 0;
}

标签：node,25,arr,set,水题,int,bi,11000,include
来源： https://blog.csdn.net/NCUscienceZ/article/details/100175805