题目:
不想给。
题意:
有n个网络站点,q张已经连好的网络子图,每个子图都有一定价格,连接了一些网络站点,最后给出n个点的坐标。
现在想要连接这n个站点,可以买图,也可以自己修路(路的价格是两点距离的平方),求最小价格。
解题思路:
跑一遍不用套餐时的最小生成树,记录下加入生成树的边,然后二进制枚举所有套餐的使用情况,用完后套餐仍未连起来的点用第一次跑的最小生成树的边来连接,比较每种方案得出最小价格。
代码:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<cmath>
#include<string>
#include<sstream>
#include<ctime>
using namespace std;
#define _PI acos(-1.0)
#define esp 1e-9
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> pill;
#define MAXD 1100
vector<int>aaa;
int n , m , line_size;
int fa[MAXD];
struct Line{
int l;
int r;
int cost;
friend bool operator < (Line p,Line q){
if(p.cost < q.cost)
return true;
else
return false;
}
}line[MAXD * MAXD];
struct Point{
int x;
int y;
}p[MAXD];
struct Pow{
int cost;
int size;
int arr[MAXD];
}q[15];
int _dist(Point p,Point q){
int x = p.x - q.x;
int y = p.y - q.y;
int ans = x * x + y * y;
return ans;
}
int find_father(int u){
return fa[u] == u ? u : fa[u] = find_father(fa[u]);
}
void init(){
for(int i = 0 ; i <= n ; i++) fa[i] = i;
return ;
}
LL solve(int u){
int now = 0;
int cost = 0;
init();
for(int i = 0 ; i < m ; i ++){
if(!((u >> i) & 1)) continue;
cost += q[i].cost;
for(int j = 1 ; j < q[i].size ; j++){
int t1 = find_father(q[i].arr[j]);
int t2 = find_father(q[i].arr[j - 1]);
if(t1 != t2){
fa[t1] = t2;
now ++;
}
}
}
for(int i = 0 ; now < n - 1; i++){
int c = aaa[i];
int _t1 = line[c].l;
int _t2 = line[c].r;
int t1 = find_father(_t1);
int t2 = find_father(_t2);
if(t1 != t2){
cost += line[c].cost;
fa[t1] = t2;
now++;
}
}
return cost;
}
int main(){
int T;
scanf("%d",&T);
while(T--){
aaa.clear();
LL _ans = 0;
scanf("%d%d",&n,&m);
init();
for(int i = 0 ; i < m ; i++){
scanf("%d%d",&q[i].size,&q[i].cost);
for(int j = 0 ; j < q[i].size ; j ++)
scanf("%d",&q[i].arr[j]);
}
line_size = 0;
for(int i = 1 ; i <= n ; i++){
scanf("%d%d",&p[i].x,&p[i].y);
for(int j = 1 ; j < i ; j++){
line[line_size].l = j;
line[line_size].r = i;
line[line_size].cost = _dist(p[i],p[j]);
line_size ++;
}
}
sort(line,line + line_size);
for(int i = 0 ,j = 0 ; j < n - 1; i ++){
int l = line[i].l , r = line[i].r;
int fa_l = find_father(l);
int fa_r = find_father(r);
if(fa_l != fa_r){
fa[fa_l] = fa_r;
j ++;
_ans += line[i].cost;
aaa.push_back(i);
}
}
for(int i = 1 ; i < (1 << m) ; i++){
LL ans = solve(i);
_ans = min(ans,_ans);
}
printf("%lld\n",_ans);
if(T > 0)
printf("\n");
}
return 0;
}