Codeforces Round #597 (Div. 2) 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.

---

最小生成森林；

由最小生成树组合而成； **两者区别**

那么怎样才能组合呢？思路非常之巧妙，在原有的顶点基础上，再加一个顶点，称为超级源点，这个源点与各个顶点连成边，权值就为这个顶点的费用；可以自己画图理解，非常巧妙；

知道了这个，那么就可以用最小生成树的算法解了，解法完全一样；

这道题细节比较多，又是发电的点，又是连线的点，所以我用了比较多的STL容器；

代码：

#include<bits/stdc++.h>
#define LL long long
#define pa pair<int,int>
#define lson k<<1
#define rson k<<1|1
//ios::sync_with_stdio(false);
using namespace std;
const int N=100100;
const int M=200100;
const LL mod=1e9+7;
int n;
struct Node{
	int x,y;
}dian[2010];
struct Nod{
	int to,last;
	LL w;
}edge[4000100];
int k[2010];
bool cmp(Nod p,Nod q){
	return p.w<q.w;
}
int fa[2010];
int find(int p){
	if(fa[p]==p) return p;
	return fa[p]=find(fa[p]);
}
int tot;//边数 
LL sum;//最小生成树权值 
set<int>se;//记录有多少个点建电站 
priority_queue< pa,vector<pa>,greater<pa> >qu;
void krus(){
	sort(edge+1,edge+1+tot,cmp);
	int ans=0;//边数 
	for(int i=1;i<=tot;i++){
		int u=find(edge[i].last);
		int v=find(edge[i].to);
		if(u==v) continue;
		if(edge[i].last==0) se.insert(edge[i].to);//记录有多少个点建电站 
		else{//记录有多少个点连接 
			pa p;
			p.first=edge[i].last,p.second=edge[i].to;
			qu.push(p);
		}
		sum+=edge[i].w;
		fa[find(u)]=find(v);
		if(++ans==n) break;//因为加了个超级源点，所以顶点数+1 
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin>>n;
	for(int i=0;i<=n;i++) fa[i]=i;
	for(int i=1;i<=n;i++) cin>>dian[i].x>>dian[i].y;
	for(int i=1;i<=n;i++){
		edge[++tot].last=0;//超级源点 
		edge[tot].to=i;
		cin>>edge[tot].w;
	}
	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++){
			edge[++tot].last=i;
			edge[tot].to=j;
			edge[tot].w=(LL)(abs(dian[i].x-dian[j].x)+abs(dian[i].y-dian[j].y))*(k[i]+k[j]); 
		}
	}
	krus();
	cout<<sum<<endl; 
	cout<<se.size()<<endl;
	set<int>::iterator it;
	for(it=se.begin();it!=se.end();it++) cout<<*it<<" ";
	cout<<endl;
	cout<<qu.size()<<endl;
	while(!qu.empty()){
		cout<<qu.top().first<<" "<<qu.top().second<<endl;
		qu.pop();
	}
	return 0;
}