#include <bits/stdc++.h> using namespace std; #define PII pair<int, int> #define VI vector<int> #define VPII vector<PII> #define LL long long #define LD long double #define f first #define s second #define MP make_pair #define PB push_back #define endl '\n' #define ALL(c) (c).begin(), (c).end() #define SIZ(c) (int)(c).size() #define REP(i, n) for(int i = 0; i < (int)(n); ++i) #define FOR(i, b, e) for(int i = (b); i <= (int)(e); ++i) #define FORD(i, b, e) for(int i = (b); i >= (int)(e); --i) #define sim template<class n sim, class s> ostream & operator << (ostream &p, pair<n, s> x) {return p << "<" << x.f << ", " << x.s << ">";} sim> auto operator << (ostream &p, n y) -> typename enable_if<!is_same<n, string>::value, decltype(y.begin(), p)>::type {int o = 0; p << "{"; for(auto c: y) {if(o++) p << ", "; p << c;} return p << "}";} void dor() {cerr << endl;} sim, class...s> void dor(n p, s...y) {cerr << p << " "; dor(y...);} sim, class s> void mini(n &p, s y) {if(p>y) p = y;} sim, class s> void maxi(n &p, s y) {if(p<y) p = y;} // #ifdef DEB #define debug(...) dor(__FUNCTION__, ":", __LINE__, ": ", __VA_ARGS__) // #else // #define debug(...) // #endif #define I(x) #x " =", (x), " " #define A(a, i) #a "[" #i " =", i, "] =", a[i], " " using namespace std; const int MXN = 1e5+5; int res[MXN]; int A, B, C; int a, b, c; int mx[3]; struct state { int t[3]; // state(int *i): {t[0] = i[0]; t[1] = i[i], t[2] = i[2];} state(int a, int b, int c){t[0] = a; t[1] = b, t[2] = c;}\ state mutate(int a, int b) { int move = min(t[a], mx[b] - t[b]); state res = *this; res.t[a] -= move; res.t[b] += move; return res; } }; bool operator<(state a, state b) { REP(i, 3) { if(a.t[i] != b.t[i])return a.t[i] < b.t[i]; } return 0; } void solve() { FOR(i, 0, C)res[i] = 1e9; queue<state> q; q.push(state(a, b, c)); map<state, int> odl; odl[q.front()] = 0; while(q.size()) { auto v = q.front(); q.pop(); int od = odl[v]; REP(i, 3)mini(res[v.t[i]], od); REP(i, 3) REP(j, 3) { if(i == j)continue; auto w = v.mutate(i, j); if(!odl.count(w)) { odl[w] = od + 1; q.push(w); } } } FOR(i, 0, C) { cout << (res[i] > 1e8 ? -1 : res[i]) << " "; } cout << endl; } int32_t main() { ios_base::sync_with_stdio(0); cin >> A >> B >> C; cin >> a >> b >> c; mx[0] = A; mx[1] = B; mx[2] = C; solve(); }
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 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 | #include <bits/stdc++.h> using namespace std; #define PII pair<int, int> #define VI vector<int> #define VPII vector<PII> #define LL long long #define LD long double #define f first #define s second #define MP make_pair #define PB push_back #define endl '\n' #define ALL(c) (c).begin(), (c).end() #define SIZ(c) (int)(c).size() #define REP(i, n) for(int i = 0; i < (int)(n); ++i) #define FOR(i, b, e) for(int i = (b); i <= (int)(e); ++i) #define FORD(i, b, e) for(int i = (b); i >= (int)(e); --i) #define sim template<class n sim, class s> ostream & operator << (ostream &p, pair<n, s> x) {return p << "<" << x.f << ", " << x.s << ">";} sim> auto operator << (ostream &p, n y) -> typename enable_if<!is_same<n, string>::value, decltype(y.begin(), p)>::type {int o = 0; p << "{"; for(auto c: y) {if(o++) p << ", "; p << c;} return p << "}";} void dor() {cerr << endl;} sim, class...s> void dor(n p, s...y) {cerr << p << " "; dor(y...);} sim, class s> void mini(n &p, s y) {if(p>y) p = y;} sim, class s> void maxi(n &p, s y) {if(p<y) p = y;} // #ifdef DEB #define debug(...) dor(__FUNCTION__, ":", __LINE__, ": ", __VA_ARGS__) // #else // #define debug(...) // #endif #define I(x) #x " =", (x), " " #define A(a, i) #a "[" #i " =", i, "] =", a[i], " " using namespace std; const int MXN = 1e5+5; int res[MXN]; int A, B, C; int a, b, c; int mx[3]; struct state { int t[3]; // state(int *i): {t[0] = i[0]; t[1] = i[i], t[2] = i[2];} state(int a, int b, int c){t[0] = a; t[1] = b, t[2] = c;}\ state mutate(int a, int b) { int move = min(t[a], mx[b] - t[b]); state res = *this; res.t[a] -= move; res.t[b] += move; return res; } }; bool operator<(state a, state b) { REP(i, 3) { if(a.t[i] != b.t[i])return a.t[i] < b.t[i]; } return 0; } void solve() { FOR(i, 0, C)res[i] = 1e9; queue<state> q; q.push(state(a, b, c)); map<state, int> odl; odl[q.front()] = 0; while(q.size()) { auto v = q.front(); q.pop(); int od = odl[v]; REP(i, 3)mini(res[v.t[i]], od); REP(i, 3) REP(j, 3) { if(i == j)continue; auto w = v.mutate(i, j); if(!odl.count(w)) { odl[w] = od + 1; q.push(w); } } } FOR(i, 0, C) { cout << (res[i] > 1e8 ? -1 : res[i]) << " "; } cout << endl; } int32_t main() { ios_base::sync_with_stdio(0); cin >> A >> B >> C; cin >> a >> b >> c; mx[0] = A; mx[1] = B; mx[2] = C; solve(); } |