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 104), 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 (≤ 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
题解:
#include <iostream>
#include <unordered_set>
using namespace std;
const int N = 10010;
struct Edge
{
int a, b;
}e[N];
int color[N];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++)
cin >> e[i].a >> e[i].b;
int q;
cin >> q;
for (int i = 0; i < q; i++)
{
for (int j = 0; j < n; j++) cin >> color[j];
bool isColoring = true;
for (int j = 0; j < m; j++)
if (color[e[j].a] == color[e[j].b])
{
isColoring = false;
break;
}
if (isColoring)
{
unordered_set<int> S;
for (int i = 0; i < n; i++) S.insert(color[i]);
printf("%d-coloring\n", S.size());
}
else puts("No");
}
return 0;
}