#include <bits/stdc++.h>
#include "machine.h"
using namespace std;
#define ll long long
const ll mmod = 998244353;
#define vl vector<long long>
#define vll vector<vector<long long>>
#define pl pair<long long, long long>
#define vb vector<bool>
std::vector<int> find_permutation(int N){
vector<int> cisla;
for (ll i = 0; i < N; i++){
cisla.push_back(i);
}
vector<int> p = use_machine(cisla);
int x;
for (x = 0; x <= 255; x++){
set<int> px;
for (ll i = 0; i < N; i++){
px.insert(p[i]^x);
}
bool ok = true;
for (ll i = 0; i < N; i++){
auto it = px.find(cisla[i]);
if (it == px.end()){
ok = false;
}
}
if (ok){
break;
}
}
for (ll i = 0; i < N; i++){
p[i] ^= x;
}
return p;
}
| # | 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... |