2019西安邀请赛 J and and and(树上启发式合并）

链接 https://nanti.jisuanke.com/t/39277
分两种情况讨论即可，路径为一条链和不为一条链的即可
启发式合并维护 ologn

ac代码

#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>

#define fi first
#define se second
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define pb push_back
#define MP make_pair
#define all(v) v.begin(),v.end()
#define clr(a) memset(a,0,sizeof(a))
#define FIN freopen("in.txt","r",stdin)
using namespace std;

typedef double db;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> VI;
typedef vector<pii> VP;
#define LL long long
#define debug1(x) cout<<"["<<#x<<" "<<(x)<<"]\n"
#define debug2(x, y) cout<<"["<<#x<<" "<