#include "perm.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define INF (int)(1e9+1)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
vector<int> construct_permutation(ll k)
{
vector<int>v;
for(int i=0;i<=60;i++){
if(k&(1LL<<i))v.pb(i);
}
//cout<<"V:"<<'\n';
//for(int x:v)cout<<x<<" ";
//cout<<'\n';
vector<int>ans;
int n = sz(v);
vector<bool>used(150,0);
for(int i=0;i<n-1;i++)ans.pb(v[i]+i);
reverse(all(ans));
for(int x:ans)used[x] = 1;
int cnt = 0;
vector<int>a;
for(int i=0;i<=150;i++){
if(cnt == v.back())break;
if(!used[i]){
cnt++;
a.pb(i);
}
}
for(int x:ans)a.pb(x);
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
