https://pintia.cn/problem-sets/994805342720868352/problems/1071785301894295552

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<bits/stdc++.h>
using namespace std;
int main(){int N,M,v,w;cin>>N>>M;vector<int>vertex[10000];for(int i=0;i<M;i++){cin>>v>>w;vertex[min(v,w)].push_back(max(v,w));}int judge,color[N];cin>>judge;for(int i=0;i<judge;i++){int flag=0;set<int>s;for(int j=0;j<N;j++){cin>>color[j];s.insert(color[j]);  //将所有颜色都插入到集合中 } for(int j=0;j<N;j++){if(flag==1)break;if(vertex[j].size()!=0){for(int t=0;t<vertex[j].size();t++){if(color[j]==color[vertex[j][t]]){flag=1; //当一条边的两个顶点颜色相同时 break;}}}}if(flag==1)printf("No");else printf("%d-coloring",s.size());if(i!=judge-1)printf("\n");}
}