# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1054309 | 2024-08-12T08:36:37 Z | socpite | Secret Permutation (RMI19_permutation) | C++17 | 1 ms | 344 KB |
#include "permutation.h" #include<bits/stdc++.h> using namespace std; const int maxn = 300; namespace { long long D[maxn], DP[maxn]; int p, n; bool vis[maxn]; vector<int> crr; vector<vector<int>> allans; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); bool check(int val, int pos){ if(vis[val] || val < 1 || val > n)return false; if((pos+p)%n < pos && abs(val - crr[(pos+p)%n]) != DP[(pos+p)%n])return false; if((pos+n-p)%n < pos && abs(val - crr[(pos+n-p)%n]) != DP[pos])return false; if(pos == n-1 && abs(crr[0] - val) != D[0])return false; return true; } } void bt(int pos){ if(pos == n){ allans.push_back(crr); return; } int tmp = crr.back() + D[pos]; if(check(tmp, pos)){ crr.push_back(tmp); vis[tmp] = 1; bt(pos+1); vis[tmp] = 0; crr.pop_back(); } tmp = crr.back() - D[pos]; if(check(tmp, pos)){ crr.push_back(tmp); vis[tmp] = 1; bt(pos+1); vis[tmp] = 0; crr.pop_back(); } } void solve(int N) { n = N; long long sum = 0; vector<int> P(N); for(int i = 2; i <= N; i++){ if(__gcd(i, N) == 1){ p = i; break; } } iota(P.begin(), P.end(), 1); for(int i = 0; i < N; i++){ D[i] = query(P); sum += D[i]; P.push_back(P[0]); P.erase(P.begin()); } sum /= N-1; for(int i = 0; i < N; i++){ D[i] = sum - D[i]; // cout << D[i] << endl; } sum = 0; for(int i = 0; i < N; i++)P[i] = i*p%N + 1; for(int i = 0; i < N; i++){ DP[P[0]-1] = query(P); sum += DP[P[0]-1]; P.push_back(P[0]); P.erase(P.begin()); } sum/=N-1; for(int i = 0; i < N; i++){ DP[i] = sum - DP[i]; } allans.clear(); for(int i = 1; i <= N; i++){ crr.push_back(i); vis[i] = 1; bt(1); vis[i] = 0; crr.pop_back(); } answer(allans.back()); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 344 KB | Partially correct |
2 | Incorrect | 0 ms | 344 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 344 KB | Partially correct |
2 | Incorrect | 0 ms | 344 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 344 KB | Partially correct |
2 | Incorrect | 0 ms | 344 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |