Dog_dream的博客

 题意：给你一棵树树上任意两节点有且仅有一条路径可以到达，问求任意两节点间的距离题解：LCA树上倍增o#include<cstdio>#include<cstdlib>#include<cstring>#include<iostream>#include<algorithm>#include<queue>...

题意：一张有向图，一问至少给几个点发送软件，才能让所有点都能收到软件；二问是至少添加几条边才能让整个图是一个连通分量；题解：先求连通分量然后再把同一个连通分量的点缩为一个点，再求所有点的入度和出度 答案一就是入度 答案二就是max(in,out) 注意：当只有一个连通分量时答案为0#include<cstdio>#include<cstdlib>#include...

There are NN cities in the country, and MM directional roads from uu to v(1\le u, v\le n)v(1≤u,v≤n). Every road has a distance c_ici . Haze is a Magical Girl that lives in City 11, she can choose no m...

Problem DescriptionGiven a nn matrix Cij (1<=i,j<=n),We want to find a nn matrix Xij (1<=i,j<=n),which is 0 or 1.Besides,Xij meets the following conditions:1.X12+X13+…X1n=12.X1n+X2n+…X...

问题描述　　小明的实验室有N台电脑，编号1~N。原本这N台电脑之间有N-1条数据链接相连，恰好构成一个树形网络。在树形网络上，任意两台电脑之间有唯一的路径相连。　　不过在最近一次维护网络时，管理员误操作使得某两台电脑之间增加了一条数据链接，于是网络中出现了环路。环路上的电脑由于两两之间不再是只有一条路径，使得这些电脑上的数据传输出现了BUG。　　为了恢复正常传输。小明需要找到所有在环路上...

Invitation CardsTime Limit:8000MS Memory Limit:262144K Total Submissions:35810 Accepted:11770 DescriptionIn the age of television, not many people attend theater performan...

FroggerTime Limit:1000MS Memory Limit:65536K Total Submissions:68425 Accepted:21065 DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notic...

Heavy TransportationTime Limit:3000MS Memory Limit:30000K Total Submissions:56706 Accepted:14270 DescriptionBackgroundHugo Heavy is happy. After the breakdown of the Car...