Codeforces Round #311 (Div. 2)--D（图

#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
const int maxv=1e5+40;
ll n,m;
vector<int> G[maxv];
ll cont1[maxv],cont2[maxv];
bool vis[maxv];
bool col[maxv];
int contcomp=0;
bool dfs(int u,bool c){
    if(vis[u]){
        if(col[u]==c){
            return false;
        }else{
            return true;
        }
    }else{
        vis[u]=1;
        bool flag=1;
        col[u]=!c;
        ll *now=(!c?cont1:cont2);
        now[contcomp]++;
        for(int i=0;i<G[u].size();i++){
            flag&=dfs(G[u][i],!c);
        }
        return flag;
    }
}
int main(){
    ///freopen("/home/files/CppFiles/in","r",stdin);
    cin>>n>>m;
    for(int i=0;i<m;i++){
        int f,t;
        scanf("%d%d",&f,&t);
        G[f].pb(t);
        G[t].pb(f);
    }
    if(m==0){
        cout<<"3 "<<n*(n-1)*(n-2)/6<<endl;
        return 0;
    }
    bool flag=1;
    for(int i=1;i<=n;i++) if(G[i].size()>1) flag=0;
    if(flag){
        cout<<"2 "<<(n-2)*m<<endl;
        return 0;
    }
    for(int i=1;i<=n;i++){
        if(!vis[i]){
            contcomp++;
            if(!dfs(i,0)){
                cout<<"0 1"<<endl;
                return 0;
            }
        }
    }
    ll ans=0;
    for(int i=1;i<=contcomp;i++){
        ans+=cont1[i]*(cont1[i]-1)/2+cont2[i]*(cont2[i]-1)/2;
    }
    cout<<"1 "<<ans<<endl;
    return 0;
}