题目
思路
水题
代码
#include <iostream>
#include <vector>
#include <set>
using namespace std;
vector<pair<int, int>> edge;
int main()
{
int n, m;
cin >> n >> m;
edge.resize(m);
for (int i = 0; i < m; ++i)
cin >> edge[i].first >> edge[i].second;
int qn;
cin >> qn;
for (int i = 0; i < qn; ++i) {
vector<int> vec;
set<int> s;
vec.resize(n);
for (int j = 0; j < n; ++j) {
cin >> vec[j];
s.emplace(vec[j]);
}
bool mark = false;
for (auto& p : edge) {
if (vec[p.first] == vec[p.second]) {
mark = true;
break;
}
}
if (mark)
cout << "No" << endl;
else
cout << s.size() << "-coloring" << endl;
}
return 0;
}