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

思路

• 一道图，但是无需dfs/bfs，只要判断每两个存在边的点是否是同一种颜色
• 顶点数1e4不小，用邻接表存图
• 用set的size判断所使用的的最多颜色数

#include <bits/stdc++.h>
using namespace std;

const int maxn = 10010;
vector<int> eage[maxn];
int color[maxn];
int n, m;

bool isProper()
{
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < eage[i].size(); ++j){
            int k = eage[i][j];
            if(color[i] == color[k])
                return false;
        }
    }
    return true;
}

int main()
{
    scanf("%d%d",&n,&m);
    for(int i = 0; i < m; ++i){
        int a, b;
        scanf("%d%d",&a,&b);
        eage[a].push_back(b);
        eage[b].push_back(a);
    }
    int k;
    set<int> ans;
    scanf("%d",&k);
    while(k--){
        ans.clear();
        for(int i = 0; i < n; ++i){
            int c;
            scanf("%d",&c);
            color[i] = c;
            ans.insert(c);
        }
        if(isProper())
            printf("%d-coloring\n",ans.size());
        else printf("No\n");
    }
    return 0;
}