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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
// Karol Kosinski 2026
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b);i<_b;++i)
#define FR_(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FD_(i,b,a) for(int i=(b),_a=(a);i>=_a;--i)
#define ALL(c) (c).begin(),(c).end()
#define SIZE(c) int((c).size())
#define X first
#define Y second
#define endl '\n'
#define NAM(x) #x,'=',x
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
using TIII = tuple<int, int, int>;
template<class...T> void _cout(T...a){(cout<<...<<a);}

#ifndef ENABLE_DEBUG
#define DEB(k,p,f,x...)
#else
#define DEB(k,p,f,x...) {if(k)_cout("------",setw(4),__LINE__," : ",__FUNCTION__,endl);if(p)f(x);}
#endif
#define DEBF(f,x...)    DEB(1,1,f,x)
#define DEBL            DEBF(void,0)
#define DEBC(p,x...)    DEB(0,p,_cout,x)
#define DEBUG(x...)     DEBC(1,x)

constexpr int NX = 2'003;
constexpr int MX = 500'003;
constexpr string_view ZERO = "+ 0";
constexpr string_view ONE = "+ 1";

int U[MX], V[MX], C[MX], P[NX], W[NX];

namespace DijkstraDense
{
    static constexpr int INFTY = 1e9 + 1;

    int n, D[NX], G[NX][NX];

    void init(int n0)
    {
        n = n0;
        FOR(i,0,n) FOR(j,0,n) G[i][j] = INFTY;
    }

    void add(int u, int v, int w) { G[u][v] = min( G[u][v], w ); }

    void run(int root)
    {
        vector<int> Q(n);
        auto cmp = [](int a, int b){ return D[a] < D[b]; };
        FOR(i,0,n) Q[i] = i, D[i] = INFTY;
        D[root] = 0;
        while ( not Q.empty() )
        {
            auto u = min_element( ALL(Q), cmp );
            FOR(v,0,n) D[v] = min( D[v], D[*u] + G[*u][v] );
            swap( *u, Q.back() );
            Q.pop_back();
        }
    }
};

void read_input(int& n, int& m)
{
    cin >> n >> m;
    DijkstraDense::init(n);
    FOR(i,0,m)
    {
        int u, v, c;
        cin >> u >> v >> c;
        U[i] = u-1, V[i] = v-1, C[i] = c;
        DijkstraDense::add(u-1, v-1, c);
        DijkstraDense::add(v-1, u-1, c);
    }
}

void write_output(int n)
{
    cout << '!';
    FOR(i,0,n) cout << ' ' << DijkstraDense::D[i];
    cout << flush;
}

void ser(int k, int num)
{
    FOR(i,0,k)
    {
        cout << ( num % 2 == 0 ?  ZERO : ONE ) << flush;
        num /= 2;
    }
}

int deser(int k)
{
    int res = 0;
    FOR(i,0,k)
    {
        cout << '?' << flush;
        int a;
        cin >> a;
        res |= (a << i);
    }
    return res;
}

void send_edges(int m)
{
    FOR(i,0,m)
    {
        ser( 11, U[i] );
        ser( 11, V[i] );
        ser( 9, C[i] );
    }
}

void receive_edges(int m)
{
    // cerr << m << endl << flush;
    FOR(i,0,m)
    {
        int u = deser(11);
        int v = deser(11);
        int c = deser(9);
        // cerr << u << ' ' << v << ' ' << c << endl << flush;
        DijkstraDense::add(u, v, c);
        DijkstraDense::add(v, u, c);
    }
}

void dfs(int u)
{
    namespace dd = DijkstraDense;
    FOR(v,0,dd::n) if ( dd::G[u][v] != dd::INFTY and P[v] == -1 )
    {
        P[v] = u;
        W[v] = dd::G[u][v];
        dfs(v);
    }
}

void send_edges_reduced(int n)
{
    FOR(i,1,n)
    {
        if ( P[i] < 0 ) 
        {
            ser( 20, 0 );
        }
        else
        {
            ser( 11, P[i] );
            ser( 9, W[i] );
        }
    }
}

void receive_edges_reduced(int n)
{
    FOR(i,1,n)
    {
        int u = i;
        int v = deser(11);
        int c = deser(9);
        if ( c == 0 ) continue;
        DijkstraDense::add(u, v, c);
        DijkstraDense::add(v, u, c);
    }
}

void solveA()
{
    int n, ma;
    read_input(n, ma);
    ser(19, ma);
    if ( ma == 0 )
    {
        FOR(i,0,n) DijkstraDense::D[i] = deser(20);
        write_output(n);
        return;
    }
    int mb = deser(19);
    if ( ma + mb == n - 1 )
    {
        receive_edges_reduced(n);
        DijkstraDense::run(0);
        write_output(n);
        return;
    }
    if ( mb <= 1000 )
    {
        receive_edges(mb);
        DijkstraDense::run(0);
        write_output(n);
        return;
    }
    write_output(n);
}

void solveB()
{
    int n, mb;
    read_input(n, mb);
    int ma = deser(19);
    if ( ma == 0 )
    {
        DijkstraDense::run(0);
        FOR(i,0,n) ser( 20, DijkstraDense::D[i] );
        return;
    }
    ser(19, mb);
    if ( ma + mb == n - 1 )
    {
        FOR(i,0,n) P[i] = -1;
        FOR(i,0,n) if ( P[i] == -1 )
        {
            P[i] = -2;
            dfs(i);
        }
        send_edges_reduced(n);
        return;
    }
    if ( mb <= 1000 )
    {
        send_edges(mb);
        return;
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    string str;
    cin >> str;
    if ( str[0] == 'A' ) solveA();
    else solveB();
    return 0;
}