A - Mahmoud and Ehab and the bipartiteness CodeForces - 862B (二分图)(黑白染色)

#include <iostream>
#include <algorithm>
#include <string.h>
#include <cstdio>
#include <string>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
//#include <unordered_map>
#define Fbo friend bool operator < (node a, node b)
#define mem(a, b) memset(a, b, sizeof(a))
#define FOR(a, b, c) for (int a = b; a <= c; a++)
#define RFOR(a, b, c) for (int a = b; a >= c; a--)
#define off ios::sync_with_stdio(0)
#define sc(a) scanf("%lld",&a)
#define pr(a) printf("%lld\n",a);
#define SC(n,m) scanf("%lld%lld",&n,&m)
bool check1(int a) { return (a & (a - 1)) == 0 ? true : false; }

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const int INF = 0x3f3f3f3f;//1e10
const int mod = 1e9 + 7;
const int Maxn = 2e5 + 9;
const int M = Maxn * 20;
const double pi = acos(-1.0);
const double eps = 1e-8;

vector<int>a[Maxn];
int vis[Maxn];
ll t1 = 0, t2 = 0, n;

void dfs(int deep, int t) {
    if (deep & 1)t1++;
    else t2++;
    for (int i = 0; i < a[t].size(); i++) {
        if (!vis[a[t][i]]) {
            vis[a[t][i]] = 1;
            dfs(deep + 1, a[t][i]);
            vis[a[t][i]] = 0;
        }
    }
}

int main() {
    cin >> n;
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v;
        a[u].push_back(v);
        a[v].push_back(u);
    }
    vis[1] = 1;
    dfs(0, 1);
    printf("%lld\n", t1* t2 - (n - 1));
    return 0;
}

#include <iostream>
#include <vector>
using namespace std;
vector<int> v[100005];
long long cnt[2];
void dfs(int node,int pnode,int color)
{
    cnt[color]++;
    for (int i=0;i<v[node].size();i++)
    {
        if (v[node][i]!=pnode)
        dfs(v[node][i],node,!color);
    }
}
int main()
{
    int n;
    scanf("%d",&n);
    for (int i=1;i<n;i++)
    {
        int a,b;
        scanf("%d%d",&a,&b);
        v[a].push_back(b);
        v[b].push_back(a);
    }
    dfs(1,0,0);
    printf("%I64d",cnt[0]*cnt[1]-n+1);
}