UVA10004Bicoloring(DFS)二分染色
2014-03-08 23:37
239 查看
Bicoloring |
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 (
![](http://uva.onlinejudge.org/external/100/10004img2.gif)
).
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.
这个题的思路是从0点开始搜索,如果没有染色,就染上与上一个不同的颜色,如果已染色,就判断与上一个颜色是否相同,若相同则说明矛盾,不能二分染色。
#include <stdio.h> #include <string.h> int map[210][210], color[210]; int dfs(int x, int n) { int i; color[0]=1; for(i=0; i<n; i++) { if(!color[i]&&map[x][i]) { color[i]=-color[x]; if(dfs(i,n)) return 1; else return 0; } else if(color[i]&&map[x][i]&&color[x]==color[i]) { return 0; } } return 1; } int main() { int n, m, i, j, a, b; while(scanf("%d",&n)!=EOF&&n) { scanf("%d",&m); memset(color,0,sizeof(color)); memset(map,0,sizeof(map)); while(m--) { scanf("%d%d",&a,&b); map[a][b]=1; map[b][a]=1; } if(dfs(0,n)) printf("BICOLORABLE.\n"); else printf("NOT BICOLORABLE.\n"); } return 0; }
相关文章推荐
- URAL 1156 Two Rounds (DFS二分染色 + 分组背包)
- HDOJ 5971 Wrestling Match【2016大连现场】【dfs二分染色】
- URAL 1156 Two Rounds (DFS二分染色 + DFS枚举 + 剪枝)
- uva 10004 Bicoloring(dfs二分染色,和hdu 4751代码差不多)
- ural1156. Two Rounds(二分染色+dfs)
- HDU 5285 wyh2000 and pupil (DFS染色判二分图 + 贪心)
- POJ 2444 The Accomodation of Students 黑白染色+二分匹配 簡單題
- hihoCoder 1238 : Total Highway Distance(dfs + 二分)
- 1486: [HNOI2009]最小圈 二分+dfs
- NOIP 2010 关押罪犯 二分答案+二分图染色判定 COGS 520
- [二分+DFS]南蛮图腾
- hdu 2444 The Accomodation of Students【二分图染色+最大二分匹配数】
- hdu5971 Wrestling Match(染色法判二分) 2016ACM/ICPC亚洲区大连站
- 【BZOJ 1082】[SCOI2005]栅栏 二分+dfs
- 【二分答案】【DFS】【分类讨论】Gym - 100851F - Froggy Ford
- 51nod oj 1268 和为K的组合【dfs深搜----或二分区间再二分查找】
- hdu 2444 The Accomodation of Students (交叉染色+二分匹配)
- BZOJ 1052 HAOI2007 覆盖问题 二分答案+DFS
- 【AtCoder Grand Contest 007E】Shik and Travel [Dfs][二分答案]
- dfs之地图染色