题目是汉语的,不可能看不懂意思吧。。。
这个题写代码写了一会就写完了,交上去1A,然而之前一直不敢动手写,因为觉得没试过呀,三个瓶子相互倒水呢还要,不大敢写,其实依然是简单的BFS,代码的整体框架都没有变,只是中间寻找下一节点发生了变化,变成了倒水,这个过程是自己写函数模拟的,另外就是visit数组,刚开始也是怕~ 哎呀 怎么标记呢,后来直接开了一个三维数组 搞定,,题目不难,就是我的效率低了一些 109ms
//leehaoze
#include <iostream>
#include <deque>
#include <string>
#include <vector>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <cstdio>
#include <cmath>
#include <cstdlib>
using namespace std;
const int INF = 1<<29;
#define INC_SAT( val ) (val = ((val)+1 > (val)) ? (val)+1 : (val))
#define ARR_SIZE( a ) ( sizeof( (a) ) / sizeof( (a[0]) ) )
#define ULL unsigned long long
#define MAXN 101
struct Bolt{
Bolt(int w,int s):water_(w),size_(s){}
int water_;
int size_;
};
struct Pos{
Pos(Bolt n,Bolt m,Bolt s,int step):N_(n),M_(m),S_(s),step_(step){}
Bolt N_,M_,S_;
int step_;
};
void Pour(Bolt &A, Bolt &B){
if(A.water_ > B.size_ - B.water_){
A.water_ -= (B.size_ - B.water_);
B.water_ = B.size_;
}
else{
B.water_ += A.water_;
A.water_ = 0;
}
}
int N,M,S;
bool visit[MAXN][MAXN][MAXN];
bool Input(){
scanf("%d%d%d",&S,&N,&M);
return !(N == 0 && M == 0 && S == 0);
}
void Set_True(Bolt &n,Bolt &m,Bolt &s){
visit[n.water_][m.water_][s.water_] = true;
}
bool Legal(Bolt &n,Bolt &m,Bolt &s){
return !visit[n.water_][m.water_][s.water_];
}
int BFS(){
if(S%2 != 0)return -1;
memset(visit,0,sizeof visit);
queue<Pos> Q;
Q.push(Pos(Bolt(0,N),Bolt(0,M),Bolt(S,S),0));
visit[0][0][S] = true;
while(!Q.empty()){
Pos now = Q.front();
Q.pop();
if(now.S_.water_ == S / 2){
return now.step_;
}
for (int i = 0; i < 6; ++i) {
Bolt dN = now.N_;
Bolt dM = now.M_;
Bolt dS = now.S_;
switch(i){
case 0:Pour(dN,dM);break;
case 1:Pour(dM,dN);break;
case 2:Pour(dN,dS);break;
case 3:Pour(dS,dN);break;
case 4:Pour(dM,dS);break;
case 5:Pour(dS,dM);break;
}
if(Legal(dN,dM,dS)){
Set_True(dN,dM,dS);
Q.push(Pos(dN,dM,dS,now.step_ + 1));
}
}
}
return -1;
}
int main() {
#ifdef LOCAL
freopen("IN.txt", "r", stdin);
#endif
std::ios::sync_with_stdio(false);
while(Input()){
int ans = BFS();
if(ans == -1)cout << "NO" << endl;
else cout << ans << endl;
}
}