PAT Advanced 1154 Vertex Coloring （25 ）

题目描述

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 $10^{}4$​​), 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-coloringif it is a proper k-coloring for some positive k, or Noif 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

解题思路

保存邻接表然后遍历就完事了，哈希用unordered_map.

Code

• AC代码

#include<bits/stdc++.h>
using namespace std;
int N, M;
const int maxn = 1e4+10;
vector<int> edge[maxn];
int color[maxn];
bool judge() {
	for(int i = 0; i<N; i++) {
		for(int j = 0; j<edge[i].size(); j++) {
			if(color[i] == color[edge[i][j]]) {
				return false;
			}
		}
	}
	return true;
}
int main() {
	//freopen("in.txt", "r", stdin);
	cin >> N >> M;
	int u, v, k;
	for(int i = 0; i<M; i++) {
		cin >> u >> v;
		edge[u].push_back(v);
		edge[v].push_back(u);
	}
	cin >> k;
	for(int i = 0; i<k; i++) {
		map<int, int> vis;
		int cnt = 0;
		for(int j = 0; j<N; j++) {
			cin >> color[j];
			if(!vis[color[j]]) {
				vis[color[j]] = 1;
				cnt++; 
			}
		}
		if(!judge()) {
			cout << "No\n";
		} else {
			cout << cnt << "-coloring\n";
		}
	}
	return 0;
}