# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
638524 | Tuanlinh123 | Permutation (APIO22_perm) | C++17 | 3 ms | 340 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<bits/stdc++.h>
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
using namespace std;
#define LOCALIO "C:/Users/admin/Documents/Code/freopen/"
vector <int> construct_permutation (ll k)
{
vector <ll> action;
while (k>1)
{
bool added=0;
for (ll i=2; i<=29; i++)
if (k%i==0)
{
added=1;
action.pb(i);
k/=i;
break;
}
if (!added)
{
k--;
action.pb(1);
}
}
reverse(action.begin(), action.end());
deque <int> q;
ll num=0;
for (ll i=0; i<action.size(); i++)
{
if (action[i]==1)
{
q.push_back(num);
num++;
}
else
{
for (ll j=num+action[i]-2; j>=num; j--)
q.push_front(j);
num+=action[i]-1;
}
}
// cout << "bruh" << flush;
vector <int> res;
while (!q.empty())
{
res.pb(q.back());
q.pop_back();
}
return res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |