# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
881686 | tsumondai | Permutation (APIO22_perm) | C++17 | 0 ms | 0 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 "perm.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
#define __TIME (1.0 * clock() / CLOCKS_PER_SEC)
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
const int N = 1e6 + 5;
const int oo = 1e9, mod = 1e9 + 7;
vector<int> construct_permutation(long long k) {
string bn="";
while(k)
{
bn+=k%2+'0';
k/=2;
}
reverse(bn.begin(),bn.end());
vector<long long> ret;
long long cur=0;
for(long long i=1;i<bn.size();i++)
{
ret.push_back(cur++);
if(bn[i]=='1ll')
ret.insert(ret.begin(),cur++);
}
return ret;
}
/*signed main() {
cin.tie(0)->sync_with_stdio(false);
//freopen(".inp", "r", stdin);
//freopen(".out", "w", stdout);
//process();
cerr << "Time elapsed: " << __TIME << " s.\n";
return 0;
}*/
/*
Xét các trường hợp đặc biệt
Kiểm tra lại input/output
Cố gắng trâu
Lật ngược bài toán
Keep calm and get VOI
Flow:
*/