题意:给了n个点对,每一对只能引爆其中一个,然后所有的点的爆炸半径是一样的,然后要求所有的点的爆炸范围不相交,问爆炸半径最大是多少
思路:二分半径的大小,然后判断条件就用2-sat就可以,对于点对A和B,若A和B不能共存,即A,B不能同时取,连边<A,B'><B,A'>,然后每次判断就可以了,二分可以用精度来做,也可以二分多次已达到结果
#include <math.h>
#include <vector>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f3fll;
const int maxn=410;
int n,m;
vector<int>G[maxn],rG[maxn],vs;
bool used[maxn];
int cmp[maxn],X1[maxn],Y1[maxn],X2[maxn],Y2[maxn];
void add_edge(int from,int to){
G[from].push_back(to);
rG[to].push_back(from);
}
void dfs(int v){
used[v]=1;
for(unsigned int i=0;i<G[v].size();i++){
if(!used[G[v][i]]) dfs(G[v][i]);
}
vs.push_back(v);
}
void rdfs(int v,int k){
used[v]=1;
cmp[v]=k;
for(unsigned int i=0;i<rG[v].size();i++){
if(!used[rG[v][i]]) rdfs(rG[v][i],k);
}
}
int scc(){
memset(used,0,sizeof(used));
vs.clear();
for(int v=0;v<2*n;v++){
if(!used[v]) dfs(v);
}
memset(used,0,sizeof(used));
int sum=0;
for(int i=vs.size()-1;i>=0;i--){
if(!used[vs[i]]) rdfs(vs[i],sum++);
}
return sum;
}
//A,B不能同时取 <A,B'><B,A'>
bool judge(double mid){
for(int i=0;i<2*n;i++) G[i].clear(),rG[i].clear();
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(sqrt((X1[i]-X1[j])*((X1[i]-X1[j]))+((Y1[i]-Y1[j]))*((Y1[i]-Y1[j])))<2*mid){add_edge(i,j+n);add_edge(j,i+n);}
if(sqrt((X1[i]-X2[j])*((X1[i]-X2[j]))+((Y1[i]-Y2[j]))*((Y1[i]-Y2[j])))<2*mid){add_edge(i,j);add_edge(j+n,i+n);}
if(sqrt((X2[i]-X1[j])*((X2[i]-X1[j]))+((Y2[i]-Y1[j]))*((Y2[i]-Y1[j])))<2*mid){add_edge(i+n,j+n);add_edge(j,i);}
if(sqrt((X2[i]-X2[j])*((X2[i]-X2[j]))+((Y2[i]-Y2[j]))*((Y2[i]-Y2[j])))<2*mid){add_edge(i+n,j);add_edge(j+n,i);}
}
}
scc();
int flag=0;
for(int i=0;i<n;i++) if(cmp[i]==cmp[i+n]) flag=1;
if(flag) return 0;
else return 1;
}
int main(){
while(scanf("%d",&n)!=-1){
for(int i=0;i<n;i++) scanf("%d%d%d%d",&X1[i],&Y1[i],&X2[i],&Y2[i]);
double le=0,ri=100000;
for(int i=0;i<50;i++){
double mid=(le+ri)/2;
if(judge(mid)) le=mid;
else ri=mid;
}
printf("%.2f\n",le);
}
return 0;
}