File size: 10,624 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 | #include <bits/stdc++.h>
using namespace std;
int main() {
int sub, n;
scanf("%d %d", &sub, &n);
int f_b = min(100, n / 10);
if (n <= 10) f_b = 1;
vector<vector<int>> adj(n + 1);
set<int> remaining_set;
for (int i = 1; i <= n; ++i) remaining_set.insert(i);
// Build independent set B
vector<int> B;
vector<int> candidates(n);
for (int i = 0; i < n; ++i) candidates[i] = i + 1;
for (int lab : candidates) {
printf("1 %d\n", lab);
fflush(stdout);
int res;
scanf("%d", &res);
if (res == 0) {
B.push_back(lab);
if ((int)B.size() == f_b) break;
} else {
printf("1 %d\n", lab);
fflush(stdout);
int res2;
scanf("%d", &res2);
}
}
// Now S = B lit
// Compute remaining
vector<bool> in_B(n + 1, false);
for (int b : B) in_B[b] = true;
vector<int> rem_vec;
for (int i = 1; i <= n; ++i) {
if (!in_B[i]) {
rem_vec.push_back(i);
remaining_set.erase(i);
}
}
// Batch to find Next
int r_size = rem_vec.size();
int Lbatch = 2 * r_size;
printf("%d", Lbatch);
for (int u : rem_vec) {
printf(" %d %d", u, u);
}
printf("\n");
fflush(stdout);
vector<int> resbatch(Lbatch);
for (int i = 0; i < Lbatch; ++i) {
scanf("%d", &resbatch[i]);
}
vector<int> Next;
for (int j = 0; j < r_size; ++j) {
int idx = 2 * j + 1;
if (resbatch[idx] == 1) {
Next.push_back(rem_vec[j]);
}
}
// Now S still B, turn off B
int Lb = B.size();
if (Lb > 0) {
printf("%d", Lb);
for (int b : B) printf(" %d", b);
printf("\n");
fflush(stdout);
for (int i = 0; i < Lb; ++i) {
int dummy;
scanf("%d", &dummy);
}
}
// S = empty
// Now for each b find neigh in Next
for (int b : B) {
// add b
printf("1 %d\n", b);
fflush(stdout);
int res0;
scanf("%d", &res0);
// batch Next
int Ln = 2 * Next.size();
printf("%d", Ln);
for (int u : Next) {
printf(" %d %d", u, u);
}
printf("\n");
fflush(stdout);
vector<int> resn(Ln);
for (int i = 0; i < Ln; ++i) {
scanf("%d", &resn[i]);
}
// find neigh
for (size_t j = 0; j < Next.size(); ++j) {
int idx = 2 * j + 1;
if (resn[idx] == 1) {
int u = Next[j];
adj[b].push_back(u);
adj[u].push_back(b);
}
}
// remove b
printf("1 %d\n", b);
fflush(stdout);
int res1;
scanf("%d", &res1);
}
// Now initial induced on potential F = vertices with deg 1
vector<int> potential_F;
for (int i = 1; i <= n; ++i) {
if ((int)adj[i].size() == 1) potential_F.push_back(i);
}
// induced on potential_F
int pf_size = potential_F.size();
for (int ee = 0; ee < pf_size; ++ee) {
int e = potential_F[ee];
// add e
printf("1 %d\n", e);
fflush(stdout);
int res0;
scanf("%d", &res0);
// others
vector<int> others;
for (int jj = 0; jj < pf_size; ++jj) {
if (jj != ee) others.push_back(potential_F[jj]);
}
int Lo = 2 * others.size();
printf("%d", Lo);
for (int o : others) {
printf(" %d %d", o, o);
}
printf("\n");
fflush(stdout);
vector<int> reso(Lo);
for (int i = 0; i < Lo; ++i) {
scanf("%d", &reso[i]);
}
// find adj
for (size_t j = 0; j < others.size(); ++j) {
int idx = 2 * j + 1;
if (reso[idx] == 1) {
int o = others[j];
bool has = false;
for (int nb : adj[e]) {
if (nb == o) has = true;
}
if (!has) {
adj[e].push_back(o);
adj[o].push_back(e);
}
}
}
// remove e
printf("1 %d\n", e);
fflush(stdout);
int resr;
scanf("%d", &resr);
}
// Now loop
while (!remaining_set.empty()) {
// compute current_F = deg 1
vector<int> current_F;
for (int i = 1; i <= n; ++i) {
if ((int)adj[i].size() == 1) current_F.push_back(i);
}
// induced on current_F
int cf_size = current_F.size();
for (int ee = 0; ee < cf_size; ++ee) {
int e = current_F[ee];
// add e
printf("1 %d\n", e);
fflush(stdout);
int res0;
scanf("%d", &res0);
// others
vector<int> others;
for (int jj = 0; jj < cf_size; ++jj) {
if (jj != ee) others.push_back(current_F[jj]);
}
int Lo = 2 * others.size();
printf("%d", Lo);
for (int o : others) {
printf(" %d %d", o, o);
}
printf("\n");
fflush(stdout);
vector<int> reso(Lo);
for (int i = 0; i < Lo; ++i) {
scanf("%d", &reso[i]);
}
// find adj
for (size_t j = 0; j < others.size(); ++j) {
int idx = 2 * j + 1;
if (reso[idx] == 1) {
int o = others[j];
bool has = false;
for (int nb : adj[e]) {
if (nb == o) has = true;
}
if (!has) {
adj[e].push_back(o);
adj[o].push_back(e);
}
}
}
// remove e
printf("1 %d\n", e);
fflush(stdout);
int resr;
scanf("%d", &resr);
}
// recompute current_F = deg 1, now G
current_F.clear();
for (int i = 1; i <= n; ++i) {
if ((int)adj[i].size() == 1) current_F.push_back(i);
}
int g_size = current_F.size();
// set S = current_F
if (g_size > 0) {
printf("%d", g_size);
for (int g : current_F) printf(" %d", g);
printf("\n");
fflush(stdout);
for (int i = 0; i < g_size; ++i) {
int dummy;
scanf("%d", &dummy);
}
}
// now S = G = current_F
// batch
rem_vec.assign(remaining_set.begin(), remaining_set.end());
r_size = rem_vec.size();
Lbatch = 2 * r_size;
if (r_size > 0) {
printf("%d", Lbatch);
for (int u : rem_vec) {
printf(" %d %d", u, u);
}
printf("\n");
fflush(stdout);
for (int i = 0; i < Lbatch; ++i) {
int rb;
scanf("%d", &rb);
resbatch[i] = rb;
}
// Next
Next.clear();
for (int j = 0; j < r_size; ++j) {
int idx = 2 * j + 1;
if (resbatch[idx] == 1) {
int u = rem_vec[j];
Next.push_back(u);
remaining_set.erase(u);
}
}
} else {
Next.clear();
}
// now S still G
// now per g matching
int n_size = Next.size();
for (int gg = 0; gg < g_size; ++gg) {
int g = current_F[gg];
// turn off others
vector<int> to_off;
for (int jj = 0; jj < g_size; ++jj) {
if (jj != gg) to_off.push_back(current_F[jj]);
}
int Loff = to_off.size();
if (Loff > 0) {
printf("%d", Loff);
for (int oo : to_off) printf(" %d", oo);
printf("\n");
fflush(stdout);
for (int i = 0; i < Loff; ++i) {
int dummy;
scanf("%d", &dummy);
}
}
// now S={g}
// batch Next
int Ln = 2 * n_size;
printf("%d", Ln);
for (int u : Next) {
printf(" %d %d", u, u);
}
printf("\n");
fflush(stdout);
vector<int> resn(Ln);
for (int i = 0; i < Ln; ++i) {
scanf("%d", &resn[i]);
}
// find neigh
for (size_t j = 0; j < Next.size(); ++j) {
int idx = 2 * j + 1;
if (resn[idx] == 1) {
int u = Next[j];
bool has = false;
for (int nb : adj[g]) {
if (nb == u) has = true;
}
if (!has) {
adj[g].push_back(u);
adj[u].push_back(g);
}
}
}
// turn back to_off
if (Loff > 0) {
printf("%d", Loff);
for (int oo : to_off) printf(" %d", oo);
printf("\n");
fflush(stdout);
for (int i = 0; i < Loff; ++i) {
int dummy;
scanf("%d", &dummy);
}
}
// now S=G again
}
// turn off G
if (g_size > 0) {
printf("%d", g_size);
for (int g : current_F) printf(" %d", g);
printf("\n");
fflush(stdout);
for (int i = 0; i < g_size; ++i) {
int dummy;
scanf("%d", &dummy);
}
}
// S=empty
}
// Now build perm from 1
vector<int> perm;
int start = 1;
int curr = start;
int prevv = 0; // invalid
set<int> visited;
do {
perm.push_back(curr);
visited.insert(curr);
int nextt = -1;
for (int nb : adj[curr]) {
if (nb != prevv) {
nextt = nb;
break;
}
}
prevv = curr;
curr = nextt;
if (curr == 0) break; // error
} while (curr != start);
// if perm.size() != n or visited.size() !=n error, but assume correct
// output
printf("-1");
for (int p : perm) {
printf(" %d", p);
}
printf("\n");
fflush(stdout);
return 0;
} |