#include "perm.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sz size()
#define pb push_back
#define lb lower_bound
#define all(x) x.begin(),x.end()
vector<int> construct_permutation(ll k){
int bit=64-__builtin_clzll(k);
vector<double> ans;
bool flag=false;
while(bit>0){
bit-=2;
if(bit==-1){
ans.pb(100);
if(k&1)ans.pb(-100);
}
else{
int val=(k>>bit)&3;
if(ans.empty()){
if(val==2) ans.pb(0);
else ans={1,0},flag=true;
continue;
}
if(val==0){
ans.pb(100);
ans.pb(101);
}
else if(val==1){
ans.pb(100);
ans.pb(101);
ans.pb(-100);
flag=true;
}
else if(val==2){
ans.pb(100);
ans.pb(-100);
ans.pb(101);
flag=true;
}
else{
if(!flag){
ans.pb(100);
ans.pb(-100);
ans.pb(101);
ans.pb(-101);
flag=true;
}
else{
ans.pb(100);
ans.pb(101);
ans.pb(1.5);
}
}
}
vector<double> uni(all(ans));
sort(all(uni));
for(auto &i:ans)i=lb(all(uni),i)-uni.begin();
}
return vector<int> (all(ans));
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
3 ms |
340 KB |
Output is correct |
6 |
Correct |
4 ms |
340 KB |
Output is correct |
7 |
Correct |
5 ms |
340 KB |
Output is correct |
8 |
Correct |
8 ms |
340 KB |
Output is correct |
9 |
Correct |
3 ms |
340 KB |
Output is correct |
10 |
Correct |
6 ms |
340 KB |
Output is correct |
11 |
Correct |
7 ms |
340 KB |
Output is correct |
12 |
Correct |
7 ms |
336 KB |
Output is correct |
13 |
Correct |
7 ms |
368 KB |
Output is correct |