File size: 13,371 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 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 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 | // Debug version: same algorithm but prints diagnostics to stderr
#include <bits/stdc++.h>
using namespace std;
static int N;
static inline int readInt() {
int c = getchar_unlocked();
while (c != '-' && (c < '0' || c > '9')) {
c = getchar_unlocked();
if (c == EOF) return 0;
}
int sgn = 1;
if (c == '-') { sgn = -1; c = getchar_unlocked(); }
int x = 0;
while (c >= '0' && c <= '9') { x = x*10+(c-'0'); c = getchar_unlocked(); }
return x * sgn;
}
static char wbuf[1 << 23];
static int wpos = 0;
static void wflush() { if (wpos > 0) fwrite(wbuf, 1, wpos, stdout); wpos = 0; fflush(stdout); }
static void wchar(char c) { if (wpos >= (1<<23)-2) wflush(); wbuf[wpos++] = c; }
static void wint(long long x) {
if (x < 0) { wchar('-'); x = -x; }
if (x == 0) { wchar('0'); return; }
char buf[20]; int len = 0;
while (x > 0) { buf[len++] = '0'+(int)(x%10); x /= 10; }
for (int i = len-1; i >= 0; i--) wchar(buf[i]);
}
static int resBuf[10000010];
static void doRound(const vector<int>& ops, int* res) {
wint((int)ops.size());
for (int x : ops) { wchar(' '); wint(x); }
wchar('\n'); wflush();
for (int i = 0; i < (int)ops.size(); i++) res[i] = readInt();
}
static void doRoundIgnore(const vector<int>& ops) {
if (ops.empty()) return;
doRound(ops, resBuf);
}
static mt19937 rng(42);
static void solve_large() {
vector<int> allNodes(N);
iota(allNodes.begin(), allNodes.end(), 1);
shuffle(allNodes.begin(), allNodes.end(), rng);
// Phase 1: batch IS
vector<int> IS;
set<int> isSet;
vector<int> candidates = allNodes;
int total_rounds = 0;
long long total_queries = 0;
for (int iter = 0; iter < 500 && !candidates.empty(); iter++) {
shuffle(candidates.begin(), candidates.end(), rng);
doRound(candidates, resBuf);
total_rounds++;
total_queries += candidates.size();
int j = (int)candidates.size();
for (int i = 0; i < (int)candidates.size(); i++) {
if (resBuf[i] == 1) { j = i; break; }
}
for (int i = 0; i < j; i++) {
IS.push_back(candidates[i]);
isSet.insert(candidates[i]);
}
if (j < (int)candidates.size()) {
vector<int> rem;
for (int i = (int)candidates.size()-1; i >= j; i--)
rem.push_back(candidates[i]);
doRoundIgnore(rem);
total_rounds++;
total_queries += rem.size();
}
if (j == (int)candidates.size()) break;
vector<int> remaining;
for (int v : candidates) if (!isSet.count(v)) remaining.push_back(v);
if (remaining.empty()) break;
{
vector<int> ops;
ops.reserve(2*remaining.size());
for (int v : remaining) { ops.push_back(v); ops.push_back(v); }
doRound(ops, resBuf);
total_rounds++;
total_queries += ops.size();
}
candidates.clear();
for (int i = 0; i < (int)remaining.size(); i++) {
if (resBuf[2*i] == 0) candidates.push_back(remaining[i]);
}
fprintf(stderr, "Phase1 iter %d: IS=%d, candidates=%d\n", iter, (int)IS.size(), (int)candidates.size());
}
int m = (int)IS.size();
fprintf(stderr, "Phase 1 done: IS=%d, rounds=%d, queries=%lld\n", m, total_rounds, total_queries);
vector<bool> inIS(N+1, false);
for (int v : IS) inIS[v] = true;
vector<int> nonIS;
for (int v = 1; v <= N; v++) if (!inIS[v]) nonIS.push_back(v);
int nm = (int)nonIS.size();
// Phase 2: sum + sq
int bits_sum = 0;
{ int v = 2*m; while (v > 0) { bits_sum++; v >>= 1; } }
bits_sum = max(bits_sum, 1);
int bits_sq = 0;
{ long long v = 2LL*m*m; while (v > 0) { bits_sq++; v >>= 1; } }
bits_sq = max(bits_sq, 1);
fprintf(stderr, "Phase 2: bits_sum=%d, bits_sq=%d, m=%d, nm=%d\n", bits_sum, bits_sq, m, nm);
vector<long long> labsq(m);
for (int i = 0; i < m; i++) labsq[i] = (long long)(i+1)*(i+1);
vector<bool> curLit(m, true);
vector<long long> nsum(nm, 0), nsq(nm, 0);
vector<int> carry_s(nm, 0), carry_q(nm, 0);
int maxBits = max(bits_sum, bits_sq);
for (int b = 0; b < maxBits; b++) {
if (b < bits_sum) {
vector<int> ops;
ops.reserve(3*m + 4*nm);
for (int i = 0; i < m; i++) {
bool want = (((i+1)>>b)&1)==1;
if (curLit[i] != want) { ops.push_back(IS[i]); curLit[i] = want; }
}
int po1 = (int)ops.size();
for (int v : nonIS) { ops.push_back(v); ops.push_back(v); }
for (int i = 0; i < m; i++) {
bool want = (((i+1)>>b)&1)==0;
if (curLit[i] != want) { ops.push_back(IS[i]); curLit[i] = want; }
}
int po2 = (int)ops.size();
for (int v : nonIS) { ops.push_back(v); ops.push_back(v); }
doRound(ops, resBuf);
total_rounds++;
total_queries += ops.size();
for (int j = 0; j < nm; j++) {
int ho = resBuf[po1+2*j];
int hz = resBuf[po2+2*j];
int cnt = !ho ? 0 : !hz ? 2 : 1;
int total = cnt + carry_s[j];
if (total & 1) nsum[j] |= (1LL << b);
carry_s[j] = total >> 1;
}
}
if (b < bits_sq) {
vector<int> ops;
ops.reserve(3*m + 4*nm);
for (int i = 0; i < m; i++) {
bool want = ((labsq[i]>>b)&1)==1;
if (curLit[i] != want) { ops.push_back(IS[i]); curLit[i] = want; }
}
int po1 = (int)ops.size();
for (int v : nonIS) { ops.push_back(v); ops.push_back(v); }
for (int i = 0; i < m; i++) {
bool want = ((labsq[i]>>b)&1)==0;
if (curLit[i] != want) { ops.push_back(IS[i]); curLit[i] = want; }
}
int po2 = (int)ops.size();
for (int v : nonIS) { ops.push_back(v); ops.push_back(v); }
doRound(ops, resBuf);
total_rounds++;
total_queries += ops.size();
for (int j = 0; j < nm; j++) {
int ho = resBuf[po1+2*j], hz = resBuf[po2+2*j];
int cnt = !ho ? 0 : !hz ? 2 : 1;
int total = cnt + carry_q[j];
if (total & 1) nsq[j] |= (1LL << b);
carry_q[j] = total >> 1;
}
}
}
for (int j = 0; j < nm; j++) {
if (carry_s[j]) nsum[j] |= ((long long)carry_s[j] << bits_sum);
if (carry_q[j]) nsq[j] |= ((long long)carry_q[j] << bits_sq);
}
fprintf(stderr, "Phase 2 done: rounds=%d, queries=%lld\n", total_rounds, total_queries);
// Phase 3: Reconstruct edges
vector<array<int,2>> adj(N+1, {0,0});
vector<int> deg(N+1, 0);
auto addEdge = [&](int u, int v) {
if (u == v || u < 1 || u > N || v < 1 || v > N) return;
if (deg[u] >= 2 || deg[v] >= 2) return;
for (int k = 0; k < deg[u]; k++) if (adj[u][k] == v) return;
adj[u][deg[u]++] = v;
adj[v][deg[v]++] = u;
};
int edges_found = 0;
int edges_failed = 0;
for (int j = 0; j < nm; j++) {
long long S1 = nsum[j], S2 = nsq[j];
if (S1 == 0 && S2 == 0) { edges_failed++; continue; }
long long disc = 2*S2 - S1*S1;
if (disc < 0) { edges_failed++; continue; }
long long d = (long long)round(sqrt((double)disc));
while (d > 0 && d*d > disc) d--;
while ((d+1)*(d+1) <= disc) d++;
if (d*d != disc) { edges_failed++; continue; }
if ((S1+d)%2 != 0) { edges_failed++; continue; }
long long la = (S1+d)/2, lb = (S1-d)/2;
int added = 0;
if (la >= 1 && la <= m) { addEdge(nonIS[j], IS[la-1]); added++; }
if (lb >= 1 && lb <= m && lb != la) { addEdge(nonIS[j], IS[lb-1]); added++; }
edges_found += added;
}
fprintf(stderr, "Phase 3: edges_found=%d, edges_failed=%d\n", edges_found, edges_failed);
// Count deg distribution
int d0=0, d1=0, d2=0;
for (int v = 1; v <= N; v++) {
if (deg[v] == 0) d0++;
else if (deg[v] == 1) d1++;
else d2++;
}
fprintf(stderr, "Deg distribution: d0=%d, d1=%d, d2=%d\n", d0, d1, d2);
// Phase 4
{
vector<int> clearOps;
for (int i = 0; i < m; i++)
if (curLit[i]) { clearOps.push_back(IS[i]); curLit[i] = false; }
if (!clearOps.empty()) doRoundIgnore(clearOps);
total_rounds++;
total_queries += clearOps.size();
}
vector<int> deg1;
for (int v : nonIS) if (deg[v] < 2) deg1.push_back(v);
fprintf(stderr, "Phase 4: deg1 nodes=%d\n", (int)deg1.size());
if (!deg1.empty()) {
shuffle(deg1.begin(), deg1.end(), rng);
vector<int> IS2;
set<int> is2Set;
vector<int> candidates = deg1;
for (int iter = 0; iter < 300 && !candidates.empty(); iter++) {
shuffle(candidates.begin(), candidates.end(), rng);
doRound(candidates, resBuf);
total_rounds++;
total_queries += candidates.size();
int j2 = (int)candidates.size();
for (int i = 0; i < (int)candidates.size(); i++) {
if (resBuf[i] == 1) { j2 = i; break; }
}
for (int i = 0; i < j2; i++) {
IS2.push_back(candidates[i]);
is2Set.insert(candidates[i]);
}
if (j2 < (int)candidates.size()) {
vector<int> rem;
for (int i = (int)candidates.size()-1; i >= j2; i--)
rem.push_back(candidates[i]);
doRoundIgnore(rem);
total_rounds++;
total_queries += rem.size();
}
if (j2 == (int)candidates.size()) break;
vector<int> remaining;
for (int v : candidates) if (!is2Set.count(v)) remaining.push_back(v);
if (remaining.empty()) break;
{
vector<int> ops;
ops.reserve(2*remaining.size());
for (int v : remaining) { ops.push_back(v); ops.push_back(v); }
doRound(ops, resBuf);
total_rounds++;
total_queries += ops.size();
}
candidates.clear();
for (int i = 0; i < (int)remaining.size(); i++) {
if (resBuf[2*i] == 0) candidates.push_back(remaining[i]);
}
}
int m2 = (int)IS2.size();
vector<int> nonIS2;
for (int v : deg1) if (!is2Set.count(v)) nonIS2.push_back(v);
int nm2 = (int)nonIS2.size();
fprintf(stderr, "Phase 4: IS2=%d, nonIS2=%d\n", m2, nm2);
if (m2 > 0 && nm2 > 0) {
vector<bool> curLit2(m2, true);
int bits2 = 0;
{ int v = m2; while (v > 0) { bits2++; v >>= 1; } }
bits2 = max(bits2, 1);
vector<int> nsum2(nm2, 0);
for (int b = 0; b < bits2; b++) {
vector<int> ops;
ops.reserve(m2 + 2*nm2);
for (int i = 0; i < m2; i++) {
bool want = (((i+1)>>b)&1)==1;
if (curLit2[i] != want) { ops.push_back(IS2[i]); curLit2[i] = want; }
}
int po = (int)ops.size();
for (int v : nonIS2) { ops.push_back(v); ops.push_back(v); }
doRound(ops, resBuf);
total_rounds++;
total_queries += ops.size();
for (int j = 0; j < nm2; j++)
if (resBuf[po+2*j]==1) nsum2[j] |= (1<<b);
}
int ph4_found = 0;
for (int j = 0; j < nm2; j++) {
int label = nsum2[j];
if (label >= 1 && label <= m2) { addEdge(nonIS2[j], IS2[label-1]); ph4_found++; }
}
fprintf(stderr, "Phase 4 binary search: found=%d\n", ph4_found);
}
}
// Final deg distribution
d0=0; d1=0; d2=0;
for (int v = 1; v <= N; v++) {
if (deg[v] == 0) d0++;
else if (deg[v] == 1) d1++;
else d2++;
}
fprintf(stderr, "Final deg: d0=%d, d1=%d, d2=%d\n", d0, d1, d2);
fprintf(stderr, "Total rounds=%d, queries=%lld\n", total_rounds, total_queries);
// Traverse ring
vector<int> order;
order.reserve(N);
int start = 1;
for (int v = 1; v <= N; v++) if (deg[v] == 2) { start = v; break; }
int prev = 0, cur = start;
for (int i = 0; i < N; i++) {
order.push_back(cur);
int nxt = (adj[cur][0] != prev) ? adj[cur][0] : adj[cur][1];
prev = cur; cur = nxt;
if (cur == 0 || cur == start) break;
}
fprintf(stderr, "Traversal length: %d / %d\n", (int)order.size(), N);
if ((int)order.size() != N) {
order.clear();
for (int v = 1; v <= N; v++) order.push_back(v);
}
wint(-1);
for (int v : order) { wchar(' '); wint(v); }
wchar('\n'); wflush();
}
int main() {
int subtask = readInt();
N = readInt();
if (N <= 1) { wint(-1); wchar(' '); wint(1); wchar('\n'); wflush(); return 0; }
if (N <= 1500) {
// Just use solve_large for debugging
solve_large();
}
else solve_large();
return 0;
}
|