P1475 控制公司 Controlling Companies

https://www.luogu.org/problemnew/show/P1475

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll ,ll > P;
#define INF 0xf3f3f3f
const int Max=10000+10;
int num,n,a[110][110];
int sum[Max];
bool vis[Max];
void dfs(int x) {
	vis[x]=1;
	for(int i=1; i<=num; i++) {
		sum[i]+=a[x][i];
		if(sum[i]>50&&!vis[i])
			dfs(i);
	}

}
int main() {
	scanf("%d",&n);
	int x,y,z;
	num=0;
	for(int i=0; i<n; i++) {
		scanf("%d%d%d",&x,&y,&z);
		a[x][y]+=z;
		num=max(num,y);
		num=max(num,x);
	}
	for(int i=1; i<=num; i++) {
		memset(vis,0,sizeof vis);
		memset(sum,0,sizeof sum);
		dfs(i);
		for(int j=1; j<=num; j++)
			if(j!=i&&sum[j]>50)
				printf("%d %d\n",i,j);
	}

	return 0;
}

猜你喜欢

转载自blog.csdn.net/PinkAir/article/details/81625034