zoukankan      html  css  js  c++  java
  • Codeforces Round #311 (Div. 2) D

    D. Vitaly and Cycle
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    After Vitaly was expelled from the university, he became interested in the graph theory.

    Vitaly especially liked the cycles of an odd length in which each vertex occurs at most once.

    Vitaly was wondering how to solve the following problem. You are given an undirected graph consisting of n vertices and m edges, not necessarily connected, without parallel edges and loops. You need to find t — the minimum number of edges that must be added to the given graph in order to form a simple cycle of an odd length, consisting of more than one vertex. Moreover, he must find w — the number of ways to add t edges in order to form a cycle of an odd length (consisting of more than one vertex). It is prohibited to add loops or parallel edges.

    Two ways to add edges to the graph are considered equal if they have the same sets of added edges.

    Since Vitaly does not study at the university, he asked you to help him with this task.

    Input

    The first line of the input contains two integers n and m ( — the number of vertices in the graph and the number of edges in the graph.

    Next m lines contain the descriptions of the edges of the graph, one edge per line. Each edge is given by a pair of integers aibi(1 ≤ ai, bi ≤ n) — the vertices that are connected by the i-th edge. All numbers in the lines are separated by a single space.

    It is guaranteed that the given graph doesn't contain any loops and parallel edges. The graph isn't necessarily connected.

    Output

    Print in the first line of the output two space-separated integers t and w — the minimum number of edges that should be added to the graph to form a simple cycle of an odd length consisting of more than one vertex where each vertex occurs at most once, and the number of ways to do this.

    Examples
    input
    4 4
    1 2
    1 3
    4 2
    4 3
    output
    1 2
    input
    3 3
    1 2
    2 3
    3 1
    output
    0 1
    input
    3 0
    output
    3 1
    Note

    The simple cycle is a cycle that doesn't contain any vertex twice.

    分情况讨论。二分图、

    重点是 添加一条边的时候。

    /* ***********************************************
    Author        :guanjun
    Created Time  :2016/8/17 22:09:03
    File Name     :cf311d.cpp
    ************************************************ */
    #include <iostream>
    #include <cstring>
    #include <cstdlib>
    #include <stdio.h>
    #include <algorithm>
    #include <vector>
    #include <queue>
    #include <set>
    #include <map>
    #include <string>
    #include <math.h>
    #include <stdlib.h>
    #include <iomanip>
    #include <list>
    #include <deque>
    #include <stack>
    #define ull unsigned long long
    #define ll long long
    #define mod 90001
    #define INF 0x3f3f3f3f
    #define maxn 100010
    #define cle(a) memset(a,0,sizeof(a))
    const ull inf = 1LL << 61;
    const double eps=1e-5;
    using namespace std;
    priority_queue<int,vector<int>,greater<int> >pq;
    struct Node{
        int x,y;
    };
    struct cmp{
        bool operator()(Node a,Node b){
            if(a.x==b.x) return a.y> b.y;
            return a.x>b.x;
        }
    };
    
    bool cmp(int a,int b){
        return a>b;
    }
    vector<int>edge[maxn];
    int in[maxn];
    int col[maxn];
    ll a[4];
    bool dfs(int u){
        a[col[u]]++;
        for(int i=0;i<edge[u].size();i++){
            int v=edge[u][i];
            if(col[u]==col[v])return false;
            if(!col[v]){
                col[v]=3-col[u];
                if(!dfs(v))return false;
            }
        }
        return true;
    }
    int main()
    {
        #ifndef ONLINE_JUDGE
        freopen("in.txt","r",stdin);
        #endif
        //freopen("out.txt","w",stdout);
        ll n,m;
        int x,y;
        cin>>n>>m;
        cle(in);
        for(int i=1;i<=m;i++){
            scanf("%d%d",&x,&y);
            edge[x].push_back(y);
            edge[y].push_back(x);
            in[x]++;
            in[y]++;
        }
        if(m==0){
            cout<<3<<" "<<n*(n-1)*(n-2)/6<<endl;
        }
        else{
            ll mark=0,cnt=0;
            for(int i=1;i<=n;i++){
                if(in[i]>=2){
                    mark=1;break;
                }
                else if(in[i]==1)cnt++;
            }
            if(!mark){
                cout<<2<<" "<<(n-2)*(cnt/2LL)<<endl;return 0;
            }
            cle(col);
            ll ans=0;
            mark=0;
            for(int i=1;i<=n;i++){
                if(col[i]==0){
                    col[i]=1;
                    cle(a);
                    if(dfs(i)){
                        ans+=(ll)(a[1]*(a[1]-1)/2LL+a[2]*(a[2]-1)/2LL);
                    }
                    else {
                        mark=1;break;
                    }
                }
            }
            if(mark) cout<<0<<" "<<1<<endl;
            else cout<<1<<" "<<ans<<endl;
        }
        return 0;
    }
  • 相关阅读:
    ASP.NET WebApi 文档Swagger中度优化
    ASP.NET五步打包下载Zip文件
    JavaScript——HashMap实现
    JS实现集合和ECMA6集合
    JavaScript——双向链表实现
    用JavaScript来实现链表LinkedList
    JavaScript结构三层——思想快速介绍
    浏览器自动刷新——基于Nodejs的Gulp LiveReload与VisualStudio完美结合。
    JavaScript原型OOP——你上车了吗?
    再谈JavaScript闭包及应用
  • 原文地址:https://www.cnblogs.com/pk28/p/5782362.html
Copyright © 2011-2022 走看看