bfs——控制公司

原文链接：https://www.luogu.com.cn/problem/P1475

AC代码：

#include<iostream>
#include<string.h>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
int n,mapp[505][505],lowc[1005],visit[1005],num=1;
map<int,int> Map;
map<int,int> Map1;
int head[1005],cnt=0;
vector<int> vec;
typedef struct node{
	int x,y;
}node;
node nod;
vector<node> con;
typedef struct edged{
	int fr,to,next,w;
}edged;
edged edge[10005];
void add(int u,int v,int w){
	edge[cnt].fr=u;
	edge[cnt].to=v;
	edge[cnt].w=w;
	edge[cnt].next=head[u];
	head[u]=cnt;
	cnt++;
}
int cmp(const node &a,const node &b){
	if(a.x!=b.x) return a.x<b.x;
	else return a.y<b.y;
}
void bfs(int x){
	int i,j;
	while(vec.size()!=0){
		int now=vec[0];vec.erase(vec.begin());
		for(i=head[now];i!=-1;i=edge[i].next){
			int e=edge[i].to;
			if(e==x) continue;
			if(lowc[e]>50&&visit[e]==1) continue;
			if(now==x){
				lowc[e]+=edge[i].w;
				if(lowc[e]>50){
					visit[e]=1;
					mapp[x][e]=1;
					vec.push_back(e);
				}
			}
			else if(mapp[x][now]==1){
				lowc[e]+=edge[i].w;
				if(lowc[e]>50){
					visit[e]=1;
					mapp[x][e]=1;
					vec.push_back(e);
				}
			}
			//cout<<x<<" "<<now<<" "<<e<<" "<<lowc[e]<<endl;
		}
	}
}
int main(){
	int i,j;
	memset(mapp,0,sizeof(mapp));
	memset(head,-1,sizeof(head));
	cin>>n;
	for(i=0;i<n;i++){
		int p,q,r;
		cin>>p>>q>>r;
		if(Map.find(p)==Map.end()){
			Map.insert(pair<int,int>(p,num));
			Map1.insert(pair<int,int>(num,p));
			num++;
		}
		if(Map.find(q)==Map.end()){
			Map.insert(pair<int,int>(q,num));
			Map1.insert(pair<int,int>(num,q));
			num++;
		}
		p=Map.find(p)->second;
		q=Map.find(q)->second;
		add(p,q,r);
		if(r>50){
			mapp[p][q]=1;
		}
	}
	for(i=1;i<=Map.size();i++){
		memset(visit,0,sizeof(visit));
		memset(lowc,0,sizeof(lowc));
		vec.clear();
		vec.push_back(i);
		visit[i]=1;
		bfs(i);
	}
	for(i=1;i<=Map.size();i++){
		for(j=1;j<=Map.size();j++){
			if(mapp[i][j]==1&&j!=i){
				nod.x=Map1.find(i)->second;
				nod.y=Map1.find(j)->second;
				con.push_back(nod);
			}
		}
	}
	sort(con.begin(),con.end(),cmp);
	for(i=0;i<con.size();i++){
		nod=con[i];
		cout<<nod.x<<" "<<nod.y<<endl;
	}
	return 0;
}