题解:
题意为有两座监狱,有n个罪犯,有m对罪犯,当他们关在同一座监狱时,会爆发冲突事件,影响力为mi,问怎么划分罪犯才能使监狱里影响力最大的事件的影响力最小,输出该影响力。
最大值最小 常用二分解决
只用二分影响力,利用大于当前影响力的边建图,跑二分图,如果可以成为二分图,说明是可以的。然后二分下一部分ed = mid,反之二分上一部分st = mid;
AC code
#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e4 + 10;
const int maxm = 1e5 + 10;
int n,m;
struct edge
{
int to;
int cost;
edge(int x = 0, int y = 0) : to(x), cost(y){}
};
vector <edge> G[maxn];
int vis[maxn];
bool dfs(int u,int x)
{
for(int i = 0; i < G[u].size(); i++)
{
edge e = G[u][i];
if(e.cost <= x || vis[e.to] + vis[u] == 0) continue;
if(vis[e.to] == vis[u]) return false;
vis[e.to] = -1*vis[u];
if(!dfs(e.to,x)) return false;
}
return true;
}
bool check(int x)
{
memset(vis,0,sizeof(vis));
for(int i = 1; i <= n; i++)
{
if(!vis[i])
{
//cout << i << endl;
vis[i] = 1;
if(!dfs(i,x)) return false;
}
}
return true;
}
int main()
{
scanf("%d%d",&n,&m);
int u,v,c;
for(int i = 0; i < m; i++)
{
scanf("%d%d%d",&u,&v,&c);
G[u].push_back(edge(v,c));
G[v].push_back(edge(u,c));
}
int st = -1;
int ed = 1e9+1;
while(ed - st > 1)
{
//cout << st << endl;
int mid = st + (ed-st)/2;
if(check(mid)) ed = mid;
else st = mid;
}
printf("%d\n",ed);
return 0;
}