#include "bits/stdc++.h"
#include "machine.h"
using namespace std;
vector<int> find_permutation(int N) {
vector<int> A(N);
for (int i = 2; i < N; i++) A[i] = i;
vector<int> B = use_machine(A);
vector<int> C = B;
sort(C.begin(), C.end());
int X;
for (int i = 1; i < N; i++) if (C[i] == C[i-1]){X = C[i]; break;}
for (auto &e: B) e ^= X;
A[1] = 1;
A = use_machine(A);
for (auto &e: A) e ^= X;
return A;
}
# | 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... |