UVA 10004 Bicoloring
2015-12-29 11:12
423 查看
Bicoloring |
a way that no region is colored using the same color as a neighbor region.
Here you are asked to solve a simpler similar problem. You have to decide whether a given arbitrary connected graph can be bicolored. That is, if one can assign colors (from a palette of two) to the nodes in such a way that no two adjacent nodes have the same
color. To simplify the problem you can assume:
no node will have an edge to itself.
the graph is nondirected. That is, if a node a is said to be connected to a node b, then you must assume that b is connected to a.
the graph will be strongly connected. That is, there will be at least one path from any node to any other node.
Input
The input consists of several test cases. Each test case starts with a line containing the number n ( 1< n < 200) of different nodes. The second line contains the number of edges l.
After this, l lines will follow, each containing two numbers that specify an edge between
the two nodes that they represent. A node in the graph will be labeled using a number a (
).
An input with n = 0 will mark the end of the input and is not to be processed.
Output
You have to decide whether the input graph can be bicolored or not, and print it as shown below.Sample Input
3 3 0 1 1 2 2 0 9 8 0 1 0 2 0 3 0 4 0 5 0 6 0 7 0 8 0
Sample Output
NOT BICOLORABLE. BICOLORABLE.
Miguel Revilla
2000-08-21
二分图染色,边搜索边染0 1色就行
#include<iostream> #include<cstdio> #include<algorithm> #include<cstring> using namespace std; int n,m; const int maxn=210; int map[maxn][maxn],vis[maxn]; bool col[maxn]; int dfs(int x) { for(int i=0;i<n;i++) { if(map[x][i]) { if(!vis[i]) { vis[i]=1; col[i]=!col[x]; dfs(i); } else if(col[i]==col[x]) { return 0; } } } return 1; } int main() { while(scanf("%d",&n)&&n) { scanf("%d",&m); memset(col,-1,sizeof(col)); memset(vis,0,sizeof(vis)); memset(map,0,sizeof(map)); int u,v; for(int i=0;i<m;i++) { scanf("%d%d",&u,&v); map[u][v]=1; map[v][u]=1; } col[0]=1; vis[0]=1; if(dfs(0)) printf("BICOLORABLE.\n"); else printf("NOT BICOLORABLE.\n"); } return 0; }
相关文章推荐
- 计算二值图像的重心坐标并绘制重心
- UIImageView填充裁剪
- PHP实现批量上传单个文件
- Fragment详解之一——概述
- 文章标题
- Crazypony四轴飞行器代码框架
- 本地存储数组
- 通过/proc/net/dev和/proc/net/snmp分析网络包量|流量|错包|丢包以及各网络协议的工作状况
- SVG与HTML、JavaScript的三种调用方式
- Math对象很方便但易被忽略的方法--javascript
- 最大化窗口driver.manage().window().maximize();
- 备份和恢复
- Jsoup解析HTML实例及文档方法详解
- Android-connectivity连接
- 在 Cocos2d-js 中使用 Node.js 模块
- android中的webview遇到的各种坑
- <context:property-placeholder/>使用说明
- mysql 转SqlServer
- 利用StringEscapeUtils对字符串进行各种转义与反转义(Java)
- codevs3119 高精度练习之大整数开根