搜索
SillyVicky
这个作者很懒,什么都没留下…
展开
-
POJ 2362 Square
SquareTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 18078 Accepted: 6282DescriptionGiven a set of sticks of various lengths, is it possible to join them转载 2013-07-21 17:35:23 · 351 阅读 · 0 评论 -
HDU 2579 Dating with girls(2)
题意:给出r*c的图 以及时间k图中'.'代表通路 '#'代表障碍物当时间为k的倍数时 障碍物消失问从起始点到终点的最短时间 代码:#include#include#include#define MAX 102using namespace std;struct node{ int x,y,time;};queue q;c转载 2013-08-16 18:12:40 · 430 阅读 · 0 评论 -
HDU 4308 Saving Princess claire_
http://acm.hdu.edu.cn/showproblem.php?pid=4308 题意:给出一个r*c的图以及走一步所需的花费'Y'表示起始点 'C'表示重点'*'表示可以达到的点 '#'表示不能达到的点'P'表示可瞬间转换的点,及若从一个'P'点进入,可由下一个'P'点开始搜索求到达'C'点的最小花费('P'点间转化不需要花费) 代码:#i转载 2013-08-16 15:26:56 · 444 阅读 · 0 评论 -
POJ 3278 Catch That Cow
Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 37605 Accepted: 11656DescriptionFarmer John has been informed of the location of a fugitiv转载 2013-07-29 13:46:54 · 301 阅读 · 0 评论 -
POJ 2488 A Knight's Journey
A Knight's JourneyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25252 Accepted: 8584DescriptionBackgroundThe knight is getting bored of seeing the s转载 2013-07-22 23:32:04 · 379 阅读 · 0 评论 -
POJ 1129 Channel Allocation
Channel AllocationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10768 Accepted: 5521DescriptionWhen a radio station is broadcasting over a very large ar转载 2013-07-22 16:54:35 · 339 阅读 · 0 评论 -
POJ 2049 Finding Nemo
Finding NemoTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 6880 Accepted: 1576DescriptionNemo is a naughty boy. One day he went into the deep sea all by转载 2013-07-23 10:29:03 · 388 阅读 · 0 评论 -
POJ 1033 Defragment
DefragmentTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 3242 Accepted: 1128Case Time Limit: 1000MS Special JudgeDescriptionYou are taking part转载 2013-07-22 01:16:47 · 452 阅读 · 0 评论 -
POJ 1011 Sticks
SticksTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 109705 Accepted: 25147DescriptionGeorge took sticks of the same length and cut them randomly until a转载 2013-07-21 21:00:35 · 308 阅读 · 0 评论 -
HDU 4198 Quick out of the Harbour(优先队列)
题意:给出h*w的图 图中'@'表示桥 给出通过桥的时间k求最短离开的时间 代码: #include#include#include#define MAX 502using namespace std;struct node{ int x,y,time; friend bool operator < (node a,node b) //时间转载 2013-08-16 19:08:19 · 462 阅读 · 0 评论