Query on The Trees
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)
Total Submission(s): 3602 Accepted Submission(s): 1587
Problem Description
We have me...
分类：
其他好文 时间：
2015-08-28 02:12:39
阅读次数：
199
QTREE2 - Query on a tree II
no tags
You are given a tree (an undirected acyclic connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. Each edge has an integer value
assigned ...
分类：
其他好文 时间：
2015-08-27 02:14:59
阅读次数：
238
Housewife Wind
Time Limit: 4000MS
Memory Limit: 65536K
Total Submissions: 7639
Accepted: 1990
Description
After their royal wedding, Jiajia and Wind hid away in XX Vill...
Aragorn's Story
Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5505 Accepted Submission(s): 1441
Problem Description
Our protagoni...
分类：
其他好文 时间：
2015-08-25 21:36:04
阅读次数：
125
Tree
Time Limit: 5000MS
Memory Limit: 131072K
Total Submissions: 6131
Accepted: 1682
Description
You are given a tree with N nodes. The tree’s nodes are numbered 1 th...
分类：
其他好文 时间：
2015-08-20 22:39:10
阅读次数：
303
1553. Caves and Tunnels
Time limit: 3.0 second
Memory limit: 64 MB
After landing on Mars surface, scientists found a strange system of caves connected by tunnels. So they began to research...
分类：
其他好文 时间：
2015-08-19 11:15:07
阅读次数：
255
1036: [ZJOI2008]树的统计Count
Time Limit: 10 Sec Memory Limit: 162 MB
Submit: 8421 Solved: 3439
[Submit][Status][Discuss]
Description
一棵树上有n个节点，编号分别为1到n，每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成一些操作： I. CH...
分类：
其他好文 时间：
2015-08-18 22:53:02
阅读次数：
134
2002: [Hnoi2010]Bounce 弹飞绵羊
Time Limit: 10 Sec Memory Limit: 259 MB
Submit: 5421 Solved: 2863
[Submit][Status][Discuss]
Description
某天，Lostmonkey发明了一种超级弹力装置，为了在他的绵羊朋友面前显摆，他邀请小绵羊一起玩个游戏。游戏一开始，L...
分类：
其他好文 时间：
2015-08-17 23:48:28
阅读次数：
184
Problem 2082 过路费
Accept: 382 Submit: 1279
Time Limit: 1000 mSec Memory Limit : 32768 KB
Problem Description
有n座城市，由n-1条路相连通，使得任意两座城市之间可达。每条路有过路费，要交过路费才能通过。每条路的过路费经常会更新，现问你，当前情况下，从城市a...
分类：
其他好文 时间：
2015-08-17 19:35:50
阅读次数：
113
QTREE - Query on a tree
no tags
You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1.
We will ask you to perfrom some instructions ...
分类：
其他好文 时间：
2015-08-17 19:35:02
阅读次数：
104
