Hugging Face's logo

JustinTX
/
shinka-backup

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

static inline long long ask(int u, int v) {
    printf("? %d %d\n", u, v);
    fflush(stdout);
    long long d;
    if (scanf("%lld", &d) != 1) exit(0);
    if (d < 0) exit(0);
    return d;
}

struct Edge {
    int u, v;
    long long w;
};

struct Task {
    vector<int> nodes;        // nodes[0] is the task root (distance base), but not required for correctness
    vector<long long> dist0;  // dist0[i] = dist(nodes[0], nodes[i])
};

static inline void add_edge(vector<Edge>& edges, int u, int v, long long w) {
    edges.push_back({u, v, w});
}

static inline void process_task(Task&& t, vector<Task>& st, vector<Edge>& edges) {
    int m = (int)t.nodes.size();
    if (m <= 1) return;

    if (m == 2) {
        add_edge(edges, t.nodes[0], t.nodes[1], t.dist0[1]);
        return;
    }

    int root = t.nodes[0];

    // Choose a = farthest from root using known distances dist0
    int idxA = 0;
    for (int i = 1; i < m; i++) {
        if (t.dist0[i] > t.dist0[idxA]) idxA = i;
    }
    int a = t.nodes[idxA];

    // Query distances from a
    vector<long long> dA(m);
    for (int i = 0; i < m; i++) {
        int x = t.nodes[i];
        if (x == a) dA[i] = 0;
        else dA[i] = ask(a, x);
    }

    // b = farthest from a
    int idxB = 0;
    for (int i = 1; i < m; i++) {
        if (dA[i] > dA[idxB]) idxB = i;
    }
    int b = t.nodes[idxB];
    long long D = dA[idxB];

    // Query distances from b (reuse dist0 if b == root)
    vector<long long> dB(m);
    if (b == root) {
        dB = t.dist0;
    } else {
        for (int i = 0; i < m; i++) {
            int x = t.nodes[i];
            if (x == b) dB[i] = 0;
            else dB[i] = ask(b, x);
        }
    }

    // Collect diameter vertices: on path a-b iff dA + dB == D
    vector<pair<long long, int>> diam; // (position from a, vertex)
    diam.reserve(m);
    for (int i = 0; i < m; i++) {
        if (dA[i] + dB[i] == D) {
            diam.push_back({dA[i], t.nodes[i]});
        }
    }
    sort(diam.begin(), diam.end());

    // Connect diameter path
    for (int i = 1; i < (int)diam.size(); i++) {
        add_edge(edges, diam[i - 1].second, diam[i].second, diam[i].first - diam[i - 1].first);
    }

    // Prepare for grouping by projection onto diameter
    int ds = (int)diam.size();
    vector<long long> pos(ds);
    vector<int> dv(ds);
    for (int i = 0; i < ds; i++) {
        pos[i] = diam[i].first;
        dv[i] = diam[i].second;
    }

    vector<vector<int>> groups(ds);
    vector<vector<long long>> groupsDist(ds);

    for (int i = 0; i < m; i++) {
        long long numerator = dA[i] + D - dB[i];
        long long tpos = numerator / 2;
        long long h = dA[i] - tpos;
        if (h == 0) continue; // on diameter

        int idx = (int)(lower_bound(pos.begin(), pos.end(), tpos) - pos.begin());
        // Projection should always be a diameter vertex
        if (idx < 0 || idx >= ds || pos[idx] != tpos) {
            // Fallback: shouldn't happen in a valid tree metric; avoid UB.
            // Put it to the nearest position.
            if (idx == ds) idx = ds - 1;
            else if (idx > 0 && (idx == ds || llabs(pos[idx] - tpos) > llabs(pos[idx - 1] - tpos))) idx--;
        }
        groups[idx].push_back(t.nodes[i]);
        groupsDist[idx].push_back(h);
    }

    // Create child tasks
    for (int i = 0; i < ds; i++) {
        if (groups[i].empty()) continue;
        Task child;
        child.nodes.reserve(1 + groups[i].size());
        child.dist0.reserve(1 + groups[i].size());
        child.nodes.push_back(dv[i]);
        child.dist0.push_back(0);
        for (size_t j = 0; j < groups[i].size(); j++) {
            child.nodes.push_back(groups[i][j]);
            child.dist0.push_back(groupsDist[i][j]); // dist(dv[i], node)
        }
        st.push_back(std::move(child));
    }
}

int main() {
    int T;
    if (scanf("%d", &T) != 1) return 0;

    while (T--) {
        int n;
        if (scanf("%d", &n) != 1) return 0;

        if (n <= 1) {
            printf("!\n");
            fflush(stdout);
            continue;
        }

        vector<Edge> edges;
        edges.reserve(n - 1);

        Task initial;
        initial.nodes.resize(n);
        initial.dist0.resize(n);
        for (int i = 0; i < n; i++) initial.nodes[i] = i + 1;
        initial.dist0[0] = 0;
        for (int i = 2; i <= n; i++) {
            initial.dist0[i - 1] = ask(1, i);
        }

        vector<Task> st;
        st.reserve(n);
        st.push_back(std::move(initial));

        while (!st.empty()) {
            Task t = std::move(st.back());
            st.pop_back();
            process_task(std::move(t), st, edges);
        }

        // Output answer
        printf("!");
        for (auto &e : edges) {
            printf(" %d %d %lld", e.u, e.v, e.w);
        }
        printf("\n");
        fflush(stdout);
    }

    return 0;
}