[CF1095F]Make It Connected

题目大意：给你$n(n\leqslant2\times10^5)$个点和$m(m\leqslant2\times10^5)$条边，第$i$个点点权为$a_i$。连接$u,v$两个点的代价为$a_u+a_v$或者一条连接$u,v$的边的边权。问连通的最小代价

题解：发现若不考虑特殊边，一定是点权最小的点连向其他点。于是建出由点权最小的点连向其他各点的边，边权为两点点权和。与特殊边一起跑最小生成树即可。

卡点：无

C++ Code：

#include <algorithm>
#include <cstdio>
#define maxn 200010
int n, m;
int l[maxn << 1], r[maxn << 1], rnk[maxn << 1];
long long ans, a[maxn], w[maxn << 1];int f[maxn];
int find(int x) { return x == f[x] ? x : (f[x] = find(f[x])); }int main() {scanf("%d%d", &n, &m);for (int i = 1; i <= n; ++i) {scanf("%lld", a + i);rnk[i] = f[i] = i;}std::sort(rnk + 1, rnk + n + 1, [] (int x, int y) { return a[x] < a[y]; });const long long base = a[rnk[1]];const int L = rnk[1];for (int i = 1; i < n; ++i) {w[i] = a[rnk[i + 1]] + base;l[i] = L, r[i] = rnk[i + 1];rnk[i] = i;}for (int i = n; i < n + m; ++i) {scanf("%d%d%lld", l + i, r + i, w + i);rnk[i] = i;}std::sort(rnk + 1, rnk + n + m, [] (int x, int y) { return w[x] < w[y]; });int num = n - 1;for (int i = 1, u, v; i < n + m && num; ++i) {u = find(l[rnk[i]]), v = find(r[rnk[i]]);if (u != v) {f[u] = v;ans += w[rnk[i]];--num;}}printf("%lld\n", ans);return 0;
}

转载于:https://www.cnblogs.com/Memory-of-winter/p/10340017.html

[CF1095F]Make It Connected相关推荐

trogan连接不上_解决连接不上网（Connection not connected）.doc
解决连接不上网(Connection not connected).doc 解决连接不上网(Connection not connected) The computer doesn't connect ...
HDU 4635 Strongly connected（缩点、最多可加边数使得仍然非强连通）
整理的算法模板合集: ACM模板 HDU 4635 Strongly connected Give a simple directed graph with N nodes and M edges. ...
网络模型--Densely Connected Convolutional Networks
Densely Connected Convolutional Networks CVPR2017 best paper Code: https://github.com/liuzhuang13/De ...
（全网率先解决）Pycharm在Debug的时候出现frames are not available；Variable：Connected
先说说我的情况,这样可以让你对号入座. 我是本地笔记本电脑使用Pycharm,但是Pycharm的Python解释器连接的是远程的实验室linux服务器.也就是说,你猜到了,我的是Pycharm专业版 ...
程序运行过程中遇到“ORA-03114: not connected to ORACLE”的问题解决
程序运行过程中遇到"ORA-03114: not connected to ORACLE"的问题解决参考文章: (1)程序运行过程中遇到"ORA-03114: not ...
ORA-01940: cannot drop a user that is currently connected 问题解析
xxx为待删除的用户名 SQL> drop user xxx cascade; 删除数据库用户的时候经常会遇到这样的错误: ORA-01940: cannot drop a user that ...
【CF913F】Strongly Connected Tournament 概率神题
[CF913F]Strongly Connected Tournament 题意:有n个人进行如下锦标赛: 1.所有人都和所有其他的人进行一场比赛,其中标号为i的人打赢标号为j的人(i<j)的概 ...
论文阅读：DENSELY CONNECTED CONVOLUTIONAL NETWORKS
概述作者观察到目前的深度网络有一个重要的特点是shorted connected,认为能够训练极深的网络很可能就是由于这个原因. 于是作者提出了Densely connected convoluti ...
对Keil在线烧录程序弹出“The firmware of the connected J-Link[SN:xxxxxxxx] does not support......的问题解决
问题:最近下载并使用Keil_v5.29,在线烧录程序时出现"The firmware of the connected J-Link[SN:xxxxxxxx] does not suppo ...

[CF1095F]Make It Connected

[CF1095F]Make It Connected相关推荐

最新文章

热门文章