# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
978972 | 2024-05-10T05:11:57 Z | rshohruh | 순열 (APIO22_perm) | C++17 | 2 ms | 600 KB |
#include "perm.h" #include <bits/stdc++.h> using namespace std; #define ll long long std::vector<int> construct_permutation(long long k) { k--; vector<int> a; int cur = 0; while((1ll<<a.size())-1 <= k) a.push_back(cur++); a.pop_back(); --cur; k -= (1ll<<a.size())-1; int i = a.size()-1; for(int i = a.size()-1; i >= 0; --i){ if((1ll<<i) <= k){ a.insert(a.begin()+i, cur++); k -= (1ll<<i); } } return a; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 344 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Partially correct | 1 ms | 348 KB | Partially correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 344 KB | Output is correct |
8 | Partially correct | 2 ms | 344 KB | Partially correct |
9 | Correct | 1 ms | 344 KB | Output is correct |
10 | Partially correct | 1 ms | 600 KB | Partially correct |
11 | Partially correct | 1 ms | 348 KB | Partially correct |
12 | Partially correct | 1 ms | 348 KB | Partially correct |
13 | Partially correct | 1 ms | 348 KB | Partially correct |