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;
int n, m, k;
string s;
vector<int> arr;
vector<int> add(vector<int> a, vector<int> b) {
for (int &i : a) i += b.size();
for (int i : b) a.push_back(i);
return a;
}
vector<int> get(int p) {
vector<int> v;
foru(i, 0, p - 1) v.push_back(i);
return v;
}
vector<int> construct_permutation(long long k) {
vector<int> cur;
foru(i,0,59) if (k & (1LL << i))
cur = add(cur, get(i));
foru(i,0,__builtin_popcountll(k)+1) cur = add({0}, cur);
return cur;
}
/*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:
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |