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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
#include<bits/stdc++.h>

using namespace std;

set < pair<int, int> > seen;

int wynik[150100];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    int A,B,C;
    int a,b,c;
    int suma;

    cin>>A>>B>>C;
    cin>>a>>b>>c;
    suma = a+b+c;
    
    for(int i=0;i<=C;i++)
    {
        wynik[i] = -1;
    }
    
    queue <pair<pair<int, int>, int> > kolejka;

    kolejka.push(make_pair(make_pair(a,b), 0));
    
    int runda;
    
    int x,y,z;
    
    while(!kolejka.empty())
    {
        runda = kolejka.front().second;
        a = kolejka.front().first.first;
        b = kolejka.front().first.second;
        c = suma-a-b;
        seen.insert(make_pair(a,b));
        kolejka.pop();
        
        if(wynik[a]==-1)
        {
            wynik[a] = runda;
        }
        if(wynik[b]==-1)
        {
            wynik[b] = runda;
        }
        if(wynik[c]==-1)
        {
            wynik[c] = runda;
        }
        
        if(a!=A)
        {
            if(b!=0)
            {
                x = min(A,a+b);
                y = max(0,a+b-A);
                z = suma-x-y;
                if(seen.count(make_pair(x,y))==0)
                {
                    kolejka.push(make_pair(make_pair(x,y),runda+1));
                    seen.insert(make_pair(x,y));
                }
            }
            if(c!=0)
            {
                x = min(A,a+c);
                y = b;
                z = suma-x-y;
                if(seen.count(make_pair(x,y))==0)
                {
                    kolejka.push(make_pair(make_pair(x,y),runda+1));
                    seen.insert(make_pair(x,y));
                }
            }
        }
        if(b!=B)
        {
            if(a!=0)
            {
                x = max(0,a+b-B);
                y = min(B,a+b);
                z = suma-x-y;
                if(seen.count(make_pair(x,y))==0)
                {
                    kolejka.push(make_pair(make_pair(x,y),runda+1));
                    seen.insert(make_pair(x,y));
                }
            }
            if(c!=0)
            {
                x = a;
                y = min(B,c+b);
                z =  suma-x-y;
                if(seen.count(make_pair(x,y))==0)
                {
                    kolejka.push(make_pair(make_pair(x,y),runda+1));
                    seen.insert(make_pair(x,y));
                }
            }
        }
        if(c!=C)
        {
            if(a!=0)
            {
                x = max(0,a+c-C);
                y = b;
                z = suma-x-y;
                if(seen.count(make_pair(x,y))==0)
                {
                    kolejka.push(make_pair(make_pair(x,y),runda+1));
                    seen.insert(make_pair(x,y));
                }
            }
            if(b!=0)
            {
                x = a;
                y = max(0,c+b-C);
                z = suma-x-y;
                if(seen.count(make_pair(x,y))==0)
                {
                    kolejka.push(make_pair(make_pair(x,y),runda+1));
                    seen.insert(make_pair(x,y));
                }
            }
        }
    }
    
    for(int i=0;i<=C;i++)
    {
        cout<<wynik[i];
        
        if(i<C)
        {
            cout<<" ";
        }
        else
        {
            cout<<endl;
        }
    }
    
    
    return 0;
}