#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
using namespace std;
const int maxn = 210;
const int maxm = 210*210*5;
const int INF = 0x3f3f3f3f;
vector<int> ve[maxn];
int stack[maxn], ins[maxn], dfn[maxn], low[maxn];
int belong[maxn];
int n, m;
int cnt;
int scnt, top, tot;
void init()
{
for(int i=0;i<maxn;i++)
ve[i].clear();
cnt = 0;
scnt = top = tot = 0;
//memset(first, -1, sizeof(first));
memset(dfn, 0, sizeof(dfn));
memset(ins, 0, sizeof(ins));
memset(low, 0, sizeof(low));
}
void dfs(int u)
{
int v;
low[u] = dfn[u] = ++tot;
stack[top++] = u;
ins[u] = 1;
for(int e=0;e<ve[u].size();e++)
{
v = ve[u][e];
if(!dfn[v]) { dfs(v); low[u] = min(low[u], low[v]); }
else if(ins[v]) { low[u] = min(low[u], dfn[v]); }
}
if(low[u] == dfn[u])
{
scnt++;
do { v = stack[--top]; belong[v] = scnt; ins[v] = 0; } while(u != v);
}
}
void Tarjan()
{
for(int i= 0;i<2*n; i++)//一定得跑2*n个点
if(!dfn[i])
dfs(i);
}
struct Point
{
int x, y;
Point() {}
Point(int x, int y): x(x), y(y) {}
}P[maxn];
void build(int mid)
{
init();
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++) if(i != j)//i表示在上面,i+n表示在下面
if(abs(P[i].x-P[j].x) < mid)
{
int dis=P[i].y-P[j].y;
if(dis==0){
ve[i].push_back(j+n);
ve[i+n].push_back(j);
}
if( dis>0 && dis<mid){
ve[i+n].push_back(i);
}
if( dis>=mid && dis<2*mid){
ve[i+n].push_back(j+n);
//ve[i].push_back(j+n);//(重重重要!这条不能建边)必定存在,才能够建,不一定存在,不一定存在就不能够建边(比如i在下面,j必定在下面,但是i//如果在上面,j可以在上面,也可以在下面,所以是不确定的)
}
if( dis<0 && dis>-mid){
ve[i].push_back(i+n);
}
if( dis<=-mid && dis>-(2*mid)){
ve[i].push_back(j);
//ve[i+n].push_back(j);
}
}
Tarjan();
}
int ok()
{
for(int i = 0; i < n; i++) if(belong[i] == belong[i+n]) return 0;
return 1;
}
int BSearch(int x, int y)
{
int ans = -1;
int mid;
while(x +1 < y)
{
mid = (x+y)/2;
build(mid);
//printf("%d,%d,mid=%d\n",x,y,mid);
if(ok()) x = mid;
else y = mid;
}
return x;
}
void solve()
{
init();
cin>>n;
for(int i = 0; i < n; i++)
{
int x, y;
scanf("%d%d", &x, &y);
P[i] = Point(x, y);
}
int ans = BSearch(0, 10010);
printf("%d\n",ans);
}
int main()
{
int T;
cin>>T;
while(T--) solve();
return 0;
}
poj2296(二分+2sat)
最新推荐文章于 2019-03-03 15:36:25 发布