题意
n 个牛舍分别和两个连接点中的一个相连,从而使任意两个牛舍相互可达。并且要求所有牛舍对距离的最大值尽可能小。特别的,有些牛相互讨厌,它们不能连在同一个点上;有些牛相互喜欢,它们必须连在同一个点上。
思路
显然是二分答案加2-sat检验,总结两点:
1。2-sat的建图实际上就是转化成蕴含式
2。建边时应该从“非”的角度考虑,即将冲突情况取非
链接
http://poj.org/problem?id=2749
代码
#include<cstdio>
#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
const int maxn = 500 + 10;
const int maxv = maxn << 1;
const int maxm = 1000 + 10;
int abs(int x){
if(x >= 0) return x;
return -x;
}
struct P{
int x, y;
P(){}
P(int x, int y): x(x), y(y){}
void read(){scanf("%d %d", &x, &y);}
int dis(P a){return abs(x - a.x) + abs(y - a.y);}
};
int n, a, b, v;
P node[maxn], A[maxm], B[maxm];
int disa[maxn], disb[maxn], dis0;
bool G[maxv][maxv], rG[maxv][maxv], vis[maxv];
vector<int> vs;
int cmp[maxv];
void read(){
scanf("%d %d %d", &n, &a, &b);
v = n << 1;
P s1, s2;
s1.read();
s2.read();
dis0 = s1.dis(s2);
for(int i = 0; i < n; ++i){
node[i].read();
}
for(int i = 0; i < n; ++i){
disa[i] = s1.dis(node[i]);
disb[i] = s2.dis(node[i]);
}
for(int i = 0; i < a; ++i){
A[i].read();
A[i].x--, A[i].y--;
}
for(int i = 0; i < b; ++i){
B[i].read();
B[i].x--, B[i].y--;
}
}
void add(int x, int y){
G[x][y] = rG[y][x] = true;
}
void dfs(int x){
vis[x] = true;
for(int i = 0; i < v; ++i){
if(G[x][i] && !vis[i]) dfs(i);
}
vs.push_back(x);
}
void rdfs(int x, int k){
vis[x] = true;
cmp[x] = k;
for(int i = 0; i < v; ++i){
if(rG[x][i] && !vis[i]) rdfs(i, k);
}
}
int scc(){
memset(vis, false, sizeof vis);
for(int i = 0; i < v; ++i){
if(!vis[i]) dfs(i);
}
int k = 0;
memset(vis, false, sizeof vis);
for(int i = vs.size()-1; i >= 0; --i){
if(!vis[vs[i]]) rdfs(vs[i], k++);
}
return k;
}
bool judge(int res){
memset(G, false, sizeof G);
memset(rG, false, sizeof rG);
vs.clear();
for(int i = 0; i < n; ++i){
for(int j = 0; j < i; ++j){
if(disa[i] + disa[j] > res){add(i, j + n); add(j, i + n);}
if(disb[i] + disb[j] > res){add(i + n, j); add(j + n, i);}
if(disa[i] + disb[j] + dis0 > res){add(i, j); add(j + n, i + n);}
if(disb[i] + disa[j] + dis0 > res){add(i + n, j + n); add(j, i);}
}
}
for(int i = 0; i < a; ++i){
int x = A[i].x, y = A[i].y;
add(x, y + n); add(y, x + n); add(x + n, y); add(y + n, x);
}
for(int i = 0; i < b; ++i){
int x = B[i].x, y = B[i].y;
add(x + n, y + n); add(y, x); add(y + n, x + n); add(x, y);
}
scc();
for(int i = 0; i < n; ++i){
if(cmp[i] == cmp[i + n]) return false;
}
return true;
}
int solve(){
int lb = 0, ub = 10000000;
while(lb <= ub){
int mid = (lb + ub) >> 1;
if(judge(mid)) ub = mid - 1;
else lb = mid + 1;
}
if(lb >= 10000000) return -1;
return lb;
}
int main(){
read();
printf("%d\n", solve());
return 0;
}