Shichikuji and Power Grid（最小生成树）

Shichikuji and Power Grid

Shichikuji is the new resident deity of the South Black Snail Temple. Her first job is as follows:

There are n new cities located in Prefecture X. Cities are numbered from 1 to n. City i is located xi km North of the shrine and yi km East of the shrine. It is possible that (xi,yi)=(xj,yj) even when i≠j.

Shichikuji must provide electricity to each city either by building a power station in that city, or by making a connection between that city and another one that already has electricity. So the City has electricity if it has a power station in it or it is connected to a City which has electricity by a direct connection or via a chain of connections.

Building a power station in City i will cost ci yen;
Making a connection between City i and City j will cost ki+kj yen per km of wire used for the connection. However, wires can only go the cardinal directions (North, South, East, West). Wires can cross each other. Each wire must have both of its endpoints in some cities. If City i and City j are connected by a wire, the wire will go through any shortest path from City i to City j. Thus, the length of the wire if City i and City j are connected is |xi−xj|+|yi−yj| km.
Shichikuji wants to do this job spending as little money as possible, since according to her, there isn’t really anything else in the world other than money. However, she died when she was only in fifth grade so she is not smart enough for this. And thus, the new resident deity asks for your help.

And so, you have to provide Shichikuji with the following information: minimum amount of yen needed to provide electricity to all cities, the cities in which power stations will be built, and the connections to be made.

If there are multiple ways to choose the cities and the connections to obtain the construction of minimum price, then print any of them.

Input
First line of input contains a single integer n (1≤n≤2000) — the number of cities.

Then, n lines follow. The i-th line contains two space-separated integers xi (1≤xi≤106) and yi (1≤yi≤106) — the coordinates of the i-th city.

The next line contains n space-separated integers c1,c2,…,cn (1≤ci≤109) — the cost of building a power station in the i-th city.

The last line contains n space-separated integers k1,k2,…,kn (1≤ki≤109).

Output
In the first line print a single integer, denoting the minimum amount of yen needed.

Then, print an integer v — the number of power stations to be built.

Next, print v space-separated integers, denoting the indices of cities in which a power station will be built. Each number should be from 1 to n and all numbers should be pairwise distinct. You can print the numbers in arbitrary order.

After that, print an integer e — the number of connections to be made.

Finally, print e pairs of integers a and b (1≤a,b≤n, a≠b), denoting that a connection between City a and City b will be made. Each unordered pair of cities should be included at most once (for each (a,b) there should be no more (a,b) or (b,a) pairs). You can print the pairs in arbitrary order.

If there are multiple ways to choose the cities and the connections to obtain the construction of minimum price, then print any of them.

Examples
Input
3
2 3
1 1
3 2
3 2 3
3 2 3
Output
8
3
1 2 3
0
Input
3
2 1
1 2
3 3
23 2 23
3 2 3
Output
27
1
2
2
1 2
2 3
Note
For the answers given in the samples, refer to the following diagrams (cities with power stations are colored green, other cities are colored blue, and wires are colored red):

For the first example, the cost of building power stations in all cities is 3+2+3=8. It can be shown that no configuration costs less than 8 yen.

For the second example, the cost of building a power station in City 2 is 2. The cost of connecting City 1 and City 2 is 2⋅(3+2)=10. The cost of connecting City 2 and City 3 is 3⋅(2+3)=15. Thus the total cost is 2+10+15=27. It can be shown that no configuration costs less than 27 yen.

题意：

给你n个点，每个点建造发电站的费用是c[i]，在两个点之间铺设电线的费用是(k[i] + k[j])*(曼哈顿距离),曼哈顿距离指的是在平面直角坐标系上只能走与坐标轴平行的方向到另一个点的距离，然后求能使所有城市都通上电的最小花费，并输出来在哪几个城市建造发电站以及在哪两个点之间建立边

思路：

本来我想的是贪心的思想，把每两个点之间的长度都预处理出来，然后他如果小于建造这个发电站所花费的费用的时候就在这两个点之间建立一条边，最后会有若干个集合，那么每个集合里只需要建造一个发电站就行了，然后这样做出来是wrong answer in test 13，可以看一下截图


这么看来是我这个思路出现了问题，可能他两点之间的距离都大于建造两点的价值，但是建造这条边是对整体有益的，我这个bug应该是出在了这个地方，然后因为大方向上出现了问题，所以再改也没有必要了，所以就换了个思路

AC思路

另外设一个0点，他与每个点之间的权重是建造该点的距离，所以说问题就迎刃而解了 ，下面看一下代码把，应该会比较的清晰：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<map>
using namespace std;
const int N = 3000,M = N * 2;
typedef long long LL;
typedef pair<LL,LL> PII;
LL w[N][N],c[N],k[N];
PII coo[N];
int pa[N],cnt,sum;
PII ans[N];
struct node{
	int x,y;
	LL v;
}ed[N*N];
map<int,LL> mp;
int find(int x){
	if(pa[x] != x) pa[x] = find(pa[x]);
	return pa[x];
}
bool cmp(node a,node b){
	return a.v < b.v;
}
int op[N];
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++) cin>>coo[i].first>>coo[i].second;
	for(int i=1;i<=n;i++) cin>>c[i];
	for(int i=1;i<=n;i++) cin>>k[i];
	for(int i=1;i<=n;i++){
		ed[cnt++] = {0,i,c[i]};
		ed[cnt++] = {i,0,c[i]};
		for(int j=i+1;j<=n;j++){
			w[i][j] = (abs(coo[i].first-coo[j].first) + abs(coo[i].second-coo[j].second))*(k[i] + k[j]);
			w[j][i] = w[i][j];
			ed[cnt++] = {i,j,w[i][j]};
			ed[cnt++] = {j,i,w[j][i]};
		}
	}
	for(int i=1;i<=n;i++) pa[i] = i;
	sort(ed,ed+cnt,cmp);
	LL res = 0,t=0;
	for(int i=0;i<cnt;i++){
		if(find(ed[i].x) != find(ed[i].y)){
			if(ed[i].x == 0 || ed[i].y == 0){
				op[t++] = max(ed[i].x,ed[i].y);
			}
			else{
				ans[sum++] = {ed[i].x,ed[i].y};
			}
			pa[find(ed[i].x)] = find(ed[i].y);
			res += ed[i].v;
		}
	}
	cout<<res<<endl;
	cout<<t<<endl;
	for(int i=0;i<t;i++) cout<<op[i]<<" ";
	cout<<endl;
	cout<<sum<<endl;
	for(int i=0;i<sum;i++) cout<<ans[i].first<<" "<<ans[i].second<<endl;
	return 0;
}