图图图图图
OneDay_pyf
这个作者很懒,什么都没留下…
展开
-
ECNU-3260
袋鼠妈妈找孩子 Time limit per test: 1.5 seconds Time limit all tests: 10.0 seconds Memory limit: 256 megabytes袋鼠妈妈找不到她的孩子了。她的孩子被怪兽抓走了。袋鼠妈妈现在在地图的左上角,她的孩子在地图第 x 行第 y 列的位置。怪兽想和袋鼠妈妈玩一个游戏:他不想让袋鼠妈妈过快地找到她的孩子。袋鼠妈妈原创 2017-05-14 14:45:32 · 329 阅读 · 0 评论 -
Codeforces854D Jury Meeting
题意:告诉你有n+1个城市,标号0-n,0号是个中心,然后其他n个点每个有一个智障他们都要到0点然后他们n个智障需要在0点至少共同py k天,然后再各自飞回各自原来的城市,飞机要么从0飞到一个城市,要么从一个城市飞到0 题解:我觉得我已经彻底咸鱼了,,,C做了贼久还是队友点了一下才觉得那么简单,,看D的时候已经有点放弃了=-=看题就在瞎看没看到加粗的那句话,感觉血崩。。其实已经想到了相当于两个过程原创 2017-09-07 00:28:03 · 743 阅读 · 0 评论 -
hdu6200mustedge mustedge mustedge
Give an connected undirected graph with n nodes and m edges, (n,m≤105) which has no selfloops or multiple edges initially. Now we have q operations (q≤105):⋅1 u v: add an undirected edge from u to v;原创 2017-09-13 20:02:40 · 713 阅读 · 0 评论 -
树的重心
今天想起来学树上点分治,其实我还是不明白为啥,大概就学了一手树的重心吧2333 定义是去掉重心之后能使剩下的每个子树尽量平衡。那么先处理出每个点子树的size,然后枚举去掉每个点后最大子树最小的就是重心。最大子树包括两部分,由于dfs求size的时候是自己设定根为1的,而求重心判断的时候是以当前点为根的,所以除了正常的这个点的子树外,他的父亲所在的也作为他的一课子树模版题 poj 1655让你求原创 2017-07-23 21:36:33 · 438 阅读 · 0 评论 -
2017年上海金马五校程序设计竞赛(网上资格赛)Problem E : A No-story Kingdom
Description In an unknown island, there is a tree kingdom whose structure is just like a tree. It has a city called root city and as your expectation, this root city has several son cities. And every原创 2017-06-10 17:04:11 · 554 阅读 · 0 评论 -
shuoj_1559
1559: 无向图的连通分支Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 783 Solved: 451[Submit][Status][Web Board]Description输入一个无向图G,计算G的连通分支数。Input有多个无向图数据。每个无向描述的第1行是两个整数n和e,分别表示顶点数和边数。原创 2017-04-21 02:53:55 · 350 阅读 · 0 评论 -
Information Graph CodeForces - 466E
There are n employees working in company “X” (let’s number them from 1 to n for convenience). Initially the employees didn’t have any relationships among each other. On each of m next days one of the f原创 2017-05-08 10:13:06 · 347 阅读 · 0 评论 -
570D - Tree Requests
Roman planted a tree consisting of n vertices. Each vertex contains a lowercase English letter. Vertex 1 is the root of the tree, each of the n - 1 remaining vertices has a parent in the tree. Vertex i原创 2017-05-15 10:07:54 · 413 阅读 · 0 评论 -
Codeforces455C. Civilization
Andrew plays a game called “Civilization”. Dima helps him.The game has n cities and m bidirectional roads. The cities are numbered from 1 to n. Between any pair of cities there either is a single (uniq原创 2017-05-14 15:37:55 · 414 阅读 · 0 评论 -
Weak Pair HDU - 5877
You are given a rootedrooted tree of NN nodes, labeled from 1 to NN. To the iith node a non-negative value aiai is assigned.An orderedordered pair of nodes (u,v)(u,v) is said to be weakweak if (1)原创 2017-05-14 15:16:50 · 655 阅读 · 0 评论 -
Sparse Graph HDU - 5876
In graph theory, the complementcomplement of a graph GG is a graph HH on the same vertices such that two distinct vertices of HH are adjacent if and only if they are notnot adjacent in GG. Now you are原创 2017-05-14 15:03:27 · 316 阅读 · 0 评论 -
bzoj1969LANE 航线规划
对Samuel星球的探险已经取得了非常巨大的成就,于是科学家们将目光投向了Samuel星球所在的星系——一个巨大的由千百万星球构成的Samuel星系。 星际空间站的Samuel II巨型计算机经过长期探测,已经锁定了Samuel星系中许多星球的空间坐标,并对这些星球从1开始编号1、2、3……。 一些先遣飞船已经出发,在星球之间开辟探险航线。 探险航线是双向的,例如从1号星球到3号星球开辟探险航线,那原创 2017-09-13 01:59:35 · 518 阅读 · 0 评论