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

#include<stdio.h>
#include<set>
#include<vector>
using namespace std;
vector<int>adj[10010];
int main(){
	int n,m,i,j,c1,c2,k,flag;
	int color[10010];
	scanf("%d %d",&n,&m);
	for(i=0;i<m;i++){
		scanf("%d %d",&c1,&c2);
		adj[c1].push_back(c2);
		adj[c2].push_back(c1);
	}
	scanf("%d",&k);
	while(k--){
		set<int>s;
		for(i=0;i<n;i++){
			scanf("%d",&color[i]);
			s.insert(color[i]);
		}
		flag=1;
		for(i=0;i<n;i++){
			for(j=0;j<adj[i].size();j++){
				if(color[i]==color[adj[i][j]]){
					flag=0;break;
				}
			}
		}
		if(flag){
			printf("%d-coloring\n",s.size());
		}
		else{
			printf("No\n");
		}
	}
}