junior19的博客

Anniversary partyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7937 Accepted: 4549DescriptionThere is going to be a party to celebrate the 80-th Ann

D. Hamiltonian Spanning Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA group of n cities is connected by a network of roads. There is an un...

1063: [Noi2008]道路设计Time Limit: 20 Sec  Memory Limit: 162 MBSubmit: 1147  Solved: 619[Submit][Status][Discuss]Description　　Z国坐落于遥远而又神奇的东方半岛上，在小Z的统治时代公路成为这里主要的交通手段。Z国共有n座城市，一些城市之间由双向的公路所连接

3566: [SHOI2014]概率充电器Time Limit: 40 Sec  Memory Limit: 256 MBSubmit: 1388  Solved: 603[Submit][Status][Discuss]Description著名的电子产品品牌 SHOI 刚刚发布了引领世界潮流的下一代电子产品——概率充电器:“采用全新纳米级加工技术,实现元件与导线能否

transaction transaction transactionTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 132768/132768 K (Java/Others)Total Submission(s): 2245    Accepted Submission(s): 682Problem Desc

E. Mahmoud and a xor triptime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMahmoud and Ehab live in a countr

Sereja has a rooted tree of N nodes with node 1 being the root node. He wants to find the number of ways of assigning an integer in the range [1, M] to each node, such that value of each node should

题意：一棵树，每个节点有个权值k[i]和颜色c[i]，定义以节点u为根节点的序列为“好的序列”条件是：能够找到一条有序链，该链以u节点开始，链的长度为k[i]+1，链的成员颜色均为c[i]，对于链上第j个元素，j-1和j+1个元素必须是其祖先和子孙，问对每个节点求出它的好的序列数。思路：官方题解 树形dp，dp[i][j]为i颜色j长度的链数，ans[u]为u节点的好序列数，那么ans[u]

C. Bear and Tree Jumpstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA tree is an undirected connected gr

C. Centroidstime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputTree is a connected acyclic graph. Suppose you

Tree chain problemTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1779    Accepted Submission(s): 577Problem DescriptionCoco has

The more, The BetterTime Limit: 6000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8177    Accepted Submission(s): 4784Problem DescriptionACboy

题目描述现在我们的手头有N个软件，对于一个软件i，它要占用Wi的磁盘空间，它的价值为Vi。我们希望从中选择一些软件安装到一台磁盘容量为M计算机上，使得这些软件的价值尽可能大（即Vi的和最大）。但是现在有个问题：软件之间存在依赖关系，即软件i只有在安装了软件j（包括软件j的直接或间接依赖）的情况下才能正确工作（软件i依赖软件j)。幸运的是，一个软件最多依赖另外一个软件。如果一个软件不能正常工...