HDU 3622 Bomb Game （二分+2-sat,4级 ）

E - Bomb Game

Crawling in process... Crawling failed Time Limit:3000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit Status

Appoint description: System Crawler (2013-05-30)

Description

Robbie is playing an interesting computer game. The game field is an unbounded 2-dimensional region. There are N rounds in the game. At each round, the computer will give Robbie two places, and Robbie should choose one of them to put a bomb. The explosion area of the bomb is a circle whose center is just the chosen place. Robbie can control the power of the bomb, that is, he can control the radius of each circle. A strange requirement is that there should be no common area for any two circles. The final score is the minimum radius of all the N circles.
Robbie has cracked the game, and he has known all the candidate places of each round before the game starts. Now he wants to know the maximum score he can get with the optimal strategy.

 

Input

The first line of each test case is an integer N (2 <= N <= 100), indicating the number of rounds. Then N lines follow. The i-th line contains four integers x_1i, y_1i, x_2i, y_2i, indicating that the coordinates of the two candidate places of the i-th round are (x_1i, y_1i) and (x_2i, y_2i). All the coordinates are in the range [-10000, 10000].

 

Output

Output one float number for each test case, indicating the best possible score. The result should be rounded to two decimal places.

 

Sample Input

2
1 1 1 -1
-1 -1 -1 1
2
1 1 -1 -1
1 -1 -1 1

 

Sample Output

1.41
1.00

 

二分圆半径。判符合建图。

#include<cstdio>
#include<cstring>
#include<iostream>
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define clr(f,z) memset(f,z,sizeof(f))
using namespace std;
const int mm=410;
const double oo=2e4+9;
const double eps=1e-6;
class Edge
{
  public:int v,next;
};
class cicle
{
  public:double x,y,xx,yy;
}f[mm];
int n;
class TWO_SAT
{
public:
  int dfn[mm],e_to[mm],stack[mm];
  Edge e[mm*mm*2];
  int edge,head[mm],top,dfs_clock,bcc;
  void clear()
  {
    edge=0;clr(head,-1);
  }
  void add(int u,int v)
  {
    e[edge].v=v;e[edge].next=head[u];head[u]=edge++;
  }
  void add_my(int x,int xval,int y,int yval)
  {
    x=x+x+xval;y=y+y+yval;
    add(x,y);
  }
  void add_clause(int x,int xval,int y,int yval)
  {///x or y
    x=x+x+xval;
    y=y+y+yval;
    add(x^1,y);add(y^1,x);
  }
  void add_con(int x,int xval)//x is xval
  { x=x+x+xval;
    add(x^1,x);
  }
  int tarjan(int u)
  {
    int lowu,lowv;
    lowu=dfn[u]=++dfs_clock;
    int v; stack[top++]=u;
    for(int i=head[u];~i;i=e[i].next)
    {
      v=e[i].v;
      if(!dfn[v])
      {
        lowv=tarjan(v);
        lowu=min(lowv,lowu);
      }
      else if(e_to[v]==-1)//in stack
        lowu=min(lowu,dfn[v]);
    }
    if(dfn[u]==lowu)
    {
      ++bcc;
      do{
        v=stack[--top];
        e_to[v]=bcc;
      }while(v!=u);
    }
    return lowu;
  }
  bool find_bcc(int n)
  { clr(e_to,-1);
    clr(dfn,0);
    bcc=dfs_clock=top=0;
    FOR(i,0,2*n-1)
    if(!dfn[i])
      tarjan(i);
    for(int i=0;i<2*n;i+=2)
      if(e_to[i]==e_to[i^1])return 0;
    return 1;
  }
  bool build(double x)
  {
    clear();
    FOR(i,1,n)
    FOR(j,i+1,n)
    FOR(k,0,1)FOR(l,0,1)
    if(intersex(i,k,j,l,x+x))
    {
      add_clause(i-1,k^1,j-1,l^1);
      add_clause(j-1,l^1,i-1,k^1);
    }
    return find_bcc(n*2);
  }
  bool intersex(int i,int a,int j,int b,double mid)
  {
    double x,y,xx,yy,dis;
    if(a)x=f[i].xx,y=f[i].yy;
    else x=f[i].x,y=f[i].y;
    if(b)xx=f[j].xx,yy=f[j].yy;
    else xx=f[j].x,yy=f[j].y;
     dis=(x-xx)*(x-xx)+(y-yy)*(y-yy);
     mid*=mid;
     return dis<mid;
  }
}two;
char s[44];
int main()
{ int a,b,c,d;
  while(~scanf("%d",&n))
  {
    FOR(i,1,n)
    {
     scanf("%lf%lf%lf%lf",&f[i].x,&f[i].y,&f[i].xx,&f[i].yy);
    }
    double l=0,r=oo,mid;
    while(r-l>eps)
    { mid=(l+r)/2;
      if(two.build(mid))
        l=mid;
      else r=mid;
    }
    //cout<<(l+r)/2<<endl;
    printf("%.2lf\n",(l+r)/2);
  }
  return 0;
}