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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
// 2021-5-but-butelki.cpp : This file contains the 'main' function. Program execution begins and ends there.
//

#include <iostream>
#include <set>
#include <utility>
#include <queue>

constexpr int MAXN = 1e5 + 7;

typedef std::pair<std::pair<int, int>, int> abc;

inline abc make_abc(int a, int b, int c)
{
    return std::make_pair(std::make_pair(a, b), c);
}



std::set<abc> visited;
std::queue < std::pair<int, abc> > bfsq;

int answ[MAXN];

int main()
{
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);
    int A, B, C;
    std::cin >> A >> B >> C;
    for (size_t i = 0; i < MAXN; i++)
    {
        answ[i] = -1;
    }
    int a, b, c, d;
    std::cin >> a >> b >> c;
    bfsq.push(std::make_pair(0, make_abc(a, b, c)));
    while (!bfsq.empty())
    {
        auto vf = bfsq.front();
        bfsq.pop();
        if (visited.find(vf.second)!=visited.end())
        {
            continue;
        }
        visited.insert(vf.second);
        a = vf.second.first.first;
        b = vf.second.first.second;
        c = vf.second.second;
        d = vf.first;
        if (answ[a] == -1 || answ[a] > d)
        {
            answ[a] = d;
        }
        if (answ[b] == -1 || answ[b] > d)
        {
            answ[b] = d;
        }
        if (answ[c] == -1 || answ[c] > d)
        {
            answ[c] = d;
        }

        d++;
        if (a + b > A)
        {
            bfsq.push(std::make_pair(d, make_abc(A, a + b - A, c)));
        }
        else
        {
            bfsq.push(std::make_pair(d, make_abc(a + b, 0, c)));
        }
        if (a + c > A)
        {
            bfsq.push(std::make_pair(d, make_abc(A, b, a + c - A)));
        }
        else
        {
            bfsq.push(std::make_pair(d, make_abc(a + c, b, 0)));
        }
        
        if (a+b>B)
        {
            bfsq.push(std::make_pair(d, make_abc(a + b - B, B, c)));
        }
        else
        {
            bfsq.push(std::make_pair(d, make_abc(0, a + b, c)));
        }
        if (b+c > B)
        {
            bfsq.push(std::make_pair(d, make_abc(a, B, b + c - B)));
        }
        else
        {
            bfsq.push(std::make_pair(d, make_abc(a, b + c, 0)));
        }

        if (a+c > C)
        {
            bfsq.push(std::make_pair(d, make_abc(a + c - C, b, C)));
        }
        else
        {
            bfsq.push(std::make_pair(d, make_abc(0, b, a + c)));
        }
        if (b+c>C)
        {
            bfsq.push(std::make_pair(d, make_abc(a, b + c - C, C)));
        }
        else
        {
            bfsq.push(std::make_pair(d, make_abc(a, 0, b + c)));
        }
    }
    for (size_t i = 0; i <= C; i++)
    {
        std::cout << answ[i] << ' ';
    }
    std::cout << '\n';
}

// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu

// Tips for Getting Started: 
//   1. Use the Solution Explorer window to add/manage files
//   2. Use the Team Explorer window to connect to source control
//   3. Use the Output window to see build output and other messages
//   4. Use the Error List window to view errors
//   5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project
//   6. In the future, to open this project again, go to File > Open > Project and select the .sln file