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
不要把问题想得太复杂了- -,其实把结点都存好了,然后把结点的着色情况的用一个数组存好,再比较这些数组,而颜色就是用set类型存储,只要涉及到取出一串数中不一样的数字就用set存
#include<bits/stdc++.h>
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;
}