codeforces 557d

题目意思：添加一些边，使得图有一个边数是奇数的环~~~

根据题目的意思，添加的边数只有0、1、2、3
1、当图本身有奇数边的环的时候 输出 0 1
2、当然m==0时，输出3 n*(n-1)*(n-2)/6
3、当所有的边都没有公共点时，输出2 m*(n-2)
4、那么接下来就是输出1的情况了
2、3情况可以优先判断
1、4情况需要染色来判断

#include <map>
#include <set>
#include <queue>
#include <stack>
#include <math.h>
#include <vector>
#include <cstdio>
#include <string>
#include<string.h>
#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;
#define exp 1e-8
#define INF 0x3f3f3f3f
#define ll __int64
#define set(a,b) memset(a,b,sizeof(a));
#define set(a,b) memset(a,b,sizeof(a));
#define for1(a,b) for(int a=1;a<=b;a++)//1---(b)
#define for0(a,b) for(int a=0;a<=b;a++)//0---(b)
void bug(string st="bug")
{cout<<st<<endl;}
template<typename __ll>
inline void READ(__ll &m){
    __ll x=0,f=1;char ch=getchar();
    while(!(ch>='0'&&ch<='9')){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    m=x*f;
}
template<typename __ll>
inline void read(__ll &m){READ(m);}
template<typename __ll>
inline void read(__ll &m,__ll &a){READ(m);READ(a);}
template<typename __ll>
inline void read(__ll &m,__ll &a,__ll &b){READ(m);READ(a);READ(b);}
const int cnt_edge=2*100000+100;  //Ð޸İ¡
const int cnt_v=100000+100;
int head[cnt_v],cnt;
int num[cnt_v];
struct EDGE
{
    int u,v,next,cost;
}edge[cnt_edge];
void addedge(int u,int v,int cost=0)
{
    edge[cnt].u=u;
    edge[cnt].v=v;
    edge[cnt].cost=cost;
    edge[cnt].next=head[u];
    head[u]=cnt++;
    num[u]++;
}
void init()  ³õʼ»¯°¡
{
    cnt=0;
    memset(head,-1,sizeof(head));
}
int n,m;
bool flag=0;
int vis[100000+100],belong[100000+100],top=0;
int kk[cnt_v];
void dfs(int u)
{
    top++;
    queue<int>que;
    que.push(u);
    vis[u]=1;
    belong[u]=top;
    while(!que.empty())
    {
        u=que.front();
        que.pop();
        for(int i=head[u];i!=-1;i=edge[i].next)
        {
            int v=edge[i].v;
            if(vis[v]==0)
            {
                vis[v]=3-vis[u];
                belong[v]=top;
                que.push(v);
            }
            else if(vis[v]==vis[u])flag=1;//形成奇数边的环
        }
    }
}
ll solve(int t)
{
    set(kk,0);
    for1(i,n)if(vis[i]==t)kk[belong[i]]++;
    ll sum=0;
    for1(i,top)
        sum+=(ll)kk[i]*(kk[i]-1)/2;
    return sum;
}
int main()
{
    read(n,m);
    if(m==0)printf("3 %I64d\n",(ll)n*(n-1)*(n-2)/6);
    else
    {
        init();
        for1(i,m)
        {
            int a,b;read(a,b);
            addedge(a,b);
            addedge(b,a);
        }
        flag=0;
        for1(i,n)if(vis[i]==0)dfs(i);
        if(flag==1)
        {
            printf("0 1\n");
            return 0;
        }
        flag=0;
        for1(i,n)if(num[i]>=2)flag=1;
        if(flag==0)
            printf("2 %I64d\n", (ll)m*(n-2));
        else printf("1 %I64d\n",(ll)(solve(1)+solve(2)));
    }
    return 0;
}