PTA甲级 1154 Vertex Coloring (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(\le 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

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-31 11:07:59
// All rights reserved.

#include <iostream>
#include <vector>
#include <unordered_map>

using namespace std;

int main(){
    int n, m;
    scanf("%d %d", &n, &m);

    vector<vector<int>> edges(n);
    for(int i = 0; i < m; ++i){
        int id1, id2;
        scanf("%d %d", &id1, &id2);

        edges[id1].push_back(id2);
    }

    int k;
    scanf("%d", &k);
    for(int i = 0; i < k; ++i){
        unordered_map<int, bool> validColors;
        unordered_map<int, int> colorsPairs;
        int cnt = 0;
        bool valid = true;

        for(int j = 0; j < n; ++j){
            int color;
            scanf("%d", &color);

            if(validColors[color] == false){
                cnt++;
                validColors[color] = true;
            }

            colorsPairs[j] = color;
        }

        for(int j = 0; j < n; ++j){
            int tmp = colorsPairs[j];
            for(int k = 0; k < edges[j].size(); ++k){
                if(tmp == colorsPairs[edges[j][k]]){
                    valid = false;
                    break;
                }
            }
        }

        if(valid) printf("%d-coloring\n", cnt);
        else printf("No\n");
    }


    return 0;
}