P3806 【模板】点分治1

Tearsゆ

于 2022-09-13 11:50:00 发布

阅读量87

点赞数

文章标签：算法 c++ 图论

本文链接：https://blog.csdn.net/qq_61305213/article/details/126830612

版权

本文探讨了如何利用C++编程实现图论算法，解决社交网络中的路径寻找和社区划分问题。通过`vector`和`adjacency_list`等数据结构，作者展示了如何计算最短路径、度数优先搜索和中心节点检测，揭示了在社交网络分析中的关键作用。

摘要由CSDN通过智能技术生成

#include <bits/stdc++.h>
using namespace  std;
//#define  int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define pb  push_back
#define inf 1ll<<62
#define endl "\n"
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define de_bug(x) cerr << #x << "=" << x << endl
#define all(a) a.begin(),a.end()
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--)
const int mod = 1e9 + 7;
const int N = 1e7 + 10;
const int M = 1e7 + 10;
int n, k;
int ans[N], cnt, idx2;
int h[N], e[M], ne[M], w[M];
int vis[N];
int m;
int p[N];
int q[N];
int a[N];
int dp[N];

void add(int a, int b, int c) {
	e[cnt] = b, w[cnt] = c, ne[cnt] = h[a], h[a] = cnt++;
}
void get_dis(int u, int fa, int dis, int& idx) {
	if(vis[u] )return ;
	q[idx++] = dis;
	for(int i = h[u]; ~i; i = ne[i]) {
		int v = e[i];
		if(v == fa)continue;
		get_dis(v, u, dis + w[i],  idx);
	}
}
int  get_sz(int u, int fa) {
	if(vis[u])return 0;
	int ans = 1;
	for(int i = h[u]; ~i; i = ne[i]) {
		int v = e[i];
		if(v == fa)continue;
		ans += get_sz(v, u);
	}
	return ans;
}
int  get_wc(int u, int fa, int tot, int &wc ) {
	if(vis[u])return 0;
	int sum = 1;
	int ma = 0;
	for(int i = h[u]; ~i; i = ne[i]) {
		int v = e[i];
		if(v == fa)continue;
		int t = get_wc(v, u, tot, wc);
		ma = max(ma, t);
		sum += t;
	}
	ma = max(ma, tot - sum);
	if(ma <= tot / 2) {
		wc = u;
	}
	return sum;
}
void calc(int u) {
	if(vis[u])return ;
	get_wc(u, -1, get_sz(u, -1), u);
	vis[u] = 1;
	dp[0] = 1;
	int idx1 = 0;
	for(int i = h[u]; ~i; i = ne[i]) {
		int v = e[i];
		if(vis[v])continue;
		idx2 = 0;
		get_dis(v, u, w[i], idx2);
		for(int j = 0; j < idx2; j++) {
			for(int k = 0; k < m; k++) {
				if(a[k] >= q[j]) {
					ans[k] |= dp[a[k] - q[j]];
				}
			}
		}
		for(int j = 0; j < idx2; j++) {
			p[idx1++] = q[j];
			dp[q[j]] = 1;
		}
	}
	for(int i = 0; i < idx1; i++) {
		dp[p[i]] = 0;
	}
	for(int i = h[u]; ~i; i = ne[i]) {
		int v = e[i];
		calc(v);
	}
}
void solve() {
	cin >> n >> m;
	memset(h, -1, sizeof(h));
	fer(i, 1, n - 1) {
		int a, b, c;
		cin >> a >> b >> c;
		add(a, b, c);
		add(b, a, c);
	}
	for(int i = 0; i < m; i++) {
		cin >> a[i];
	}
	calc(1);
	for(int i = 0; i < m; i++) {
		if(ans[i])cout << "AYE" << endl;
		else cout << "NAY" << endl;
	}
}
int main() {
	IOS;
	int _ = 1;
	//cin>>_;
	while( _-- )
		solve();
}