Building roads |
| Time Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) |
| Total Submission(s): 30 Accepted Submission(s): 12 |
|
Problem Description
Farmer John's farm has N barns, and there are some cows that live in each barn. The cows like to drop around, so John wants to build some roads to connect these barns. If he builds roads for every pair of different barns, then he must build N * (N - 1) / 2 roads, which is so costly that cheapskate John will never do that, though that's the best choice for the cows.
Clever John just had another good idea. He first builds two transferring point S1 and S2, and then builds a road connecting S1 and S2 and N roads connecting each barn with S1 or S2, namely every barn will connect with S1 or S2, but not both. So that every pair of barns will be connected by the roads. To make the cows don't spend too much time while dropping around, John wants to minimize the maximum of distances between every pair of barns. That's not the whole story because there is another troublesome problem. The cows of some barns hate each other, and John can't connect their barns to the same transferring point. The cows of some barns are friends with each other, and John must connect their barns to the same transferring point. What a headache! Now John turns to you for help. Your task is to find a feasible optimal road-building scheme to make the maximum of distances between every pair of barns as short as possible, which means that you must decide which transferring point each barn should connect to. We have known the coordinates of S1, S2 and the N barns, the pairs of barns in which the cows hate each other, and the pairs of barns in which the cows are friends with each other. Note that John always builds roads vertically and horizontally, so the length of road between two places is their Manhattan distance. For example, saying two points with coordinates (x1, y1) and (x2, y2), the Manhattan distance between them is |x1 - x2| + |y1 - y2|. |
|
Input
The first line of input consists of 3 integers N, A and B (2 <= N <= 500, 0 <= A <= 1000, 0 <= B <= 1000), which are the number of barns, the number of pairs of barns in which the cows hate each other and the number of pairs of barns in which the cows are friends with each other.
Next line contains 4 integer sx1, sy1, sx2, sy2, which are the coordinates of two different transferring point S1 and S2 respectively. Each of the following N line contains two integer x and y. They are coordinates of the barns from the first barn to the last one. Each of the following A lines contains two different integers i and j(1 <= i < j <= N), which represent the i-th and j-th barns in which the cows hate each other. The same pair of barns never appears more than once. Each of the following B lines contains two different integers i and j(1 <= i < j <= N), which represent the i-th and j-th barns in which the cows are friends with each other. The same pair of barns never appears more than once. You should note that all the coordinates are in the range [-1000000, 1000000]. |
|
Output
You just need output a line containing a single integer, which represents the maximum of the distances between every pair of barns, if John selects the optimal road-building scheme. Note if there is no feasible solution, just output -1.
|
|
Sample Input
4 1 1 12750 28546 15361 32055 6706 3887 10754 8166 12668 19380 15788 16059 3 4 2 3 |
|
Sample Output
53246 |
|
Source
POJ Monthly - 2006.01.22 - zhucheng
|
题意：
有n个仓库，两个中转站s1,s2,要求每个农场要么和S1场地连接要么和S2场地连接，且每个农场之间的连接距离的最大值最小 ，有a对仓库不能连同一个中转站，b对仓库必须连同一个中转站。
代码：
/* 二分枚举最大距离L，判断一下每个农场可连接的场地(以下的连边表示，a表示和S1连接，！a表示和S2连接) （前提是dis[a][s1/s2]<=L,dis[b][s1/s2]<=L......................） 如果dis[a][S1] + dis[b][S1] > L，那么表明a和b不能同时和S1连接，连边a -> !b, b->!a 如果dis[a][S2] + dis[b][S2] > L，那么表明a和b不能同时和S2连接，连边!a -> b, !b->a 如果dis[a][S1] + dis[b][S2] + dis[S1][S2] > L，那么表明a农场连接S1时，b农场不能连接S2。b农场连接S2时，a农场不能连接S1，连边 a->b, !b->!a 如果dis[a][S2] + dis[b][S1] + dis[S1][S2] > L，那么表明a农场连接S2时，b农场不能连接S1。b农场连接S1时，a农场不能连接S2，连边 !a->!b, b->a 接下来还要处理A中不可连接限制和B种连接限制. 注意：二分范围如果小了会wa的。 */ #include<iostream> #include<cstdio> #include<cstring> #include<vector> #include<cmath> using namespace std; const int maxn=505; int dis[505][505],x[505],y[505],likx[1003],liky[1003],hatx[1003],haty[1003]; /********************** 2-sat模板 **********************/ struct Twosat{ int n; vector<int> g[maxn*2]; bool mark[maxn*2]; int s[maxn*2],c; bool dfs(int x){ if(mark[x^1]) return false; if(mark[x]) return true; mark[x]=true; s[c++]=x; for(int i=0;i<(int)g[x].size();i++) if(!dfs(g[x][i])) return false; return true; } void init(int n){ this->n=n; for(int i=0;i<n*2;i++) g[i].clear(); memset(mark,0,sizeof(mark)); } void add_clause(int x,int xval,int y,int yval){//这个函数随题意变化 x=x*2+xval; y=y*2+yval; g[x].push_back(y); } bool solve(){ for(int i=0;i<n*2;i+=2) if(!mark[i]&&!mark[i+1]){ c=0; if(!dfs(i)){ while(c>0) mark[s[--c]]=false; if(!dfs(i+1)) return false; } } return true; } }; /*********************** 2-sat模板 ************************/ int main(){ int n,A,B,a,b; Twosat solver; while(~scanf("%d%d%d",&n,&A,&B)){ scanf("%d%d%d%d",&x[n],&y[n],&x[n+1],&y[n+1]); for(int i=0;i<n;i++){ scanf("%d%d",&x[i],&y[i]); dis[i][n]=dis[n][i]=(fabs(x[i]-x[n])+fabs(y[i]-y[n])); dis[i][n+1]=dis[n+1][i]=(fabs(x[i]-x[n+1])+fabs(y[i]-y[n+1])); } dis[n][n+1]=dis[n+1][n]=(fabs(x[n]-x[n+1])+fabs(y[n]-y[n+1])); for(int i=0;i<A;i++){ scanf("%d%d",&a,&b); a--;b--; hatx[i]=a;haty[i]=b; } for(int i=0;i<B;i++){ scanf("%d%d",&a,&b); a--;b--; likx[i]=a;liky[i]=b; } int L=0,R=8000006,M,ans=-1; while(L<=R){ M=(L+R)/2; solver.init(n); for(int i=0;i<A;i++){ solver.add_clause(hatx[i],0,haty[i],1); solver.add_clause(hatx[i],1,haty[i],0); solver.add_clause(haty[i],0,hatx[i],1); solver.add_clause(haty[i],1,hatx[i],0); } for(int i=0;i<B;i++){ solver.add_clause(likx[i],0,liky[i],0); solver.add_clause(likx[i],1,liky[i],1); solver.add_clause(liky[i],0,likx[i],0); solver.add_clause(liky[i],1,likx[i],1); } for(int i=0;i<n;i++){ //if(dis[i][n]>M) solver.add_clause(i,0,i,1); //if(dis[i][n+1]>M) solver.add_clause(i,1,i,0); for(int j=i+1;j<n;j++){ if(dis[i][n]<=M&&dis[j][n]<=M&&dis[i][n]+dis[j][n]>M){ solver.add_clause(i,0,j,1); solver.add_clause(j,0,i,1); } if(dis[i][n+1]<=M&&dis[j][n+1]<=M&&dis[i][n+1]+dis[j][n+1]>M){ solver.add_clause(i,1,j,0); solver.add_clause(j,1,i,0); } if(dis[i][n]<=M&&dis[j][n+1]<=M&&dis[i][n]+dis[j][n+1]+dis[n][n+1]>M){ solver.add_clause(i,0,j,0); solver.add_clause(j,1,j,1); } if(dis[i][n+1]<=M&&dis[j][n]<=M&&dis[i][n+1]+dis[j][n]+dis[n][n+1]>M){ solver.add_clause(i,1,j,1); solver.add_clause(j,0,i,0); } } } if(solver.solve()) {R=M-1;ans=M;} else L=M+1; } printf("%d ",ans); } return 0; }