| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1321043 | duckindog | Secret Permutation (RMI19_permutation) | C++20 | 0 ms | 0 KiB |
#include <algorithm>
#include <bits/stdc++.h>
#include <random>
#ifndef LOCAL
#include "permutationc.h"
#endif
using namespace std;
#ifdef LOCAL
vector<int> GLOBAL;
void answer(vector<int> P) {
assert(P == GLOBAL);
}
int query(vector<int> V) {
int ret = 0;
for (int i = 0; i < (int)V.size() - 1; ++i) {
ret += abs(GLOBAL[V[i]] - GLOBAL[V[i + 1]]);
}
return ret;
}
#endif
mt19937 rng(49853495);
void solve(int N) {
vector<vector<int>> V(N, vector<int>(N));
vector<int> value(N);
for (int i = 0; i < N; ++i) {
iota(V[i].begin(), V[i].end(), 1);
shuffle(V[i].begin(), V[i].end(), rng);
value[i] = query(V[i]);
}
vector<int> v(N); iota(v.begin(), v.end(), 1);
do {
bool isValid = true;
for (int i = 0; i < N; ++i) {
int ret = 0;
for (int j = 0; j < N - 1; ++j) ret += abs(v[V[i][j] - 1] - v[V[i][j]]);
if (ret != value[i]) {
isValid = false; break;
}
}
if (isValid) {
answer(v); return;
}
} while (next_permutation(v.begin(), v.end()));
}
#ifdef LOCAL
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
int N; cin >> N;
GLOBAL.resize(N);
for (auto& x : GLOBAL) cin >> x;
solve(N);
}
#endif
