# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
238862 | 2020-06-13T09:43:52 Z | Sorting | Secret Permutation (RMI19_permutation) | C++14 | 20 ms | 512 KB |
#include <bits/stdc++.h> #include "permutation.h" using namespace std; int query(int v[]); int query(vector<int> v); void answer(int v[]); void answer(vector<int> v); void solve(int n){ vector<int> v; for(int i = 1; i <= n; ++i) v.push_back(i); do{ if(query(v) == n - 1){ vector<int> p(n); for(int i = 0; i < n; ++i) p[v[i]] = i + 1; answer(p); return; } } while(next_permutation(v.begin(), v.end())); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 20 ms | 512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 20 ms | 512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 20 ms | 512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |