非常可乐
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11450 Accepted Submission(s): 4614
Problem Description
大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以相互倒可乐 (都是没有刻度的,且 S==N+M,101>S>0,N>0,M>0) 。聪明的ACMER你们说他们能平分吗?如果能请输出倒可乐的最少的次数,如果不能输出"NO"。
Input
三个整数 : S 可乐的体积 , N 和 M是两个杯子的容量,以"0 0 0"结束。
Output
如果能平分的话请输出最少要倒的次数,否则输出"NO"。
Sample Input
7 4 3 4 1 3 0 0 0
Sample Output
NO 3
Author
seeyou
Source
嚯嚯嚯
1A嚯嚯嚯
主要这玩意是放在搜索专题下的。。。。。不然我也不知道要用搜索来做
最近1A率开始提高了呢。。哼哼哼。。。。
今晚是赵东伟上心里学的课,好期待啊。。。doki doki
题嘛。。其实想到用搜索来做的话很简单,水杯之间倒来倒去的过程比较麻烦
而且结果不能只有一杯达到S/2,要有两个杯子里有S/2。。。然而这并没有什么。。
下面代码:
/*
━━━━━┒
┓┏┓┏┓┃μ'sic foever!!
┛┗┛┗┛┃\○/
┓┏┓┏┓┃ /
┛┗┛┗┛┃ノ)
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┃┃┃┃┃┃
┻┻┻┻┻┻
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
const int maxn=1010;
const int INF=8000000;
int d[maxn];
struct unit{
int s,n,m;
bool operator<(const unit &b)const {
//return (this->entry<b.entry);
if(this->s==b.s&&this->n!=b.n){
return this->n<b.n;
}else if(this->s==b.s&&this->n==b.n){
return this->m<b.m;
}else{
return this->s<b.s;
}
/*if(this->s==b.n&&this.n==b.n){
return this->m<b.m;
}else if(this->s==b.s&&this->n!=b.n){
return this->n<b.n;
}else*/
}
};
pair<int,int> start;
map<pair<int,int>,int> change;
int S,N,M;
bool flag;
int bfs(){
queue<pair<int,int> > que;
int i,j,k;
for(i=0;i<S;i++){
for(j=0;j<=N;j++){
change[make_pair(i,j)]=INF;
}
}
change[start]=0;
que.push(start);
while(que.size()){
pair<int,int> q=que.front();
//cout<<"S:"<<q.first<<" N:"<<q.second<<" M:"<<S-q.first-q.second<<" "<<change[q]<<endl;
que.pop();
if((q.first==S/2&&q.second==S/2)||(q.second==S/2&&q.first==0)||(q.first==S/2&&q.second==0)){
flag=true;
return change[q];
}
//int ns,nn,nm;
pair<int,int> killme;
if(q.first>0&&N-q.second>0/*&&q.first>=N-q.second*/){
if(q.first>N-q.second){
killme.first=q.first-(N-q.second);
killme.second=N;
}else{
killme.first=0;
killme.second=q.second+q.first;
}
//cout<<"s-->n "<<change[killme]<<endl;
if(change[killme]==INF){
que.push(killme);
change[killme]=change[q]+1;
}
}//s-->n
if(q.first>0&&M-(S-q.first-q.second)>0/*&&q.first>=M-(S-q.first-q.second)*/){
if(q.first>M-(S-q.first-q.second)){
killme.first=q.first-(M-(S-q.first-q.second));
killme.second=q.second;
}else{
killme.first=0;
killme.second=q.second;
}
//cout<<"s-->m "<<change[killme]<<endl;
if(change[killme]==INF){
que.push(killme);
change[killme]=change[q]+1;
}
}//s-->m
if(q.second>0&&S-q.first>0/*&&q.second>=S-q.first*/){
if(q.second>S-q.first){
killme.second=q.second-(S-q.first);
killme.first=S;
}else{
killme.first=q.first+q.second;
killme.second=0;
}
//cout<<"wtf?? "<<killme.first<<" "<<killme.second<<endl;
if(change[killme]==INF){
que.push(killme);
change[killme]=change[q]+1;
}
}//n-->s
if(q.second>0&&M-(S-q.first-q.second)>0/*&&q.second>=M-(S-q.first-q.second)*/){
if(q.second>M-(S-q.first-q.second)){
killme.second=q.second-(M-(S-q.first-q.second));
killme.first=q.first;
}else{
killme.second=0;
killme.first=q.first;
}
//cout<<"n-->m "<<change[killme]<<endl;
if(change[killme]==INF){
que.push(killme);
change[killme]=change[q]+1;
}
}//n-->m
if(S-q.first-q.second>0&&S-q.first>0){
if(S-q.first-q.second>S-q.first){
killme.first=S;
killme.second=q.second;
}else{
killme.second=q.second;
killme.first=S-q.second;
}
//cout<<"m-->s "<<change[killme]<<endl;
if(change[killme]==INF){
que.push(killme);
change[killme]=change[q]+1;
}
}//m-->s
if(S-q.first-q.second>0&&N-q.second>0/*&&S-q.first-q.second>=N-q.second*/){
if(S-q.first-q.second>N-q.second){
killme.second=N;
killme.first=q.first;
}else{
killme.first=q.first;
killme.second=S-q.first;
}
//cout<<"m-->n "<<change[killme]<<endl;
if(change[killme]==INF){
que.push(killme);
change[killme]=change[q]+1;
}
}//m-->n
}
}
int main(){
while(scanf("%d%d%d",&S,&N,&M)&&S){
start.first=S;
start.second=0;
if(S%2){
printf("NO\n");
continue;
}
flag=false;
int result=bfs();
if(flag){
printf("%d\n",result);
}else{
printf("NO\n");
}
}
return 0;
}