13 倒酒 求核心代码

常规
1 
#include<bits/stdc++.h>
using namespace std;
struct node{
	int a[3];
};
int a,b,c;
int s[6]={0,0,1,1,2,2};
int e[6]={1,2,2,0,0,1};

int bfs(){
	queue<node> q;
	node first;
	first.a[0]=a,first.a[1]=b,first.a[2]=c;
	q.push(first);
	while(!q.empty()){
		node f=q.front();
		q.pop();
		for(int i=0;i<6;i++){
			if(f.a[s[i]]==0) continue;
			int aa,bb,cc;
			aa=
		}
	}
}
int main(){
	cin>>a>>b>>c;
	if(a%2==1){
		cout<<"NO";
		return 0;
	}
	cout<<bfs();
	return 0;
}

求后面广搜的代码