HDU 3622 2_SAT

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>

#define eps 1e-7
using namespace std;

const int M = 505;
const int N = 50005;
vector<int>que[M];
stack<int>s;
struct node {

    int x, y;
}pa[N], pb[N];

int dfn[M];
int low[M];
int ins[M];
int sccf[M];
int index, scc;
int n;

void init() {

    index = 1;
    scc = 0;
    memset(dfn, 0, sizeof(dfn));
    memset(ins, 0, sizeof(ins));
    memset(low, 0, sizeof(low));
    while(!s.empty())
        s.pop();
    for(int i = 0; i <= n*2; i++)
        que[i].clear();
}

double dist(node p1, node p2) {

    return sqrt((p1.x - p2.x)*(p1.x - p2.x) + (p1.y - p2.y)*(p1.y - p2.y));
}

void built(double mid) {

  for(int i = 1; i <= n; i++) {

    for(int j = i+1; j <= n; j++) {

        if(dist(pa[i], pa[j]) + eps < mid*2) que[i].push_back(j+n),que[j].push_back(i+n);
        if(dist(pa[i], pb[j]) + eps < mid*2) que[i].push_back(j), que[j+n].push_back(i+n);
        if(dist(pb[i], pa[j]) + eps < mid*2) que[i+n].push_back(j+n), que[j].push_back(i);
        if(dist(pb[i], pb[j]) + eps < mid*2) que[i+n].push_back(j), que[j+n].push_back(i);
    }
  }
}

void Tarjan(int u) {

    int v;
    dfn[u] = low[u] = index++;
    ins[u] = 1;
    s.push(u);
    for(int i = 0; i < (int)que[u].size(); i++) {

        v = que[u][i];
        if(!dfn[v]) {

            Tarjan(v);
            low[u] = min(low[v], low[u]);
        }else if(ins[v])
        low[u] = min(low[v], low[u]);
    }

    if(low[u] == dfn[u]) {

        scc++;
        do {

            v = s.top();
            s.pop();
            sccf[v] = scc;
            ins[v] = 0;
        }while(u != v);
    }
}

bool check() {

    for(int i = 1; i <= n*2; i++)
        if(!dfn[i])
          Tarjan(i);
    for(int i = 1; i <= n; i++) {

        if(sccf[i] == sccf[i+n])
            return false;
    }
    return true;
}

void solve() {

    double l = 0, r = 200000, ans = 0, mid;

    while(r - l > eps) {

        mid = (r+l)/2;
        init();
        built(mid);

        if(check()){
        ans = max(ans, mid);

            l = mid;
        }else {

            r = mid;
        }
    }
    printf("%.2lf\n", ans);
}

int main()
{
    while(scanf("%d", &n) != EOF) {

        for(int i = 1; i <= n; i++) {

            scanf("%d%d%d%d", &pa[i].x, &pa[i].y, &pb[i].x, &pb[i].y);
        }
        solve();
    }
    return 0;
}