生成树
文章平均质量分 85
tomjobs
别慌,慌也没用
展开
-
Codeforces-1496 F. BFS Trees(生成树,最短路)
We define a spanning tree of a graph to be a BFS tree rooted at vertex ???? if and only if for every node ???? the shortest distance between ???? and ???? in the graph is equal to the shortest distance between ???? and ???? in the spanning tree.Given a gr原创 2021-03-13 13:25:29 · 277 阅读 · 0 评论 -
H - Optimization for UltraNet Gym - 102835H(最小生成树)
题意:求一棵生成树树,任意两点距离为其路径边上最短边。生成树权值为其任意两点距离的和。要使得生成树最小边最大,然后权值最小。思路:可以想到,肯定是所选的边权值越小越好。同时最小边要足底啊,所以就是确定最小权值边以后,剩下边选最小的几个。这个过程我们要二分枚举最小边,使得最小边最大。可以按边统计答案,就是dfsdfsdfs每次取最小的边,那么这条边分割出两个连通块,大小分别为size1,size2size1,size2size1,size2,边的权值为valvalval,那么这条边的贡献就是size1原创 2020-11-28 11:32:02 · 899 阅读 · 1 评论 -
I - Imperial roads Gym - 101889I(LCA+最小生成树)
题意:一个有权图,求每次必须选一个边的最小生成树值。思路:先跑出最小生成树,然后对于给出的x,y,在最小生成树上找到其路径,删掉一条最大边,再加上(x,y)这条边就是最小生成树的值了。#include<cstdio>#include<cmath>#include<algorithm>#include<vector>#include<map>using namespace std;typedef long long ll;c原创 2020-10-28 11:18:42 · 220 阅读 · 0 评论 -
H - Traveling Plan ZOJ - 4001(路径最大值最小,最小生成树)
BaoBao loves traveling very much. There are (N) cities marked on his traveling map, and some of them have food supplies while others have not.During his journey, he must take enough food so that he won’t starve. There are (M) roads on the map, each connec原创 2020-10-14 15:31:42 · 191 阅读 · 0 评论 -
Codeforces 1408 E. Avoid Rainbow Cycles(最大生成树,思维)
You are given ???? sets of integers ????1,????2,…,????????; elements of these sets are integers between 1 and ????, inclusive.There are two arrays of positive integers ????1,????2,…,???????? and ????1,????2,…,????????.In one operation you can delete an e原创 2020-10-02 20:13:58 · 280 阅读 · 0 评论 -
2020杭电多校第六场 A Very Easy Graph Problem(最小生成树)
Problem DescriptionAn undirected connected graph has n nodes and m edges, The i-th edge’s length is 2i. Each node i has a value ai, which is either 0 or 1. You need to calculate:∑i=1n∑j=1nd(i,j)×[ai=1∧aj=0]d(i,j) indicates the shortest distance between原创 2020-08-07 00:28:58 · 371 阅读 · 0 评论 -
2020牛客多校第五场 Graph(异或最小生成树)
链接:https://ac.nowcoder.com/acm/contest/5670/B来源:牛客网题目描述Mr. W got a new graph with N vertices and N - 1 edges. It’s a connected graph without cycles. Each edge should have an ugly value. To make the graph more beautiful, Mr. W hope you can help him modif原创 2020-07-26 00:48:33 · 563 阅读 · 0 评论 -
Codeforces 888G. Xor-MST(异或最小生成树)
You are given a complete undirected graph with n vertices. A number a i is assigned to each vertex, and the weight of an edge between vertices i and j is equal to a i xor a j.Calculate the weight of the minimum spanning tree in this graph.InputThe first原创 2020-07-26 00:39:57 · 745 阅读 · 0 评论 -
D. Disaster Recovery(最小生成树)2020 年 “联想杯”全国高校程序设计在线邀请赛暨第三届上海理工大学程序设计竞赛
题意:每个边的边权为边上两个点对应斐波那契数列值的和。求一个最小生成树,并使得度数最大顶点最小。思路:由斐波那契数列性质,一条边只要顶点下标最大的那个更大,那就一定是最大的。所以只需要按照边的顶点进行排序就好了,而这个mst是唯一的,所以直接输出。#include <ctime>#include <iostream>#include <assert.h>#include <vector>#include <queue>#in.原创 2020-05-31 00:26:10 · 409 阅读 · 0 评论 -
ACWING349. 黑暗城堡(最小路径生成树)
在顺利攻破Lord lsp的防线之后,lqr一行人来到了Lord lsp的城堡下方。Lord lsp黑化之后虽然拥有了强大的超能力,能够用意念力制造建筑物,但是智商水平却没怎么增加。现在lqr已经搞清楚黑暗城堡有N个房间,M条可以制造的双向通道,以及每条通道的长度。lqr深知Lord lsp的想法,为了避免每次都要琢磨两个房间之间的最短路径,Lord lsp一定会把城堡修建成树形的。但是,...原创 2020-03-27 21:38:23 · 260 阅读 · 0 评论 -
ACWING347. 野餐规划(最小生成树)
一群小丑演员,以其出色的柔术表演,可以无限量的钻进同一辆汽车中,而闻名世界。现在他们想要去公园玩耍,但是他们的经费非常紧缺。他们将乘车前往公园,为了减少花费,他们决定选择一种合理的乘车方式,可以使得他们去往公园需要的所有汽车行驶的总公里数最少。为此,他们愿意通过很多人挤在同一辆车的方式,来减少汽车行驶的总花销。由此,他们可以很多人驾车到某一个兄弟的家里,然后所有人都钻进一辆车里,再继续前进...原创 2020-03-24 23:44:39 · 350 阅读 · 1 评论 -
BZOJ3714. [PA2014]Kuglarz(最小生成树)
Description魔术师的桌子上有n个杯子排成一行,编号为1,2,…,n,其中某些杯子底下藏有一个小球,如果你准确地猜出是哪些杯子,你就可以获得奖品。花费c_ij元,魔术师就会告诉你杯子i,i+1,…,j底下藏有球的总数的奇偶性。采取最优的询问策略,你至少需要花费多少元,才能保证猜出哪些杯子底下藏着球?Input第一行一个整数n(1<=n<=2000)。第i+1行(1&l...原创 2019-11-29 18:37:32 · 373 阅读 · 0 评论 -
[JSOI2010]Group 部落划分 Group(最小生成树)
题目描述聪聪研究发现,荒岛野人总是过着群居的生活,但是,并不是整个荒岛上的所有野人都属于同一个部落,野人们总是拉帮结派形成属于自己的部落,不同的部落之间则经常发生争斗。只是,这一切都成为谜团了——聪聪根本就不知道部落究竟是如何分布的。 不过好消息是,聪聪得到了一份荒岛的地图。地图上标注了N个野人居住的地点(可以看作是平面上的坐标)。我们知道,同一个部落的野人总是生活在附近。我们把两个部落的距离,...原创 2019-10-10 13:03:20 · 149 阅读 · 0 评论 -
bzoj1601[Usaco2008 Oct]灌水(最小生成树)
展开题目背景John的农场缺水了!!!题目描述Farmer John has decided to bring water to his N (1 <= N <= 300) pastures which are conveniently numbered 1…N. He may bring water to a pasture either by building a well...原创 2019-09-30 10:40:24 · 226 阅读 · 0 评论 -
B - Desert King POJ - 2728(01分数规划最优比率生成树)
David the Great has just become the king of a desert country. To win the respect of his people, he decided to build channels all over his country to bring water to every village. Villages which are co...原创 2019-08-15 23:15:44 · 175 阅读 · 0 评论 -
346. 走廊泼水节(最小生成树,连接成完全图)
给定一棵N个节点的树,要求增加若干条边,把这棵树扩充为完全图,并满足图的唯一最小生成树仍然是这棵树。求增加的边的权值总和最小是多少。输入格式第一行包含整数t,表示共有t组测试数据。对于每组测试数据,第一行包含整数N。接下来N-1行,每行三个整数X,Y,Z,表示X节点与Y节点之间存在一条边,长度为Z。输出格式每组数据输出一个整数,表示权值总和最小值。每个结果占一行。数据范围N≤6...原创 2019-08-20 20:22:47 · 248 阅读 · 0 评论 -
A - Slim Span POJ - 3522(最小生成树最大最小值差值最大)
Given an undirected weighted graph G, you should find one of spanning trees specified as follows.The graph G is an ordered pair (V, E), where V is a set of vertices {v1, v2, …, vn} and E is a set of ...原创 2019-08-15 01:10:33 · 214 阅读 · 0 评论