L2-023 图着色问题 (25 分)

#include
#include
#include
using namespace std;

#define MX 1010

int main(){
	int n, m, k;
	cin >> n >> m >> k;
	vector<vector<int>> a(MX,vector<int>(MX));
	for (int i = 0; i < m;++i){
		int u, v;
		cin >> u >> v;
		a[u][v] = a[v][u] = 1;
	}

	vector<int> scheme(MX);

	int nn;
	cin >> nn;
	for (int i = 0; i < nn;++i){
		unordered_map<int, int> mp;
		for (int j = 1; j <= n;++j){
			cin >> scheme[j];
			mp[scheme[j]] = 1;
		}	
		bool suc = true;
		if(int(mp.size())!=k)
			suc = false;
		else
			for (int v = 1; v <= n&&suc;++v)
				for (int w = 1; w <= n&&suc;++w)
					if(a[v][w]&&scheme[v]==scheme[w])
						suc = false;
			puts(suc ? "Yes" : "No");
	}
}