# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
644246 | 2022-09-24T08:07:04 Z | Karuk | Secret Permutation (RMI19_permutation) | C++14 | 1 ms | 288 KB |
#include<bits/stdc++.h> #include "permutationc.h" using namespace std; void solve(int n) { int a[n]; for(int i=1;i<=n;i++) { a[i-1]=i; } int maxres=0,maxind=-1; for(int i=1;i<n;i++) { reverse(a,a+i-1); int c=query(a); reverse(a,a+i-1); if(c>maxres){maxres=c;maxind=a[i];} } swap(a[0],a[maxind]); maxres=0; maxind=-1; vector<pair<int,int> >v; for(int i=1;i<n;i++) { reverse(a,a+i-1); int c=query(a); reverse(a,a+i-1); v.push_back({c,a[i]}); } int ans[n]; sort(v.begin(),v.end()); ans[a[0]]=1; for(int i=2;i<=n;i++) { ans[v[i-2].second]=i; } answer(ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 288 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 288 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 288 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |