https://www.luogu.org/problemnew/show/P1215

題解：模擬+BFS

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int using namespace std; typedef long long ll; //typedef __int128 lll; const int N=20+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,q; int ans,cnt,flag,sum; bool vis[N][N][N]; char str; int cup[3]; struct node{int water[3]; }x,temp,f; void pour(int a,int b){//倒水函數，把a杯子中的可樂倒到b杯子中int sum=temp.water[a]+temp.water[b];if(sum>=cup[b])temp.water[b]=cup[b];elsetemp.water[b]=sum;temp.water[a]=sum-temp.water[b]; }void bfs(){queue<node>q;x.water[0]=0;x.water[1]=0;x.water[2]=cup[2];q.push(x);vis[0][0][cup[2]]=1;while(!q.empty()){f=q.front();q.pop();//cout<<f.water[0]<<" "<<f.water[1]<<" "<<f.water[2]<<endl;for(int i=0;i<=2;i++){for(int j=0;j<=2;j++){if(i==j)continue;temp=f;pour(i,j);//cout<<temp.water[0]<<" "<<temp.water[1]<<" "<<temp.water[2]<<endl;if(vis[temp.water[0]][temp.water[1]][temp.water[2]]==0){q.push(temp);vis[temp.water[0]][temp.water[1]][temp.water[2]]=1;}}}} } int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d%d%d",&cup[0],&cup[1],&cup[2]);bfs();set<int>st;for(int i=0;i<=cup[1];i++){for(int j=0;j<=cup[2];j++){if(vis[0][i][j]){st.insert(j);}}}for(set<int>::iterator it=st.begin();it!=st.end();it++){printf("%d ",*it);}//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

?

總結

以上是生活随笔為你收集整理的[USACO1.4]母亲的牛奶 Mother's Milk的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。