CF1060E Sergey and Subway 思维

分两种情况讨论

一种为奇数长为$L$的路径，在经过变化后，我们需要走$\frac{L}{2} + 1$步

一种为偶数长为$L$的路径，在变化后，我们需要走$\frac{L}{2}$步

那么，我们只需要讨论出所有奇数长的路径的个数，再加上原本的路径和，除以2就是答案了

对于奇数长的路径的个数，一定是从奇点走到偶点

对于路径和，考虑每条边的经过次数即可

#include <map>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
namespace remoon {
    #define ri register int
    #define ll long long
    #define tpr template <typename ra>
    #define rep(iu, st, ed) for(ri iu = st; iu <= ed; iu ++)
    #define drep(iu, ed, st) for(ri iu = ed; iu >= st; iu --)
    #define gc getchar
    inline int read() {
        int p = , w = ; char c = gc();
        while(c > '' || c < '') { if(c == '-') w = -; c = gc(); }
        while(c >= '' && c <= '') p = p *  + c - '', c = gc();
        return p * w;
    }
    int wr[], rw;
    #define pc(iw) putchar(iw)
    tpr inline void write(ra o, char c = '\n') {
        if(!o) pc('');
        if(o < ) o = -o, pc('-');
        while(o) wr[++ rw] = o % , o /= ;
        while(rw) pc(wr[rw --] + '');
        pc(c);
    }
}
using namespace std;
using namespace remoon;

#define sid 500050

ll ans;
int n, cnp, num[];
int sz[sid], cap[sid], nxt[sid], node[sid];

inline void addedge(int u, int v) {
    nxt[++ cnp] = cap[u]; cap[u] = cnp; node[cnp] = v;
}

#define cur node[i]
inline void dfs(int o, int fa, int dep = ) {
    sz[o] = ; num[dep] ++;
    for(int i = cap[o]; i; i = nxt[i])
    if(cur != fa) {
        dfs(cur, o, dep ^ );
        sz[o] += sz[cur];
    }
    ans += 1ll * sz[o] * (n - sz[o]);
}

int main() {
    n = read();
    rep(i, , n) {
        int u = read(), v = read();
        addedge(u, v); addedge(v, u);
    }
    dfs(, );
    ans += 1ll * num[] * num[];
    write(ans >> );
    return ;
}