#include <bits/stdc++.h>
#include "library.h"
using namespace std;
void Solve(int N) {
vector<int> res;
if (N == 1) {
res = {1};
Answer(res);
}
else if (N == 2){
res = {1, 2};
Answer(res);
}
vector<int> M (N, 1);
int extremo = -1;
for (int i = 0; i < N; i++) {
M[i] = 0;
if (Query(M) == 1) {
extremo = i;
break;
}
M[i] = 1;
}
res.push_back(extremo+1);
M.assign(N, 0);
vector<bool> puesto(N, false);
puesto[extremo] = true;
int libro_izq = extremo;
while ((int)res.size() < N) {
for (int i = 0; i < N; i++) {
if (puesto[i]) continue;
M[libro_izq] = 1; M[i] = 1;
if (Query(M) == 1) {
res.push_back(i+1);
puesto[i] = true;
libro_izq = i;
break;
}
M[libro_izq] = 0; M[i] = 0;
}
}
Answer(res);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
87 ms |
284 KB |
# of queries: 9387 |
2 |
Correct |
150 ms |
272 KB |
# of queries: 9921 |
3 |
Correct |
183 ms |
272 KB |
# of queries: 10593 |
4 |
Correct |
192 ms |
200 KB |
# of queries: 9984 |
5 |
Correct |
179 ms |
200 KB |
# of queries: 10491 |
6 |
Correct |
149 ms |
272 KB |
# of queries: 9332 |
7 |
Correct |
173 ms |
200 KB |
# of queries: 10200 |
8 |
Correct |
126 ms |
288 KB |
# of queries: 9064 |
9 |
Correct |
152 ms |
324 KB |
# of queries: 10493 |
10 |
Correct |
56 ms |
200 KB |
# of queries: 4192 |
11 |
Runtime error |
1 ms |
292 KB |
Execution killed with signal 11 |
12 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
87 ms |
284 KB |
# of queries: 9387 |
2 |
Correct |
150 ms |
272 KB |
# of queries: 9921 |
3 |
Correct |
183 ms |
272 KB |
# of queries: 10593 |
4 |
Correct |
192 ms |
200 KB |
# of queries: 9984 |
5 |
Correct |
179 ms |
200 KB |
# of queries: 10491 |
6 |
Correct |
149 ms |
272 KB |
# of queries: 9332 |
7 |
Correct |
173 ms |
200 KB |
# of queries: 10200 |
8 |
Correct |
126 ms |
288 KB |
# of queries: 9064 |
9 |
Correct |
152 ms |
324 KB |
# of queries: 10493 |
10 |
Correct |
56 ms |
200 KB |
# of queries: 4192 |
11 |
Runtime error |
1 ms |
292 KB |
Execution killed with signal 11 |
12 |
Halted |
0 ms |
0 KB |
- |