# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
591758 | keta_tsimakuridze | Permutation (APIO22_perm) | C++17 | 2 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 "perm.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> x;
map<int,int> id;
/*
5
100000000000000
*/
void add(int a) {
x.push_back(a);
id[a] = (int)x.size() - 1;
}
std::vector<int> construct_permutation(long long k)
{
x.clear();
int l = 0, r = -1;
int b = 0;
for(int i = 0; i < 60; i++) if(k & (1ll << i)) b = i;
--b;
// cout << b << endl;
for(int i = b; i >= 1; i -= 2) {
ll b1 = k & (1ll << i);
ll b2 = k & (1ll << (i - 1));
if(!b1 && !b2) {
add(++r);
add(++r);
continue;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |