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
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;

#define M 1000000007
#define INF 1000000007LL

using namespace std;

int v[3];
int res[100007];

struct butelki
{
    int a[3];
    int ile;
};
list <butelki> l;
butelki b;
set <pair<pair<int, int>, int>> byl;

butelki przelej(butelki b, int skad, int dokad)
{
    butelki c;
    int x = min(v[dokad]-b.a[dokad], b.a[skad]);
    c.a[dokad] = b.a[dokad] + x;
    c.a[skad] = b.a[skad] - x;
    c.a[3-skad-dokad] = b.a[3-skad-dokad];
    c.ile = b.ile+1;
    return c;
}

int solve()
{
    scanf("%d %d %d %d %d %d", &v[0], &v[1], &v[2], &b.a[0], &b.a[1], &b.a[2]);
    FOR(i, 0, v[2])
        res[i] = -1;

    l.PB(b);
    while(!l.empty())
    {
        b = l.front();
        l.pop_front();
        if(byl.find(MP(MP(b.a[0], b.a[1]), b.a[2])) != byl.end())
            continue;
//        cout << "mamy " << b.a[0] << " " << b.a[1] << " " << b.a[2] << " na " << b.ile << endl;
        byl.insert(MP(MP(b.a[0], b.a[1]), b.a[2]));
        forr(i, 3)
            if(res[b.a[i]] == -1)
                res[b.a[i]] = b.ile;
        l.PB(przelej(b, 0, 1));
        l.PB(przelej(b, 0, 2));
        l.PB(przelej(b, 1, 0));
        l.PB(przelej(b, 1, 2));
        l.PB(przelej(b, 2, 0));
        l.PB(przelej(b, 2, 1));
    }
    FOR(i, 0, v[2])
        printf("%d ", res[i]);


    return 0;
}

int main()
{
    solve();

    return 0;
}