zoukankan      html  css  js  c++  java
  • uva 10004 Bicoloring(dfs二分染色,和hdu 4751代码差不多)

    Description

    In 1976 the ``Four Color Map Theorem" was proven with the assistance of a computer. This theorem states that every map can be colored using only four colors, in such 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 ( $0 le a < n$).
    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.

     dfs二分染色,和hdu 4751代码差不多

     1 #pragma comment(linker, "/STACK:1024000000,1024000000")
     2 #include<iostream>
     3 #include<cstdio>
     4 #include<cstring>
     5 #include<cmath>
     6 #include<math.h>
     7 #include<algorithm>
     8 #include<queue>
     9 #include<set>
    10 #include<bitset>
    11 #include<map>
    12 #include<vector>
    13 #include<stdlib.h>
    14 using namespace std;
    15 #define ll long long
    16 #define eps 1e-10
    17 #define MOD 1000000007
    18 #define N 206
    19 #define inf 1e12
    20 int n,m;
    21 vector<int>g[N];
    22 int color[N];
    23 
    24 bool dfs(int u,int c){
    25     color[u]=c;
    26     for(int i=0;i<g[u].size();i++){
    27         int num=g[u][i];
    28         if(color[num]!=-1){
    29             if(color[num]==c){
    30                 return false;
    31             }
    32             continue;
    33         }
    34         if(!dfs(num,!c)) return false;
    35     }
    36     return true;
    37 }
    38 int main()
    39 {
    40     while(scanf("%d",&n)==1 && n!=0){
    41         for(int i=0;i<N;i++){
    42             g[i].clear();
    43         }
    44         scanf("%d",&m);
    45         for(int i=0;i<m;i++){
    46          int u,v;
    47          scanf("%d%d",&u,&v);
    48          g[u].push_back(v);
    49          g[v].push_back(u);
    50       }
    51 
    52         memset(color,-1,sizeof(color));
    53         int flag=1;
    54         for(int i=0;i<n;i++){
    55             if(color[i]==-1 && !dfs(i,0)){
    56                 flag=0;
    57                 break;
    58             }
    59         }
    60         if(flag){
    61             printf("BICOLORABLE.
    ");
    62         }
    63         else{
    64             printf("NOT BICOLORABLE.
    ");
    65         }
    66     }
    67     return 0;
    68 }
    View Code
  • 相关阅读:
    kendoui仪表盘和柱状图 示例
    log4net修改数据库连接字符串和写自定义信息
    为sharepoint的内部页面添加后台代码
    Qt中对QDomDocument和QDomnode的理解
    标准输出中stderr和stdout的区别
    设计一个算法移除字符串中的重复字符,并写出测试用例。
    字符串中单词的逆转,即将单词出现的顺序进行逆转。如将“Today is Friday!”逆转为“Friday! is Today”.
    输入两个很大的正数(用C字符串表示),输出他们的乘积,将设不考虑非法输入。
    微信公众平台的开发过程及其要点
    NR_OPEN 与 NR_FILE 的区别
  • 原文地址:https://www.cnblogs.com/UniqueColor/p/5020381.html
Copyright © 2011-2022 走看看