# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
706868 | grossly_overconfident | 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>
using namespace std;
set<long long> p;
vector<int> construct_permutation(long long k)
{
int q = 1;
if (p.empty()){
while (true){
p.insert(pow(2, q));
if (q == 62){
break;
}
q++;
}
}
long long remaining = k;
if (k % 2 != 0){
remaining -= 1;
}
vector<int> out;
vector<long long> found;
int os = 0;
if (k % 2 != 0){
out.push_back(INT_MAX);
os++;
}
int fs = 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |