树的直径板子

#include <iostream>
#include<map>
#include<set>
#include<algorithm>
#include<stack>
#include<vector>
#include<cmath>
#include<cstring>
#include<queue>
#define ll long long 
#define ull unsigned long long
#define F(i,begin,end) for(ll i=begin;i<=end;i++)
#define F0(a,x,end) for(ll i=0;i<=end;i++){ a[i]=0;}
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const int inf = 0x3f3f3f3f;
const int maxn = 2e5 + 10;
const int mod = 1e9 + 7;
ll T = 1, x, y, x1, y_1, ans,n,s,dp,r,rr,d[maxn],dd[maxn],u,v;
ll nxt[maxn << 1], head[maxn], to[maxn << 1], cnt;
// head[u] 和 cnt 的初始值都为 -1
void add(int u, int v) {
	nxt[++cnt] = head[u];  // 当前边的后继
	head[u] = cnt;         // 起点 u 的第一条边
	to[cnt] = v;           // 当前边的终点
}

string s1, s2, ans_s;

void dfs(ll u,ll fa) {
	d[u] = 0, dd[u] = 0;
	for (ll i = head[u]; i; i = nxt[i]) {
		if (to[i] == fa) continue;
		dfs(to[i],u);
		if (d[to[i]]+1 > d[u]) {
			dd[u] = d[u];
			d[u] = d[to[i]]+1;
		}
		else if (d[to[i]] + 1 > dd[u]) {
			dd[u] = d[to[i]] + 1;
		}
	}
	dp = max(dd[u] + d[u], dp);
}

int main()
{
	IOS;
	cin >> T;
	while (T--) {
		cin >>n>>s>>r>>rr;
		dp = 0;
		for (ll i = 1; i <= n; i++)head[i] = 0;
		cnt = 0;
		for (ll i = 1; i <= n - 1; i++) {
			cin >> u >> v;
			add(u, v);
			add(v, u);
		}
		dfs(s,-1);
		if (rr <= 2*r) cout << "Kangaroo_Splay\n";
		else if (dp <= 2 * r) cout << "Kangaroo_Splay\n";
		else cout << "General_Kangaroo\n";
	}
}