搜索
关注
分享
扫一扫
SillyVicky
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ 2362 Square
Square Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 18078 Accepted: 6282 Description Given a set of sticks of various lengths, is it possible to join them转载 2013-07-21 17:35:23 · 391 阅读 · 0 评论 -
HDU 2579 Dating with girls(2)
题意： 给出r*c的图 以及时间k 图中'.'代表通路 '#'代表障碍物 当时间为k的倍数时 障碍物消失 问从起始点到终点的最短时间 代码： #include #include #include #define MAX 102 using namespace std; struct node { int x,y,time; }; queue q; c转载 2013-08-16 18:12:40 · 484 阅读 · 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 · 498 阅读 · 0 评论 -
POJ 3278 Catch That Cow
Catch That Cow Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 37605 Accepted: 11656 Description Farmer John has been informed of the location of a fugitiv转载 2013-07-29 13:46:54 · 351 阅读 · 0 评论 -
POJ 2488 A Knight's Journey
A Knight's Journey Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 25252 Accepted: 8584 Description Background The knight is getting bored of seeing the s转载 2013-07-22 23:32:04 · 420 阅读 · 0 评论 -
POJ 1129 Channel Allocation
Channel Allocation Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 10768 Accepted: 5521 Description When a radio station is broadcasting over a very large ar转载 2013-07-22 16:54:35 · 382 阅读 · 0 评论 -
POJ 2049 Finding Nemo
Finding Nemo Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 6880 Accepted: 1576 Description Nemo is a naughty boy. One day he went into the deep sea all by转载 2013-07-23 10:29:03 · 440 阅读 · 0 评论 -
POJ 1033 Defragment
Defragment Time Limit: 2000MS Memory Limit: 10000K Total Submissions: 3242 Accepted: 1128 Case Time Limit: 1000MS Special Judge Description You are taking part转载 2013-07-22 01:16:47 · 493 阅读 · 0 评论 -
POJ 1011 Sticks
Sticks Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 109705 Accepted: 25147 Description George took sticks of the same length and cut them randomly until a转载 2013-07-21 21:00:35 · 356 阅读 · 0 评论 -
HDU 4198 Quick out of the Harbour（优先队列）
题意： 给出h*w的图 图中'@'表示桥 给出通过桥的时间k 求最短离开的时间 代码： #include #include #include #define MAX 502 using namespace std; struct node { int x,y,time; friend bool operator < (node a,node b) //时间转载 2013-08-16 19:08:19 · 526 阅读 · 0 评论