File size: 6,248 Bytes
14c9c2b | 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 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
using namespace std;
int N, perm[1001], unk[1001], us, kc;
// Use a large output buffer
static char obuf[1 << 22];
static int opos;
inline void oflush() {
fwrite_unlocked(obuf, 1, opos, stdout);
opos = 0;
fflush(stdout);
}
inline void ochar(char c) {
obuf[opos++] = c;
}
inline void oint(int x) {
if (x >= 1000) { ochar('0'+x/1000); ochar('0'+(x/100)%10); ochar('0'+(x/10)%10); ochar('0'+x%10); }
else if (x >= 100) { ochar('0'+x/100); ochar('0'+(x/10)%10); ochar('0'+x%10); }
else if (x >= 10) { ochar('0'+x/10); ochar('0'+x%10); }
else ochar('0'+x);
}
// Pre-built query line. q[i] is the value for position i.
int q[1001];
// Output query and read result
inline int ask() {
ochar('0');
for (int i = 0; i < N; i++) { ochar(' '); oint(q[i]); }
ochar('\n');
oflush();
int x;
scanf("%d", &x);
return x;
}
inline void submit() {
ochar('1');
for (int i = 0; i < N; i++) { ochar(' '); oint(perm[i]); }
ochar('\n');
oflush();
exit(0);
}
int bsearch_range(int v, int lo, int hi) {
while (lo < hi) {
int mid = (lo + hi) / 2;
for (int i = lo; i <= mid; i++) q[unk[i]] = v;
int r = ask();
for (int i = lo; i <= mid; i++) q[unk[i]] = 1;
if (r == kc + 1) hi = mid; else lo = mid + 1;
}
return lo;
}
int main() {
scanf("%d", &N);
memset(perm, 0, sizeof(perm));
if (N == 1) { perm[0] = 1; submit(); }
if (N == 2) {
q[0] = 1; q[1] = 2;
if (ask() == 2) { perm[0] = 1; perm[1] = 2; }
else { perm[0] = 2; perm[1] = 1; }
submit();
}
// Phase 1: Find pos1 and pos3 using bit queries
int B = 0;
{ int tmp = N - 1; while (tmp > 0) { B++; tmp >>= 1; } }
int rb[12];
for (int b = 0; b < B; b++) {
for (int i = 0; i < N; i++) q[i] = (i & (1 << b)) ? 1 : 3;
rb[b] = ask();
}
int kb1 = 0, kb3 = 0, kmask = 0;
for (int b = 0; b < B; b++) {
if (rb[b] == 0) { kmask |= (1 << b); kb3 |= (1 << b); }
else if (rb[b] == 2) { kmask |= (1 << b); kb1 |= (1 << b); }
}
int amask = ((1 << B) - 1) & ~kmask, P = 0;
for (int b = 0; b < B; b++) {
if (!(amask & (1 << b))) continue;
for (int i = 0; i < N; i++) {
q[i] = ((i & (1 << b)) && (i & kmask) == kb1) ? 1 : 3;
}
int r = ask();
if (r == 2) P |= (1 << b);
}
int p1 = kb1 | (P & amask);
int p3 = kb3 | (P & amask);
if (p1 < 0 || p1 >= N || p3 < 0 || p3 >= N || p1 == p3) {
p1 = -1; p3 = -1;
for (int i = 0; i < N; i++) {
if (p1 >= 0 && p3 >= 0) break;
for (int j = 0; j < N; j++) q[j] = 3;
q[i] = 1;
int r = ask();
if (r == 2) p1 = i;
else if (r == 0) p3 = i;
}
}
perm[p1] = 1; perm[p3] = 3;
kc = 2;
us = 0;
for (int i = 0; i < N; i++) if (i != p1 && i != p3) unk[us++] = i;
for (int i = 0; i < N; i++) q[i] = 1;
q[p1] = 1; q[p3] = 3;
// Phase 2: Paired binary search
vector<int> vals;
vals.push_back(2);
for (int v = 4; v <= N; v++) vals.push_back(v);
int vi = 0;
while (vi < (int)vals.size()) {
if (us == 0) break;
if (us == 1) {
perm[unk[0]] = vals[vi]; q[unk[0]] = vals[vi];
us = 0; kc++; vi++;
continue;
}
int v = vals[vi];
bool paired = (vi + 1 < (int)vals.size() && us >= 2);
int w = paired ? vals[vi + 1] : -1;
if (!paired) {
int idx = bsearch_range(v, 0, us - 1);
perm[unk[idx]] = v; q[unk[idx]] = v;
for (int i = idx; i < us - 1; i++) unk[i] = unk[i + 1];
us--; kc++; vi++;
continue;
}
// Paired binary search
int lo = 0, hi = us - 1;
int idx_v = -1, idx_w = -1;
while (idx_v < 0 || idx_w < 0) {
if (hi == lo) break; // shouldn't happen with 2 values
if (hi - lo == 1) {
q[unk[lo]] = v;
int r = ask();
q[unk[lo]] = 1;
if (r == kc + 1) { idx_v = lo; idx_w = hi; }
else { idx_v = hi; idx_w = lo; }
break;
}
int mid = (lo + hi) / 2;
// Paired query: left=v, right=w
for (int i = lo; i <= mid; i++) q[unk[i]] = v;
for (int i = mid + 1; i <= hi; i++) q[unk[i]] = w;
int r = ask();
for (int i = lo; i <= mid; i++) q[unk[i]] = 1;
for (int i = mid + 1; i <= hi; i++) q[unk[i]] = 1;
if (r == kc + 2) {
// v left, w right
idx_v = bsearch_range(v, lo, mid);
idx_w = bsearch_range(w, mid + 1, hi);
} else if (r == kc) {
// v right, w left
idx_v = bsearch_range(v, mid + 1, hi);
idx_w = bsearch_range(w, lo, mid);
} else {
// Same half - disambiguate
for (int i = lo; i <= mid; i++) q[unk[i]] = v;
int r2 = ask();
for (int i = lo; i <= mid; i++) q[unk[i]] = 1;
if (r2 == kc + 1) hi = mid; else lo = mid + 1;
}
}
if (idx_v >= 0 && idx_w >= 0) {
perm[unk[idx_v]] = v; q[unk[idx_v]] = v;
perm[unk[idx_w]] = w; q[unk[idx_w]] = w;
int r1 = idx_v, r2 = idx_w;
if (r1 > r2) { int t = r1; r1 = r2; r2 = t; }
for (int i = r2; i < us - 1; i++) unk[i] = unk[i + 1]; us--;
for (int i = r1; i < us - 1; i++) unk[i] = unk[i + 1]; us--;
kc += 2; vi += 2;
} else {
int idx = bsearch_range(v, 0, us - 1);
perm[unk[idx]] = v; q[unk[idx]] = v;
for (int i = idx; i < us - 1; i++) unk[i] = unk[i + 1];
us--; kc++; vi++;
}
}
if (us > 0) {
for (int v = 1; v <= N; v++) {
bool f = false;
for (int i = 0; i < N; i++) if (perm[i] == v) { f = true; break; }
if (!f) { perm[unk[--us]] = v; if (!us) break; }
}
}
submit();
}
|