# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
907381 | Tymond | Permutation (APIO22_perm) | C++17 | 12 ms | 512 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;
void zmien(vector<ld>& a){
vector<ld> nasz = a;
sort(nasz.begin(), nasz.end());
for(int i = 0; i < (int)a.size(); i++){
for(int j = 0; j < nasz.size(); j++){
if(a[i] == nasz[j]){
a[i] = j;
break;
}
}
}
}
vector<signed> construct_permutation(ll k){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int aktBit = 64 - __builtin_clzll(k);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |