随笔分类 -  HDU ACM Steps 9.3

9.3.1 Snail’s trouble
摘要:Snail’s troubleTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 48 Accepted Submission(s): 32 Problem Description Once upon a time, there was a poor snail. Every day, it tried very hard to crawl forward, while there was a keeper ... 阅读全文
posted @ 2013-09-23 17:10 cssystem 阅读(223) 评论(0) 推荐(1)
9.3.2 Queuing
摘要:QueuingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 36 Accepted Submission(s): 29 Problem Description Queues and Priority Queues are data structures which are known to most computer scientists. The Queue occurs often in our da... 阅读全文
posted @ 2013-09-23 17:09 cssystem 阅读(291) 评论(0) 推荐(1)
9.3.3 胜利大逃亡(续)
摘要:胜利大逃亡(续)Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 60 Accepted Submission(s): 40 Problem Description Ignatius再次被魔王抓走了(搞不懂他咋这么讨魔王喜欢)……这次魔王汲取了上次的教训,把Ignatius关在一个n*m的地牢里,并在地牢的某些地方安装了带锁的门,钥匙藏在地牢另外的某些地方。刚开始Ignatius被关在(sx,sy)的位置,离开... 阅读全文
posted @ 2013-09-23 17:03 cssystem 阅读(313) 评论(0) 推荐(1)
9.3.8 Equations
摘要:EquationsTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 50 Accepted Submission(s): 36 Problem Description Consider equations having the following form: a*x1^2+b*x2^2+c*x3^2+d*x4^2=0a, b, c, d are integers from the interval [-50,5... 阅读全文
posted @ 2013-09-23 17:02 cssystem 阅读(294) 评论(0) 推荐(1)
9.3.4 The Worm Turns
摘要:The Worm TurnsTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 76 Accepted Submission(s): 37 Problem Description Winston the Worm just woke up in a fresh rectangular patch of earth. The rectangular patch is divided into cells, and ... 阅读全文
posted @ 2013-09-22 17:17 cssystem 阅读(306) 评论(0) 推荐(1)