| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 745168 | Dan4Life | 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 <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define all(a) begin(a), end(a)
vector<int> construct_permutation(ll n)
{
vector<double> v; v.clear();
vector<int> A,D; A.clear(); D.clear();
while(n>0) D.pb(n%4),n/=4;
reverse(all(D));
int cnt = 0; int T=0, k=0, X = -1;
double t3 = 1.95;
for(auto u : D){
if(!cnt){
if(u==2) v.pb(0),T=1;
else if(u==3) v.pb(1), v.pb(0),T=2, k=1;
//if(u==3) cout << "3! ";
cnt = 1;
}
else{
if(u==0) v.pb(T++), v.pb(T++);
else if(u==1) v.pb(T++), v.pb(T++), v.pb(X--);
else if(u==2) v.pb(T++), v.pb(X--), v.pb(T++);
//else if(k) v.pb(T++), v.pb(T++), v.pb(t3), t3-=0.01;
else v.pb(T++), v.pb(X--), v.pb(T++), v.pb(X--), t3=0.95, k=1;
}
}
auto w = v; sort(all(w));
for(auto u : v) A.pb(lower_bound(all(w),u)-begin(w));
return A;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
