# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48147 | antimirage | Library (JOI18_library) | C++14 | 0 ms | 0 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.
/**
Let me ...
**/
# include <bits/stdc++.h>
#include "library.h"
#define fr first
#define sc second
#define mk make_pair
#define pb push_back
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
const int N = 1005;
pair <int, int> ar[N];
bool used[N];
void Solve(int N)
{
int n = N;
vector <int> vec(n, 0), ans(n, 0);
for (int i = 0; i < n; i++)
{
vec[i] = 1;
for (int j = i + 1; j < n; j++)
{
vec[j] = 1;
int res = Query(vec);
if (res == 1)
{
if (ar[i].fr == 0)
ar[i].fr = j;
else
ar[i].sc = j;
if (ar[j].fr == 0)
ar[j].fr = i;
else
ar[j].sc = i;
}
vec[j] = 0;
}
vec[i] = 0;
}
for (int i = 0; i < n; i++)
{
if (ar[i].sc == 0)
{
ans[0] = i;
break;
}
}
used[ ans[0] ] = 1;
for (int i = 1; i < n; i++)
{
if (!used[ ar[ ans[i - 1] ].fr ])
{
ans[i] = ar[ ans[i - 1] ].fr;
used[ ans[i] ] = 1;
}
else if (!used[ ar[ ans[i - 1] ].sc ])
{
ans[i] = ar[ ans[i - 1] ].sc;
used[ ans[i] ] = 1;
}
}
for (int i = 0; i < n; i++)
ans[i]++;
Answer(ans);
}