kuangbin - 博客园

HDU 3389 Game(博弈)

摘要： GameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 214Accepted Submission(s): 150Problem Descript... 阅读全文

posted @ 2013-07-26 20:00 kuangbin 阅读(1732) 评论(0) 推荐(0)

HDU 3032 Nim or not Nim?（博弈，SG打表找规律）

摘要： Nim or not Nim?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 613Accepted Submission(s): 282Problem DescriptionNim is a two-player mathematic game of strategy in which players take turns removing objects from distinct heaps. On each turn, a player 阅读全文

posted @ 2013-07-26 19:06 kuangbin 阅读(1303) 评论(0) 推荐(0)

HDU 4606 Occupy Cities （计算几何+最短路+二分+最小路径覆盖）

摘要： Occupy CitiesTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 509Accepted Submission(s): 125Problem DescriptionThe Star Wars is coming to an end as the Apple Planet is beaten by the Banana Planet. Captain Chen, the glorious leader of the Army of Ba 阅读全文

posted @ 2013-07-26 17:09 kuangbin 阅读(482) 评论(0) 推荐(0)

HDU 2897 邂逅明下（简单博弈，找规律）

摘要：邂逅明下Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1432Accepted Submission(s): 670Problem Description当日遇到月，于是有了明。当我遇到了你，便成了侣。那天，日月相会，我见到了你。而且，大地失去了光辉，你我是否成侣？这注定是个凄美的故事。（以上是废话）小t和所有世俗的人们一样，期待那百年难遇的日食。驻足街头看天，看日月渐渐走近，小t的脖子那个酸呀（他坚持这个姿势已经有半个多小时啦）。他低下仰起阅读全文

posted @ 2013-07-26 00:13 kuangbin 阅读(500) 评论(0) 推荐(0)

HDU 4618 Palindrome Sub-Array （2013多校2 1008 暴力）

摘要： Palindrome Sub-ArrayTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 173Accepted Submission(s): 80Problem Description A palindrome sequence is a sequence which is as same as its reversed order. For example, 1 2 3 2 1 is a palindrome sequence, but 1. 阅读全文

posted @ 2013-07-25 23:05 kuangbin 阅读(428) 评论(0) 推荐(0)

HDU 4617 Weapon (简单三维计算几何，异面直线距离)

摘要： WeaponTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 22Accepted Submission(s): 18Problem Description Doctor D. are researching for a horrific weapon. The muzzle of the weapon is a circle. When it fires, rays form a cylinder that runs through the . 阅读全文

posted @ 2013-07-25 21:14 kuangbin 阅读(1198) 评论(0) 推荐(0)

HDU 4612 Warm up（2013多校2 1002 双连通分量）

摘要： Warm upTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 90Accepted Submission(s): 12Problem Description N planets are connected by M bidirectional channels that allow instant transportation. It's always possible to travel between any two planet 阅读全文

posted @ 2013-07-25 17:59 kuangbin 阅读(1821) 评论(0) 推荐(0)

HDU 4619 Warm up 2（2013多校2 1009 二分匹配）

摘要： Warm up 2Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 28Accepted Submission(s): 8Problem Description Some 1×2 dominoes are placed on a plane. Each dominoe is placed either horizontally or vertically. It's guaranteed the dominoes in the 阅读全文

posted @ 2013-07-25 17:34 kuangbin 阅读(901) 评论(0) 推荐(0)

HDU 4614 Vases and Flowers (2013多校2 1004 线段树)

摘要： Vases and FlowersTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 38Accepted Submission(s): 10Problem Description Alice is so popular that she can receive many flowers everyday. She has N vases numbered from 0 to N-1. When she receive some flowers,. 阅读全文

posted @ 2013-07-25 17:33 kuangbin 阅读(2135) 评论(0) 推荐(0)

HDU 4611 Balls Rearrangement（2013多校2 1001题）

摘要： Balls RearrangementTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 25Accepted Submission(s): 8Problem Description Bob has N balls and A boxes. He numbers the balls from 0 to N-1, and numbers the boxes from 0 to A-1. To find the balls easily, he pu. 阅读全文

posted @ 2013-07-25 17:29 kuangbin 阅读(1648) 评论(7) 推荐(1)