Hugging Face's logo

JustinTX
/
shinka-backup

Model card Files
xet
 Community
shinka-backup
File size: 3,201 Bytes
1fd0050
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

ll query(int u, int v) {
    cout << "? " << u << " " << v << endl;
    ll d;
    cin >> d;
    return d;
}

void solve() {
    int n;
    cin >> n;
    if (n == 1) {
        cout << "!" << endl;
        return;
    }
    if (n == 2) {
        ll d = query(1, 2);
        cout << "! 1 2 " << d << endl;
        return;
    }

    vector<ll> dist1(n+1), distA(n+1), distB(n+1);
    for (int i = 2; i <= n; ++i) {
        dist1[i] = query(1, i);
    }
    dist1[1] = 0;
    int A = 2;
    for (int i = 3; i <= n; ++i) {
        if (dist1[i] > dist1[A]) A = i;
    }
    for (int i = 1; i <= n; ++i) {
        if (i == A) continue;
        distA[i] = query(A, i);
    }
    distA[A] = 0;
    int B = 1;
    if (B == A) B = 2;
    for (int i = 1; i <= n; ++i) {
        if (i == A) continue;
        if (distA[i] > distA[B]) B = i;
    }
    for (int i = 1; i <= n; ++i) {
        if (i == B) continue;
        distB[i] = query(B, i);
    }
    distB[B] = 0;

    ll L = distA[B];
    vector<ll> x(n+1), h(n+1);
    unordered_map<ll, int> x_to_diam;
    vector<pair<ll, int>> diam;
    for (int i = 1; i <= n; ++i) {
        x[i] = (distA[i] + L - distB[i]) / 2;
        h[i] = distA[i] - x[i];
        if (h[i] == 0) {
            diam.push_back({x[i], i});
            x_to_diam[x[i]] = i;
        }
    }
    sort(diam.begin(), diam.end());

    unordered_map<int, vector<pair<ll, int>>> groups;
    for (int i = 1; i <= n; ++i) {
        if (h[i] > 0) {
            int p = x_to_diam[x[i]];
            groups[p].push_back({h[i], i});
        }
    }

    vector<tuple<int, int, ll>> edges;
    for (size_t i = 0; i + 1 < diam.size(); ++i) {
        int u = diam[i].second;
        int v = diam[i+1].second;
        ll w = diam[i+1].first - diam[i].first;
        edges.emplace_back(u, v, w);
    }

    for (auto& kv : groups) {
        int p = kv.first;
        auto& vec = kv.second;
        sort(vec.begin(), vec.end());
        vector<pair<ll, int>> nodes = {{0, p}};
        for (auto& hi : vec) {
            ll h_i = hi.first;
            int i = hi.second;
            int left = 0, right = (int)nodes.size() - 1;
            while (left < right) {
                int mid = (left + right + 1) / 2;
                int j = nodes[mid].second;
                ll h_j = nodes[mid].first;
                ll dij = query(i, j);
                ll dlca = (h_i + h_j - dij) / 2;
                if (dlca == h_j) {
                    left = mid;
                } else {
                    right = mid - 1;
                }
            }
            int parent = nodes[left].second;
            ll w = h_i - nodes[left].first;
            edges.emplace_back(i, parent, w);
            auto it = lower_bound(nodes.begin(), nodes.end(), make_pair(h_i, i));
            nodes.insert(it, {h_i, i});
        }
    }

    cout << "!";
    for (auto& e : edges) {
        int u, v; ll w;
        tie(u, v, w) = e;
        cout << " " << u << " " << v << " " << w;
    }
    cout << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}