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
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>

constexpr int INF = 1000000000;

using namespace std;
using PII = pair<int, int>;

void static send_bits(int x, int cnt)
{
    for (int i = 0; i < cnt; ++i)
    {
        int bit = x & 1;

        cout << "+ " << bit << "\n";
        cout.flush();

        x >>= 1;
    }
}

int static receive_bits(int cnt)
{
    int res = 0;

    for (int i = 0; i < cnt; ++i)
    {
        cout << "?\n";
        cout.flush();

        int b;
        cin >> b;

        if (b)
            res |= (1 << i);
    }

    return res;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    string p;
    int n, m, u, v, c;
    cin >> p >> n >> m;

    vector<vector<PII>> graph(n);

    for (int i = 0; i < m; ++i)
    {
        cin >> u >> v >> c;
        --u; --v;

        graph[u].push_back({ v, c });
        graph[v].push_back({ u, c });
    }

    vector<bool> o(n);
    vector<int> d(n, INF);
    d[0] = 0;

    priority_queue<PII, vector<PII>, greater<PII>> q;
    q.push({ 0, 0 });

    int prev = 0;

    for (int i = 0; i < n; ++i)
    {
        v = -1;
        c = prev + 511;

        while (!q.empty()) 
        {
            int qv = q.top().second;
            int qc = q.top().first;

            if (qc != d[qv] || o[qv])
            {
                q.pop();
                continue;
            }

            v = qv;
            c = qc;

            break;
        }

        send_bits(c - prev, 9);
        int oc = prev + receive_bits(9);

        if (c < oc || (c == oc && p == "Algosia"))
        {
            send_bits(v, 11);
            q.pop();
        }
        else
        {
            v = receive_bits(11);
            c = oc;

            d[v] = c;
            o[v] = true;
        }

        prev = c;

        for (auto edge : graph[v]) 
        {
            int to = edge.first;
            int cost = edge.second;

            if (d[v] + cost < d[to]) {
                d[to] = d[v] + cost;
                q.push({ d[to], to });
            }
        }
    }

    if (p == "Algosia")
    {
        cout << "!";

        for (int i = 0; i < n; ++i)
        {
            cout << " " << d[i];
        }

        cout << "\n";
    }

    return 0;
}