PAT甲级1154题（节点染色）

1.题目介绍

vertex：节点

2.考察点，难度

散列类，Vector容器自定义方法，Set容器的运用，难度易

3.解题代码

#include <iostream>
#include <vector>
#include <set>
using namespace std;
struct node {int t1, t2;};

int main() {
    int n, m, k;
    cin >> n >> m;
    vector<node> v(m);
    for (int i = 0; i < m; i++)
        scanf("%d %d", &v[i].t1, &v[i].t2);
    cin >> k;
    while (k--) {
        int a[10009] = {0};
        bool flag = true;
        set<int> se;
        for (int i = 0; i < n; i++) {
            scanf("%d", &a[i]);
            se.insert(a[i]);
        }
        for (int i = 0; i < m; i++) {
            if (a[v[i].t1] == a[v[i].t2]) {
                flag = false;
                break;
            }
        }
        if (flag)
            printf("%d-coloring\n", se.size());
        else
            printf("No\n");
    }
    return 0;
}

4.原题地址

https://pintia.cn/problem-sets/994805342720868352/problems/1071785301894295552