# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
984205 | Izaz | Permutation (APIO22_perm) | C++17 | 3 ms | 600 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>
using namespace std;
#define f first
#define s second
#define mn(a,b) min(a,b)
#define mx(a,b) max(a,b)
#define ll long long
ll power[61];
int re(ll k){
for(int i = 0 ; i < 61 ;i++){
if(power[i]>k)return i-1;
}
return 61;
}
vector<int>Solve(vector<int>vec , int Now_adding, ll k){
if(k == 0 ){
return vec;
}
int MAXI = re(k);
vector<int>AL;
for(int i = 0 ; i < vec.size();i++){
if(i == MAXI){
AL.push_back(Now_adding);
}
AL.push_back(vec[i]);
}
if(MAXI == vec.size())AL.push_back(Now_adding);
return Solve(AL,Now_adding+1,k - (power[MAXI]));
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |