# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
982950 | 2024-05-15T06:02:00 Z | Muhammad_Aneeq | 순열 (APIO22_perm) | C++17 | 2 ms | 516 KB |
#include "perm.h" #include <vector> #include <algorithm> using namespace std; vector<int> construct_permutation(long long k) { vector<int>bits; for (int i=59;i>=0;i--) { if ((1ll<<i)&k) bits.push_back(i); } reverse(begin(bits),end(bits)); int sz=bits.back()+bits.size()-1; int st=0,en=sz-1; vector<int>ans(sz,0); int j=0; for (int i=0;i<sz;i++) { if (j<bits.size()&&bits[j]==st) ans[i]=en--,j++; else ans[i]=st++; } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 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 | 516 KB | Output is correct |
5 | Partially correct | 1 ms | 348 KB | Partially correct |
6 | Correct | 2 ms | 344 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Partially correct | 1 ms | 344 KB | Partially correct |
9 | Correct | 1 ms | 344 KB | Output is correct |
10 | Partially correct | 1 ms | 344 KB | Partially correct |
11 | Partially correct | 1 ms | 348 KB | Partially correct |
12 | Partially correct | 2 ms | 348 KB | Partially correct |
13 | Partially correct | 2 ms | 348 KB | Partially correct |