世界很大

小希的迷宫Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28865    Accepted Submission(s): 8910Problem Description上次Gardon的迷宫城堡小希玩了很久（见

Junk-Mail FilterTime Limit: 15000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7063    Accepted Submission(s): 2254Problem DescriptionRecogn

The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 26901 Accepted: 13142DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumo

Ice_cream's world ITime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 701    Accepted Submission(s): 401Problem Descriptionice_cream'

湫湫系列故事——设计风景线Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 3482    Accepted Submission(s): 610Problem Description　　随着杭州西湖的知名度的

Play on WordsTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5903    Accepted Submission(s): 1973Problem DescriptionSome of the s

More is betterTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 16707    Accepted Submission(s): 6152Problem DescriptionMr Wang wa

合纵连横时间限制：1000 ms  |  内存限制：65535 KB难度：3描述乱世天下，诸侯割据。每个诸侯王都有一片自己的领土。但是不是所有的诸侯王都是安分守己的，实力强大的诸侯国会设法吞并那些实力弱的，让自己的领土面积不断扩大。而实力弱的诸侯王为了不让自己的领土被吞并，他会联合一些其他同样弱小的诸侯国，组成联盟(联盟不止一个)，来共同抵抗那些强大的诸侯国

TravelTime Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 613    Accepted Submission(s): 248Problem DescriptionJack likes to trave

PseudoforestTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2126    Accepted Submission(s): 828Problem DescriptionIn graph theo

treeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 180    Accepted Submission(s): 95Problem DescriptionThere is a tree(the tree

StabilityTime Limit: 3000/2000 MS (Java/Others)    Memory Limit: 65535/102400 K (Java/Others)Total Submission(s): 1184    Accepted Submission(s): 259Problem DescriptionGiven an undirec

题目链接：Codeforces 366D Dima and Trap Graph D. Dima and Trap Graph time limit per test3 seconds memory limit per test256 megabytes inputstandard input outputstandard output Dima and Inna love spend

题目链接：Codeforces 400D Dima and Bacteria

题目链接：Codeforces 300B Coach

Rikka with GraphTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 622    Accepted Submission(s): 283Problem DescriptionAs we know,

Marriage Match IITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2678    Accepted Submission(s): 898Problem DescriptionPresumabl

Marriage Match IIITime Limit: 10000/4000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1622    Accepted Submission(s): 480Problem DescriptionPresuma

畅通工程Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32816    Accepted Submission(s): 17312Problem Description某省调查城镇交通状况，得到现有城镇道路统计

How Many TablesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15314    Accepted Submission(s): 7501Problem DescriptionToday is Ig

一笔画问题时间限制：3000 ms  |            内存限制：65535 KB难度：4描述 zyc从小就比较喜欢玩一些小游戏，其中就包括画一笔画，他想请你帮他写一个程序，判断一个图是否能够用一笔画下来。规定，所有的边都只能画一次，不能重复画。 输入第一行只有一个正整数N(N每组测试数据的第一行有两个正整数P,Q(P随后的Q行，每行有两个正

Is It A Tree?Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15964    Accepted Submission(s): 3578Problem DescriptionA tree is a w

Farm IrrigationTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6386    Accepted Submission(s): 2769Problem DescriptionBenny has a

欧拉回路Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10015    Accepted Submission(s): 3663Problem Description欧拉回路是指不令笔离开纸面，可画过图中每条边

最舒适的路线时间限制：5000 ms  |           内存限制：65535 KB难度：5描述 异形卵潜伏在某区域的一个神经网络中。其网络共有N个神经元（编号为1,2,3,…,N），这些神经元由M条通道连接着。两个神经元之间可能有多条通道。异形卵可以在这些通道上来回游动，但在神经网络中任一条通道的游动速度必须是一定的。当然异形卵不希望从一条通道游动到另一条通道速度变化太

find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4360    Accepted Submission(s): 1881Problem Descriptio

10400: B.海岛争霸 Time Limit: 2 Sec  Memory Limit: 128 MBSubmit: 25  Solved: 12[Submit][Status][Web Board]Description神秘的海洋，惊险的探险之路，打捞海底宝藏，激烈的海战，海盗劫富等等。加勒比海盗，你知道吧？杰克船长驾驶着自己的的战船黑珍珠1号要征服各个海岛的

FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 28514 Accepted: 9263DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly

食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 50713 Accepted: 14818Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 现有N个动物，以1－N编号。每个动物都是A

Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 34621 Accepted: 10675DescriptionThe police office in Tadu City decides to say ends to

A Bug's Life Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10618    Accepted Submission(s): 3451Problem DescriptionBackground

Virtual FriendsTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6154    Accepted Submission(s): 1741Problem DescriptionThese da

Connections between citiesTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6497    Accepted Submission(s): 1693Problem Descripti

Closest Common AncestorsTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 17233 Accepted: 5526DescriptionWrite a program that takes as input a rooted tree

Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21733 Accepted: 11380DescriptionA rooted tree is a well-known data structure in

题目链接：fzoj Problem 2233 ~APTX4869Problem 2233 ~APTX4869 Accept: 15 Submit: 37 Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description 为了帮助柯南回到一米七四，阿笠博士夜以继日地研究APTX4869的解药。他得出了如下结果：1