CodeForces1245 D.Shichikuji and Power Grid (加点+最小生成树)

D.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个点，每个点有坐标(x,y)
第i个点建立发电站的花费为ci
第i个点作为边的端点需要的单位距离花费为ki
如果a,b点之间要建立边，需要的花费为:a,b之间的曼哈顿距离 乘上 (ka+kb)

如果a有发电站，b有边直接或者间接连接到a，则b也有电

现在要求所有点都有点的最小花费

题目需要输出：
所有点都有电的最小花费

单独建立发电站的点的个数
单独建立发电站的点的编号

建立的边的个数
建边的边的两端点

思路:

增加超级点0，点0到n个点的花费为ci
则题目变成求0~n这n+1个点的最小生成树

code：

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<set>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
using namespace std;
#define int long long
const int maxm=2e3+5;
struct Node{
    int a,b,c;
}e[maxm*maxm];
int num;
int x[maxm],y[maxm];
int c[maxm];
int k[maxm];
int pre[maxm];
int mark[maxm][maxm];
int n;
vector<int>res;//存单独建立发电站的点
vector<pair<int,int> >ans;//存边
void init(){//pre初始化
    for(int i=0;i<maxm;i++){
        pre[i]=i;
    }
}
int getd(int i,int j){//求边权(建边花费)
    int kk=k[i]+k[j];
    int dis=abs(x[i]-x[j])+abs(y[i]-y[j]);
    return kk*dis;
}
bool cmp(Node a,Node b){
    return a.c<b.c;
}
int ffind(int x){
    return pre[x]==x?x:pre[x]=ffind(pre[x]);
}
signed main(){
    init();
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>x[i]>>y[i];
    }
    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++){
        for(int j=i+1;j<=n;j++){
            e[++num]={i,j,getd(i,j)};
        }
    }
    for(int i=1;i<=n;i++){//超级点连1-n每个点，边权为c[i]
        e[++num]={0,i,c[i]};
    }
    sort(e+1,e+1+num,cmp);
    int sum=0;
    int cnt=0;
    for(int i=1;i<=num;i++){
        int a=ffind(e[i].a);
        int b=ffind(e[i].b);
        if(a!=b){
            pre[a]=b;
            if(e[i].a==0){//res存点
                res.push_back(e[i].b);
            }else{//ans存边
                ans.push_back(make_pair(e[i].a,e[i].b));
            }
            sum+=e[i].c;
            cnt++;
            if(cnt==n){
                break;
            }
        }
    }
    cout<<sum<<endl;
    cout<<res.size()<<endl;
    for(int i=0;i<(int)res.size();i++){
        cout<<res[i]<<' ';
    }
    cout<<endl;
    cout<<ans.size()<<endl;
    for(int i=0;i<(int)ans.size();i++){
        cout<<ans[i].first<<' '<<ans[i].second<<endl;
    }
    return 0;
}