# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1054408 | vjudge1 | Secret Permutation (RMI19_permutation) | C++14 | 1635 ms | 448 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.
#include "permutation.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int n) {
vector<int> v(n);
iota(v.begin(), v.end(), 1);
shuffle(v.begin(), v.end(), mt19937(1));
vector<int> d1(n);
for (int i=0; i<n; ++i){
d1[i]=query(v);
rotate(v.begin(), v.begin()+1, v.end());
}
int sum=accumulate(d1.begin(), d1.end(), 0)/(n-1);
for (int &i:d1) i=sum-i;
vector<int> ans(n);
vector<int> vis(n+1);
auto backtrack=[&](auto &&self, int i){
if (i>=n){
if (abs(ans[n-1]-ans[0])!=d1[0]) return;
vector<int> res(n);
for (int i=0; i<n; ++i) res[v[i]-1]=ans[i];
answer(res);
}
int x=ans[i-1]+d1[i];
if (1<=x && x<=n && !vis[x]){
vis[x]=1;
ans[i]=x;
self(self, i+1);
vis[x]=0;
}
x=ans[i-1]-d1[i];
if (1<=x && x<=n && !vis[x]){
vis[x]=1;
ans[i]=x;
self(self, i+1);
vis[x]=0;
}
};
for (int i=1; i<=n; ++i){
vis[i]=1;
ans[0]=i;
backtrack(backtrack, 1);
vis[i]=0;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |