hdu3622 Bomb Game--2-sat问题学习二

题目链接：点击打开链接

思路：求出每顶点对之间的距离，然后unique一下，最后二分法解针对每个距离的可行性。

代码：

#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<iterator>
using namespace std;
const int  maxn=300;
//tarjan 使用注意ini还有图开始的下标
int low[maxn],dfn[maxn];
int  g[maxn][maxn];
vector<int>v[maxn];
int n,depth;
int idx[maxn],vis[maxn],stack[maxn],top;
struct coor{
    int x,y;
} c[maxn*2];
//建立有向图
void build_g(int k){
    int i,j;
    for(i=1; i<=n; i++){
        for(j=i+1; j<=n; j++){
            if(g[i][j]<k){
                v[i].push_back(j+n);
                v[j].push_back(i+n);
            }
            if(g[i][j+n]<k){
                v[i].push_back(j);
                v[j+n].push_back(i+n);
            }
            if(g[i+n][j]<k){
                v[i+n].push_back(j+n);
                v[j].push_back(i);
            }
            if(g[i+n][j+n]<k){
                v[i+n].push_back(j);
                v[j+n].push_back(i);
            }
        }
    }
}
void tarjan(int u){
    dfn[u]=low[u]=depth++;
    vis[u]=1;
    stack[++top]=u;
    for(size_t j=0;j<v[u].size();j++){
        int i=v[u][j];
        if(vis[i]==0){
            tarjan(i);
            low[u]=min(low[u],low[i]);
       }
       else if(vis[i]==1){
           low[u]=min(low[u],low[i]);
        }
    }
    if(low[u]==dfn[u]){
        while(stack[top]!=u){
            vis[stack[top]]=2;
            idx[stack[top]]=u;
            top--;
        }
        idx[u] = u; top--; vis[u] = 2;
    }
}
void ini(){
    memset(vis,0,sizeof(vis));
    memset(idx,0,sizeof(idx));
    depth=1;
    top=-1;
    for(int i=1;i<=2*n;i++)v[i].clear();
}
bool tow_sat(int x){
    int i;
    ini();
    build_g(x);
    for(i=1; i<=n*2; i++){
        if(vis[i]==0){
            tarjan(i);
        }
    }
    for(i=1; i<=n; i++){
        if(idx[i]==idx[i+n])return 0;
    }
    return 1;
}
int main(){

    int i;
    //freopen("in.txt","r",stdin);
    while(scanf("%d",&n)!=EOF)
    {
        vector<int>vec;
        for(i=1; i<=n; i++)scanf("%d%d%d%d",&c[i].x,&c[i].y,&c[i+n].x,&c[i+n].y);
        for(int i=1;i<=n*2;i++){
            for(int j=1;j<i;j++){
                int t1=c[i].x-c[j].x;
                int t2=c[i].y-c[j].y;
                int t3=t1*t1+t2*t2;
                g[i][j]=g[j][i]=t3;
                vec.push_back(t3);
            }
        }
        sort(vec.begin(),vec.end());
        vector<int>::iterator ee= unique(vec.begin(),vec.end());
        vec.erase(ee,vec.end());
        int left=0,mid,right=vec.size()-1;
        int best;
        while(left<=right){
            mid=(left+right)/2;
            if(tow_sat(vec[mid])){
                left=mid+1;
                best=mid;
            }
            else{
                right=mid-1;
            }
        }
        double ans=sqrt((double)vec[best])/2;
        printf("%.2lf\n",ans);
    }
    return 0;
}