【PAT】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

 

为了接受颜色类型的大小是int，使用了map进行匹配，把大数匹配到连续的小数，绕的好远，不过这个逻辑在python等高级语言中的dict类型倒是蛮好想到的，在std中用map感觉比较复杂。

ps：边的遍历的问题，因为以节点为中心存图，所以就麻烦了点，如果以边为中心构图，遍历边两端的节点即可。

#include <iostream>
#include <set>
#include <map>
#include <vector>
using namespace std;

int g[10000][10000];
struct _node{
    vector<int> v;
}c[10000];
set<int> s;
map<int, int> mp;

int main(){
  //  freopen("test.txt","r",stdin);
    int n,m;
    cin>>n>>m;
    int a,b,d;
    while(m--){
        scanf("%d %d", &a, &b);
        g[a][b]=g[b][a]=1;
    }
    cin>>m;
    while (m--){
        a=1;
        b=0;
        d=0;
        for (int i=0;i<n;++i) c[i].v.clear();
        s.clear();
        mp.clear();
        for (int i=0;i<n;++i){
            scanf("%d", &b);
            if (a==0) continue;
            if (!mp.count(b)) mp.insert(pair<int, int>(b, d++));
            for (u_int j=0;j<c[mp.find(b)->second].v.size();++j){
                if (g[i][c[mp.find(b)->second].v[j]]==1) a=0;
            }
            c[mp.find(b)->second].v.push_back(i);
            s.insert(b);
        }
        if (a==0) cout<<"No"<<endl;
        else cout<<s.size()<<"-coloring"<<endl;
    }
    return 0;
}