#include "machine.h"
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
std::vector<int> find_permutation(int n)
{
std::vector<int> a(n);
for (ll i = 0; i < n; i++)
a[i] = i;
if (n & 1)
{
std::vector<int> b = use_machine(a);
ll xxor = 0;
for (ll i = 0; i < n; i++) xxor ^= i ^ b[i];
for (ll i = 0; i < n; i++) b[i] ^= xxor;
return b;
}
else
{
}
return {0};
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |