L2-023 graph coloring problem (25 points)

Topic details - L2-023 Graph coloring problem (25 branch ) (pintia.cn)

Ideas ： The meaning of the question is to judge whether it is k Solution of coloring , So use set Save color , Unequal k Time must not be the solution , Then poll whether each adjacent point has the same color

#include<iostream>
#include<vector>
#include<set>
using namespace std;
const int N = 510; 
vector<vector<int>> g(N);
int color[N];

int main(){
    int n,m,k;
    cin>>n>>m>>k;
    while(m--){
        int u,v;
        cin>>u>>v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    int q;
    cin>>q;
    while(q--){
        set<int> s;
        for(int i = 1; i <= n; i++){
            cin>>color[i];
            s.insert(color[i]);
        }
        
        if(s.size() != k) {
            puts("No");
            continue;
        }
        
        bool flag = true;
        for(int i = 1; i <= n; i++) {
			for(int num:g[i])
                if(color[num] == color[i]){
                    flag = false;
                    break;
                }
		}
		
		if(flag) puts("Yes");
        else puts("No");
        
    }
    
    return 0;
}