1154 Vertex Coloring

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;
vector<int> v[10000 + 10];
vector<int> color;
map<int, int> mp;
int n, m;
bool bfs(int i, vector<int> &visit){
    queue<int> q;
    q.push(i);
    visit[i] = 1;
    while(!q.empty()){
        int s = q.front();
        q.pop();
        for(int x : v[s]){
            if(color[x] == color[s]) return false;
            if(!visit[x]){
                visit[x] = 1;
                q.push(x);
            }
        }
    }
    return true;
}
bool isvc(){
    vector<int> visit(n, 0);
    for(int i = 0; i < n; ++i){
        if(!visit[i]){
            if(!bfs(i, visit)) return false;
        }
    }
    return true;
}
int main()
{
    scanf("%d %d", &n, &m);
    for(int i = 0; i < m; ++i){
        int x, y;
        scanf("%d %d", &x, &y);
        v[x].push_back(y);
        v[y].push_back(x);
    }
    int k;
    scanf("%d", &k);
    while(k--){
        color.clear();
        color.resize(n);
        mp.clear();
        for(int i = 0; i < n; ++i){
            scanf("%d", &color[i]);
            mp[color[i]] = 1;
        }
        if(isvc()) printf("%lld-coloring\n", mp.size());
        else printf("No\n");
    }
    return 0;
}