Pat class a 1154 vertex shading

Original link

A suitable vertex coloring refers to marking each vertex in the graph with various colors , Make the color of the two ends of each edge different .

If a suitable vertex shading scheme uses a total of k Plant different colors , Call it appropriate k To color （k-coloring).

Now? , You need to decide whether the given coloring scheme is appropriate k Coloring scheme .

Input format
The first line contains two integers N and M, Represent the number of points and edges respectively .

Next M That's ok , Each line contains two integers a,b, Indication point a Sum point b There is an edge between .

Number of all points from 0 To N−1.

The next line contains an integer K, Indicates the coloring scheme you need to judge .

Next K That's ok , Each row contains N One color , Among them the first i The first color represents the second color i The color of a dot .

Colors are represented by non negative integers , No more than int Range .

Output format
For each coloring scheme , If it is a suitable k Coloring scheme , Then output a line k-coloring.

If it is not a suitable coloring scheme , Then output a line No.

Data range
1≤N,M≤104,
1≤K≤100
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

My solution ：

#include <bits/stdc++.h>
using namespace std;
const int N = 10010;
int n, m, k;
struct {
    int a, b;
}Edge[N];
int color[N];
int main(){
    cin >> n >> m;
    for(int i = 0; i < m; i ++ ){
        cin >> Edge[i].a >> Edge[i].b;
    }
    cin >> k;
    while(k --){
        bool success = true;
        for(int i = 0; i < n; i ++ ) cin >> color[i];
        for(int i = 0; i < m; i ++ ){
            if(color[Edge[i].a] == color[Edge[i].b]) success = false;
        }
        if(success){
            unordered_set <int> S;
            for(int i = 0; i < n; i ++ ) S.insert(color[i]);
            printf("%d-coloring\n", S.size());
        }
        else puts("No");
    }
    return 0;
}

Harvest ：

In the array , use unordered_set<int> There are several figures in statistics

Insert the way S.insert()

Traverse the way for(auto c : S)

And set difference ：

set Automatic sorting ,unordered_set Don't automatically sort