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
#include "bits/stdc++.h" // Tomasz Nowak
using namespace std;     // University of Warsaw
using LL = long long;
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define ssize(x) int(x.size())
template<class A, class B> auto& operator<<(ostream &o, pair<A, B> p) {
	return o << '(' << p.first << ", " << p.second << ')';
}
template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) {
	o << '{'; int i = 0; for(auto e : x) o << (", ")+2*!i++ << e; return o << '}';
}
#ifdef DEBUG
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
#else
#define debug(...) {}
#endif

int main() {
	cin.tie(0)->sync_with_stdio(0);

	array<int, 3> mx;
	int a, b, c;
	cin >> mx[0] >> mx[1] >> mx[2] >> a >> b >> c;
	map<pair<int, int>, int> dist = {{{a, b}, 0}};
	deque<pair<int, int>> sztos = {{a, b}};

	while(not sztos.empty()) {
		array<int, 3> curr;
		tie(curr[0], curr[1]) = sztos.front();
		sztos.pop_front();
		curr[2] = a + b + c - curr[0] - curr[1];
		REP(i, 3)
			assert(0 <= curr[i] and curr[i] <= mx[i]);
		debug(curr, dist[pair(curr[0], curr[1])]);

		REP(from, 3)
			REP(to, 3)
				if(from != to) {
					auto cp = curr;
					int can_from = curr[from];
					int can_to = mx[to] - curr[to];
					int flow = min(can_from, can_to);
					cp[from] -= flow;
					cp[to] += flow;
					pair state = {cp[0], cp[1]};
					if(dist.find(state) == dist.end()) {
						dist[state] = dist[pair(curr[0], curr[1])] + 1;
						sztos.emplace_back(state);
					}
				}
	}

	vector<int> ans(mx[2] + 1, -1);
	for(auto [p, moves] : dist) {
		auto [x, y] = p;
		int z = a + b + c - x - y;
		for(int i : {x, y, z})
			if(i <= mx[2])
				if(ans[i] == -1 or moves < ans[i])
					ans[i] = moves;
	}
	for(int moves : ans)
		cout << moves << ' ';
	cout << '\n';
}