2013年8月21日
Paid Roads
摘要： Problem DescriptionA network of m roads connects N cities (numbered from 1 to N). There may be more than one road connecting one city with another. Some of the roads are paid. There are two ways to pay for travel on a paid road i from city ai to city bi:in advance, in a city ci (which may or may not 阅读全文
posted @ 2013-08-21 20:55 persistent codeants 阅读(166) 评论(0) 推荐(0)
Apple Tree
摘要： Problem DescriptionWshxzt is a lovely girl. She likes apple very much. One day HX takes her to an apple tree. There are N nodes in the tree. Each node has an amount of apples. Wshxzt starts her happy trip at one node. She can eat up all the apples in the nodes she reaches. HX is a kind guy. He knows 阅读全文
posted @ 2013-08-21 17:54 persistent codeants 阅读(320) 评论(0) 推荐(0)
1128. Partition into Groups
摘要： 1128. Partition into GroupsTime limit: 0.5 second Memory limit: 64 MBThere areNchildren in the kindergarten. Unfortunately, the children quarrel though not often. Each child has not more than three adversaries. Is it possible to partition the children into two groups (possibly not equal), so that ea 阅读全文
posted @ 2013-08-21 14:10 persistent codeants 阅读(299) 评论(0) 推荐(0)