PAT-A-1154 Vertex Coloring (25分) C/C++实现（图论）

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

• 题目大意：
  给出一个由n个节点和m条边构成的图，图中的每个节点有自己的颜色，对于图中任意一条边，如果边上的两个节点的颜色不同，并且图中一共有k种颜色的节点，那么就输出k-coloring，否则输出No；

• 思路：

  1. 用一个结构体储存每条边的两个节点，用一个数组储存每个节点的颜色；
  2. 遍历所有的边，判断边上的两个节点的颜色是否相同；

#include <iostream>
#include <vector>
#include <set>
using namespace std;
struct Line
{
    int vertice1, vertice2;
};
vector <Line> line;
int main()
{
    int n, m, k;
    cin >> n >> m;
    for (int i = 0; i < m; i++)
    {
        Line temp;
        cin >> temp.vertice1 >> temp.vertice2;
        line.push_back(temp);
    }
    cin >> k;
    while (k-- > 0)
    {
        set <int> dic;
        int color[10000];
        bool flag = true;
        for (int i = 0; i < n; i++)
        {
            cin >> color[i];
            dic.insert(color[i]);
        }
        for (int i = 0; i < m; i++)
        {
            if (color[line[i].vertice1] == color[line[i].vertice2])
            {
                flag = false;
                break;
            }
        }
        
        if (flag)
        {
            cout << dic.size() << "-coloring\n";
        }
        else
        {
            cout << "No\n";
        }  
    }
    return 0;
}