# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
907377 | Tymond | Permutation (APIO22_perm) | C++17 | 13 ms | 600 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 <bits/stdc++.h>
#include "perm.h"
using namespace std;
using ll = long long;
using ld = long double;
const ld INF = 1e9;
vector<signed> construct_permutation(ll k){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int aktBit = 64 - __builtin_clzll(k);
vector<ld> ans;
bool bylo = false;
while(aktBit > 0){
aktBit -= 2;
if(aktBit == -1){
//został jeden na końcu
ans.push_back(INF);//n * 2
if(k & 1){
ans.push_back(-INF);//n + 1
}
}else{
int kon = (k >> aktBit) & 3;
if(ans.size() == 0){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |