ACM刷题之POJ————Pots

最新推荐文章于 2019-03-22 15:20:09 发布

原创

最新推荐文章于 2019-03-22 15:20:09 发布 · 697 阅读

1 ·

CC 4.0 BY-SA版权

该博客介绍了ACM竞赛中的一道题目——Pots，要求找到将两个容量为A和B升的壶通过填充、倒空和倾倒操作达到C升水的最短操作序列。博客提供了输入输出示例，并强调了搜索算法在解决此类问题中的应用，还分享了使用字符串记录操作路径的方法和ACM竞赛中得到正确答案的代码。

Pots

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 20922		Accepted: 8916		Special Judge

Description

You are given two pots, having the volume of A and B liters respectively. The following operations can be performed:

FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap;
DROP(i) empty the pot i&nbs

最低0.47元/天解锁文章

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

小时的枫

关注关注

0
点赞
踩
1

收藏

觉得还不错? 一键收藏
0
评论
分享

复制链接

分享到 QQ

分享到新浪微博

扫一扫
举报

举报

专栏目录

ACM刷题之HDU————相遇周期（真·打表（素数筛选））

小时的枫的博客

04-07

1125

相遇周期 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3136 Accepted Submission(s): 1465 Problem Description 2007

ACM刷题之HDU————Saving HDU 以及老人是真饿了（贪心算法）

小时的枫的博客

04-01

1343

随着前几天做了两道有关贪心算法的题目后，终于来到了hdu的steps 里的Chapter Two 了下面是题目 Saving HDU Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8369 Accepted Sub

参与评论您还未登录，请先登录后发表或查看评论

快速切题 poj3414 Pots

weixin_30731305的博客

09-25

168

Pots Time Limit:1000MS Memory Limit:65536K Total Submissions:10042 Accepted:4221 Special Judge Description You are given two pots, having the volume ofAand...

pojPots

weixin_30521161的博客

08-29

216

http://poj.org/problem?id=3414 1 #include<cstdio> 2 #include<cstring> 3 #define MAXN 1000000 4 using namespace std; 5 6 int c,d,e,ans,l; 7 bool vis[120][120]; ...

POJ3414-Pots

07-31

北大POJ3414-Pots 解题报告+AC代码

poj 3414 Pots （bfs+路径记录）

Coding A World

10-05

1671

Pots Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10071 Accepted: 4237 Special Judge Description You are given two pots, having the volume of A an

Pots POJ - 3414

weixin_30307921的博客

05-19

208

PotsPOJ - 3414You are given two pots, having the volume ofAandBliters respectively. The following operations can be performed:FILL(i) fill the poti(1 ≤i≤ 2) from the ...

ACM刷题之POJ————Drying

小时的枫的博客

04-13

557

DryingTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 20641 Accepted: 5202DescriptionIt is very hard to wash and especially to dry clothes in winter. But Jane is a very smart girl. She is no...

ACM刷题之codeforce————Arpa and a research in Mexican wave

小时的枫的博客

09-05

520

A. Arpa and a research in Mexican wave time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Arpa is researching t

POJ 3414 Pots

退役的铜牌狗

02-07

728

POJ 3414 Pots题目描述 You are given two pots, having the volume of A and B liters respectively. The following operations can be performed:1.FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap;2

POJ 3151:Pots

Cathy1122334455的博客

03-22

369

#include <bits/stdc++.h> using namespace std; int A, B, C; struct Status{ int a, b; int prev; int mov; //用来定义operation int src, dest; }; Status que[11000]; int head = 0, tail = 1; int flag...

第一道广搜记录路径

wa的一声就哭了

12-18

280

给你两个容器，分别能装下A升水和B升水，并且可以进行以下操作 FILL(i) 将第i个容器从水龙头里装满(1 ≤ i ≤ 2); DROP(i) 将第i个容器抽干 POUR(i,j) 将第i个容器里的水倒入第j个容器（这次操作结束后产生两种结果，一是第j个容器倒满并且第i个容器依旧有剩余，二是第i个容器里的水全部倒入j中，第i个容器为空）现在要求你写一个程序...

Pots POJ

jiang_1603的博客

08-01

320

You are given two pots, having the volume of A and B liters respectively. The following operations can be performed: FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap; DROP(i) empty the pot i to the

sdutacm-Pots

axuhongbo的博客

03-04

518

山东理工acm平台题解

poj Pots（BFS）（路径记录）（模拟）

Darkarts

01-05

642

Pots Description You are given two pots, having the volume of A and B liters respectively. The following operations can be performed: FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap;

POJ 3414-Pots(BFS)

Rocky0429

08-16

2109

题目地址：POJ 3414 题意：给你a，b两个容器的容量，六种操作方法，问最少多少次可以使其中一个容器里的水达到体积c，如果不能的话则输出impossible。思路：一共有6种操作方法，0:倒满a，1:倒满b，2:把a里的水倒向b(两种情况b倒满a有剩余或者a倒完)，3:把b里的水倒向a(类似2的两种情况)，4:把a倒空，5:把b倒空。然后用vis[i][j]记录当a的容量为i,b的容量为j

Pots POJ - 341

ln2037的博客

03-11

267

Pots POJ - 341 You are given two pots, having the volume of A and B liters respectively. The following operations can be performed: FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap; DROP(i) ...

LetsOJ多人刷题打卡平台——ACM在线训练资源

“LetsOJ_多人刷题打卡-ACM资源”作为一个集成了在线判题、进度管理、多人互动与开源共享特性的综合性平台，为算法爱好者提供了一个高效、可持续、可扩展的学习环境，是备战ACM及其他编程竞赛不可或缺的重要工具之一...