# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
119091 | spacewalker | Library (JOI18_library) | C++14 | 3094 ms | 448 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <vector>
#include "library.h"
using namespace std;
void Solve(int N)
{
if (N == 1) {
Answer({1});
return;
}
int start = -1;
vector<int> toQuery(N, 1);
for (int i = 0; i < N; ++i) {
toQuery[i] = 0;
if (Query(toQuery) == 1) {
start = i;
break;
}
toQuery[i] = 1;
}
vector<int> ans{start};
// printf("start %d\n", start);
for (int i = 1; i < N; ++i) {
for (int pnext = 0; pnext < N; ++pnext) {
if (ans.size() > 1 && pnext == *next(ans.rbegin(), 1)) continue;
if (pnext == ans.back()) continue;
vector<int> toQuery(N);
toQuery[ans.back()] = toQuery[pnext] = 1;
if (Query(toQuery) == 1) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |