PAT 甲级 1154 Vertex Coloring
1154 Vertex Coloring （25 point(s)）
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经验总结：
emmm 这是一道送分题，就。。。对于顶点邻接点的遍历吧算是，当然也可以说是图的遍历，只要存在两个邻接顶点颜色一样，就输出No，否则，就输出出现的不同颜色的个数k-coloring， 就这么多啦~另：用unordered_map比map快了不少。。。
AC代码
#include
#include
#include
using namespace std;
const int maxn=10010;
int m,n,k,a,b,vertex[maxn];
vector adj[maxn];
unordered_map mp;
int main()
{
scanf("%d%d",&n,&m);
for(int i=0;i