#include<bits/stdc++.h> using namespace std; int main(){ int a, b, c; cin >> a >> b >> c; int a1, b1, c1; cin >> a1 >> b1 >> c1; int sizee=a1+b1+c1; queue<pair<pair<int, int>, int>> q; q.push({{a1, b1}, 0}); set<pair<int, int>> mogus; int bb[c+1]; for(int i = 0 ;i < c+1; i++) bb[i]=-1; while(!q.empty()){ a1=q.front().first.first; b1=q.front().first.second; c1=sizee-a1-b1; int t=q.front().second; q.pop(); //cout << a1 <<' '<< b1 <<' '<< c1 <<'\n'; if(mogus.find({a1, b1}) != mogus.end()) continue; mogus.insert({a1,b1}); if(a1<=c&&bb[a1]==-1) bb[a1]=t; if(b1<=c&&bb[b1]==-1) bb[b1]=t; if(c1<=c&&bb[c1]==-1) bb[c1]=t; if(a1>0&&b1<b){ q.push({{a1-min(a1, b-b1), b1+min(a1, b-b1)}, t+1}); } if(a1>0&&c1<c){ q.push({{a1-min(a1, c-c1), b1}, t+1}); } if(b1>0&&a1<b){ q.push({{a1+min(b1, a-a1), b1-min(b1, a-a1)}, t+1}); } if(b1>0&&c1<c){ q.push({{a1, b1-min(b1, c-c1)}, t+1}); } if(b1<b&&c1>0){ q.push({{a1, b1+min(c1, b-b1)}, t+1}); } if(a1<a&&c1>0){ q.push({{a1+min(c1, a-a1), b1}, t+1}); } } for(int i = 0 ;i < c+1; i++) cout << bb[i]<<' '; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 | #include<bits/stdc++.h> using namespace std; int main(){ int a, b, c; cin >> a >> b >> c; int a1, b1, c1; cin >> a1 >> b1 >> c1; int sizee=a1+b1+c1; queue<pair<pair<int, int>, int>> q; q.push({{a1, b1}, 0}); set<pair<int, int>> mogus; int bb[c+1]; for(int i = 0 ;i < c+1; i++) bb[i]=-1; while(!q.empty()){ a1=q.front().first.first; b1=q.front().first.second; c1=sizee-a1-b1; int t=q.front().second; q.pop(); //cout << a1 <<' '<< b1 <<' '<< c1 <<'\n'; if(mogus.find({a1, b1}) != mogus.end()) continue; mogus.insert({a1,b1}); if(a1<=c&&bb[a1]==-1) bb[a1]=t; if(b1<=c&&bb[b1]==-1) bb[b1]=t; if(c1<=c&&bb[c1]==-1) bb[c1]=t; if(a1>0&&b1<b){ q.push({{a1-min(a1, b-b1), b1+min(a1, b-b1)}, t+1}); } if(a1>0&&c1<c){ q.push({{a1-min(a1, c-c1), b1}, t+1}); } if(b1>0&&a1<b){ q.push({{a1+min(b1, a-a1), b1-min(b1, a-a1)}, t+1}); } if(b1>0&&c1<c){ q.push({{a1, b1-min(b1, c-c1)}, t+1}); } if(b1<b&&c1>0){ q.push({{a1, b1+min(c1, b-b1)}, t+1}); } if(a1<a&&c1>0){ q.push({{a1+min(c1, a-a1), b1}, t+1}); } } for(int i = 0 ;i < c+1; i++) cout << bb[i]<<' '; } |