#include<bits/stdc++.h>
#include "perm.h"
#define pb push_back
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
vector<int> construct_permutation(ll k) {
deque<int> q;
vector<int> v;
for(;k > 1;k >>= 1) {
if(k & 1) v.pb(0);
v.pb(1);
}
reverse(all(v));
int num = 0;
for(int i : v)
if(i) q.pb(num++);
else q.push_front(num++);
vector<int> p;
while(q.size()) p.pb(q.front()), q.pop_front();
return p;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
224 KB |
Output is correct |
2 |
Correct |
1 ms |
300 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
224 KB |
Output is correct |
2 |
Correct |
1 ms |
300 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
296 KB |
Output is correct |
5 |
Partially correct |
1 ms |
304 KB |
Partially correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
2 ms |
340 KB |
Output is correct |
8 |
Partially correct |
1 ms |
340 KB |
Partially correct |
9 |
Correct |
2 ms |
340 KB |
Output is correct |
10 |
Partially correct |
2 ms |
340 KB |
Partially correct |
11 |
Partially correct |
2 ms |
300 KB |
Partially correct |
12 |
Partially correct |
2 ms |
340 KB |
Partially correct |
13 |
Partially correct |
3 ms |
340 KB |
Partially correct |