题目:352. 闇の連鎖
分析:
m条边,每一条都会使得树上路径上的每一条边所处的环数++,求和可以用树上差分解决。
每一条边可能处于多个环中,如果处于的环数为0,则ans+=m,若环数为1,则ans++,否则无法通过剪断该边来贡献答案。
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;//三年竞赛一场空,不开long long见祖宗
//typedef __int128 lll;
#define print(i) cout << "debug: " << i << endsl
#define close() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define x first
#define y second
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
const int maxn = 1e5 + 10;
const int inf = 0x3f3f3f3f;
vector<int> g[maxn];
int n, m;
int d[maxn];
int depth[maxn], fa[maxn][17];
void dfs1(int u, int f)
{
for(int v : g[u])
{
if(v == f) continue;
depth[v] = depth[u] + 1;
fa[v][0] = u;
for(int i = 1; i <= 16; i++)
fa[v][i] = fa[fa[v][i - 1]][i - 1];
dfs1(v, u);
}
}
int lca(int x, int y)
{
if(depth[x] < depth[y]) swap(x, y);
for(int i = 16; i >= 0; i--)
if(depth[fa[x][i]] >= depth[y])
x = fa[x][i];
if(x == y) return x;
for(int i = 16; i >= 0; i--)
if(fa[x][i] != fa[y][i])
x = fa[x][i], y = fa[y][i];
return fa[x][0];
}
int ans;
int dfs2(int u, int f)
{
int val = d[u];
for(int v : g[u])
{
if(v == f) continue;
int tmp = dfs2(v, u);
if(tmp == 0) ans += m;
else if(tmp == 1) ans++;
val += tmp;
}
return val;
}
int main()
{
cin >> n >> m;
for(int i = 1; i < n; i++)
{
int x, y; cin >> x >> y;
g[x].pb(y), g[y].pb(x);
}
dfs1(1, -1);
for(int i = 1; i <= m; i++)
{
int x, y; cin >> x >> y;
d[x]++, d[y]++, d[lca(x, y)] -= 2;
}
dfs2(1, -1);
cout << ans << endl;
}